Skip to main content
  • Conference proceedings
  • © 2016

LATIN 2016: Theoretical Informatics

12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings

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

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

Conference series link(s): LATIN: Latin American Symposium on Theoretical Informatics

Conference proceedings info: LATIN 2016.

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

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

Table of contents (52 papers)

  1. Constructing Consistent Digital Line Segments

    • Iffat Chowdhury, Matt Gibson
    Pages 263-274
  2. Faster Information Gathering in Ad-Hoc Radio Tree Networks

    • Marek Chrobak, Kevin P. Costello
    Pages 275-289
  3. Stabbing Circles for Sets of Segments in the Plane

    • Mercè Claverol, Elena Khramtcova, Evanthia Papadopoulou, Maria Saumell, Carlos Seara
    Pages 290-305
  4. Faster Algorithms to Enumerate Hypergraph Transversals

    • Manfred Cochefert, Jean-François Couturier, Serge Gaspers, Dieter Kratsch
    Pages 306-318
  5. Listing Acyclic Orientations of Graphs with Single and Multiple Sources

    • Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi
    Pages 319-333
  6. Linear-Time Sequence Comparison Using Minimal Absent Words & Applications

    • Maxime Crochemore, Gabriele Fici, Robert Mercaş, Solon P. Pissis
    Pages 334-346
  7. The Grandmama de Bruijn Sequence for Binary Strings

    • Patrick Baxter Dragon, Oscar I. Hernandez, Aaron Williams
    Pages 347-361
  8. Compressing Bounded Degree Graphs

    • Pål Grønås Drange, Markus Dregi, R. B. Sandeep
    Pages 362-375
  9. Random Partial Match in Quad-K-d Trees

    • A. Duch, G. Lau, C. Martínez
    Pages 376-389
  10. From Discrepancy to Majority

    • David Eppstein, Daniel S. Hirschberg
    Pages 390-402
  11. On the Planar Split Thickness of Graphs

    • David Eppstein, Philipp Kindermann, Stephen Kobourov, Giuseppe Liotta, Anna Lubiw, Aude Maignan et al.
    Pages 403-415
  12. A Bounded-Risk Mechanism for the Kidney Exchange Game

    • Hossein Esfandiari, Guy Kortsarz
    Pages 416-428
  13. Tight Approximations of Degeneracy in Large Graphs

    • Martín Farach-Colton, Meng-Tsung Tsai
    Pages 429-440
  14. Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center

    • Cristina G. Fernandes, Samuel P. de Paula, Lehilton L. C. Pedrosa
    Pages 441-453
  15. Bundled Crossings in Embedded Graphs

    • Martin Fink, John Hershberger, Subhash Suri, Kevin Verbeek
    Pages 454-468
  16. Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering

    • Carsten Fischer, Heiko Röglin
    Pages 469-482
  17. Deterministic Sparse Suffix Sorting on Rewritable Texts

    • Johannes Fischer, Tomohiro I., Dominik Köppl
    Pages 483-496
  18. Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings

    • Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers
    Pages 497-508
  19. Unshuffling Permutations

    • Samuele Giraudo, Stéphane Vialette
    Pages 509-521
  20. Generating Random Spanning Trees via Fast Matrix Multiplication

    • Nicholas J. A. Harvey, Keyulu Xu
    Pages 522-535

Other Volumes

  1. LATIN 2016: Theoretical Informatics

About this book

This book constitutes the refereed proceedings of the 12th Latin American Symposium on Theoretical Informatics, LATIN 2016, held in Ensenada, Mexico, in April 2016.
The 52 papers presented together with 5 abstracts were carefully reviewed and selected from 131 submissions. The papers address a variety of topics in theoretical computer science with a certain focus on algorithms (approximation, online, randomized, algorithmic game theory, etc.), analytic combinatorics and analysis of algorithms, automata theory and formal languages, coding theory and data compression, combinatorial algorithms, combinatorial optimization, combinatorics and graph theory, complexity theory, computational algebra, computational biology, computational geometry, computational number theory, cryptology, databases and information retrieval, data structures, formal methods and security, Internet and the web, parallel and distributed computing, pattern matching, programming language theory, and random structures.

Editors and Affiliations

  • Carleton University, Ottawa, ON, Canada

    Evangelos Kranakis

  • University Chile, Santiago, Chile

    Gonzalo Navarro

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access