Skip to main content
Springer Nature Link
Log in

LATIN 2008: Theoretical Informatics

8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings

  • Conference proceedings
  • © 2008

Overview

Editors:
  1. Eduardo Sany Laber
  2. Claudson Bornstein
  3. Loana Tito Nogueira
  4. Luerbio Faria

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 4957)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: LATIN 2008.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book EUR 106.99
Price includes VAT (Germany)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

') var buybox = document.querySelector("[data-id=id_"+ timestamp +"]").parentNode var buyboxMaxSingleColumnWidth = 480 ;[].slice.call(buybox.querySelectorAll(".buying-option")).forEach(initCollapsibles) function initCollapsibles(buyingOption, index) { var toggle = buyingOption.querySelector(".buying-option-price") buyingOption.classList.remove("expanded") var form = buyingOption.querySelector(".buying-option-form") var priceInfo = buyingOption.querySelector(".price-info") if (toggle && form && priceInfo) { toggle.setAttribute("role", "button") toggle.setAttribute("tabindex", "0") toggle.addEventListener("click", function (event) { var expandedBuyingOptions = buybox.querySelectorAll(".buying-option.expanded") var buyboxWidth = buybox.offsetWidth ;[].slice.call(expandedBuyingOptions).forEach(function(option) { if (buyboxWidth -1 ;[].slice.call(buybox.querySelectorAll(".buying-option")).forEach(function (option, index) { var toggle = option.querySelector(".buying-option-price") var form = option.querySelector(".buying-option-form") var priceInfo = option.querySelector(".price-info") if (allOptionsInitiallyCollapsed || narrowBuyboxArea && index > 0) { toggle.setAttribute("aria-expanded", "false") form.hidden = "hidden" priceInfo.hidden = "hidden" } else { toggle.click() } }) } initialStateOpen() if (window.buyboxInitialised) return window.buyboxInitialised = true initKeyControls() })()

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Keywords

Table of contents (67 papers)

  1. Front Matter

    Download chapter PDF

  2. Profile of Tries

    • G. Park, H. -K Hwang, P. Nicodème, W. Szpankowski
    Pages 1-11

  3. Random 2-XORSAT at the Satisfiability Threshold

    • Hervé Daudé, Vlady Ravelomanana
    Pages 12-23

  4. On Dissemination Thresholds in Regular and Irregular Graph Classes

    • I. Rapaport, K. Suchan, I. Todinca, J. Verstraete
    Pages 24-35

  5. How to Complete a Doubling Metric

    • Anupam Gupta, Kunal Talwar
    Pages 36-47

  6. Sorting and Selection with Random Costs

    • Stanislav Angelov, Keshav Kunal, Andrew McGregor
    Pages 48-59

  7. Guided Search and a Faster Deterministic Algorithm for 3-SAT

    • Dominik Scheder
    Pages 60-71

  8. Comparing and Aggregating Partially Resolved Trees

    • Mukul S. Bansal, Jianrong Dong, David Fernández-Baca
    Pages 72-83

  9. Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices

    • Raphaël M. Jungers, Vladimir Yu. Protasov, Vincent D. Blondel
    Pages 84-93

  10. On Stateless Multihead Automata: Hierarchies and the Emptiness Problem

    • Oscar H. Ibarra, Juhani Karhumäki, Alexander Okhotin
    Pages 94-105

  11. Myhill-Nerode Theorem for Recognizable Tree Series Revisited

    • Andreas Maletti
    Pages 106-120

  12. The View Selection Problem for Regular Path Queries

    • Sergey Afonin
    Pages 121-132

  13. Optimal Higher Order Delaunay Triangulations of Polygons

    • Rodrigo I. Silveira, Marc van Kreveld
    Pages 133-145

  14. Coloring Geometric Range Spaces

    • Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, Shakhar Smorodinsky
    Pages 146-157

  15. Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes

    • J. Czyzowicz, S. Dobrev, T. Fevens, H. González-Aguilar, E. Kranakis, J. Opatrny et al.
    Pages 158-169

  16. Spanners of Complete k-Partite Geometric Graphs

    • Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel Smid
    Pages 170-181

  17. Minimum Cost Homomorphisms to Reflexive Digraphs

    • Arvind Gupta, Pavol Hell, Mehdi Karimi, Arash Rafiey
    Pages 182-193

  18. On the Complexity of Reconstructing H-free Graphs from Their Star Systems

    • Fedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle
    Pages 194-205

  19. Optimization and Recognition for K 5-minor Free Graphs in Linear Time

    • Bruce Reed, Zhentao Li
    Pages 206-215

  20. Bandwidth of Bipartite Permutation Graphs in Polynomial Time

    • Pinar Heggernes, Dieter Kratsch, Daniel Meister
    Pages 216-227
Back to top

Other volumes

  1. LATIN 2008: Theoretical Informatics

Accessibility Information

Accessibility information for this book is coming soon. We're working to make it available as quickly as possible. Thank you for your patience.

Bibliographic Information

Publish with us

Policies and ethics

Back to top