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.

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • ISBN: 978-3-662-49529-2
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 109.99
Price excludes VAT (USA)

This is a preview of subscription content, access via your institution.

Table of contents (52 papers)

  1. Front Matter

    Pages I-XXVI
  2. A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion

    • Akanksha Agrawal, Sudeshna Kolay, Daniel Lokshtanov, Saket Saurabh
    Pages 1-13
  3. A Middle Curve Based on Discrete Fréchet Distance

    • Hee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk
    Pages 14-26
  4. Comparison-Based FIFO Buffer Management in QoS Switches

    • Kamal Al-Bawani, Matthias Englert, Matthias Westermann
    Pages 27-40
  5. Scheduling on Power-Heterogeneous Processors

    • Susanne Albers, Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Richard Stotz
    Pages 41-54
  6. Period Recovery over the Hamming and Edit Distances

    • Amihood Amir, Mika Amit, Gad M. Landau, Dina Sokol
    Pages 55-67
  7. Chasing Convex Bodies and Functions

    • Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Kevin Schewior, Michele Scquizzato
    Pages 68-81
  8. Parameterized Complexity of Red Blue Set Cover for Lines

    • Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh
    Pages 96-109
  9. Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons

    • Sang Won Bae, Chan-Su Shin, Antoine Vigneron
    Pages 110-122
  10. On Mobile Agent Verifiable Problems

    • Evangelos Bampas, David Ilcinkas
    Pages 123-137
  11. Computing Maximal Layers of Points in \(E^{f(n)}\)

    • Indranil Banerjee, Dana Richards
    Pages 138-151
  12. On the Total Number of Bends for Planar Octilinear Drawings

    • Michael A. Bekos, Michael Kaufmann, Robert Krug
    Pages 152-163
  13. Bidirectional Variable-Order de Bruijn Graphs

    • Djamal Belazzougui, Travis Gagie, Veli Mäkinen, Marco Previtali, Simon J. Puglisi
    Pages 164-178
  14. The Read/Write Protocol Complex Is Collapsible

    • Fernando Benavides, Sergio Rajsbaum
    Pages 179-191
  15. The I/O Complexity of Computing Prime Tables

    • Michael A. Bender, Rezaul Chowdhury, Alexander Conway, Martín Farach-Colton, Pramod Ganapathi, Rob Johnson et al.
    Pages 192-206
  16. Increasing Diamonds

    • Olivier Bodini, Matthieu Dien, Xavier Fontaine, Antoine Genitrini, Hsien-Kuei Hwang
    Pages 207-219
  17. Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs

    • Kateřina Böhmová, Yann Disser, Matúš Mihalák, Rastislav Šrámek
    Pages 220-234
  18. A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs

    • Édouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis
    Pages 235-248
  19. Improved Spanning Ratio for Low Degree Plane Spanners

    • Prosenjit Bose, Darryl Hill, Michiel Smid
    Pages 249-262

Other Volumes

  1. LATIN 2016: Theoretical Informatics

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

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.

Keywords

  • Combinatorial optimization
  • Cryptology
  • Data structures
  • Distributed computing
  • Internet and the Web
  • Approximation algorithms
  • Automata
  • Complexity theory
  • Data compression
  • Databases
  • Discrete mathematics
  • Formal languages
  • Formal methods
  • Graph theory
  • Information retrieval
  • Linear programming
  • Online algorithms
  • Parallel computing
  • Pattern matching
  • Security
  • algorithm analysis and problem complexity

Editors and Affiliations

  • Carleton University, Ottawa, ON, Canada

    Evangelos Kranakis

  • University Chile, Santiago, Chile

    Gonzalo Navarro

Bibliographic Information

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • ISBN: 978-3-662-49529-2
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 109.99
Price excludes VAT (USA)