Skip to main content
SpringerLink
Log in
SpringerLink
Log in

LATIN 2016: Theoretical Informatics

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

  • Conference proceedings
  • © 2016

Overview

Editors:
  1. Evangelos Kranakis

    1. Carleton University, Ottawa, ON, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Gonzalo Navarro

    1. University Chile, Santiago, Chile

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Edgar Chávez
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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)

Included in the following conference series:

Conference proceedings info: LATIN 2016.

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (52 papers)

  1. Front Matter

    Pages I-XXVI
    Download chapter PDF

  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 Lower Bounds and Dichotomy Results for the NP-completeness of H-free Edge Modification Problems

    • N. R. Aravind, R. B. Sandeep, Naveen Sivadasan
    Pages 82-95

  9. Parameterized Complexity of Red Blue Set Cover for Lines

    • Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh
    Pages 96-109

  10. Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons

    • Sang Won Bae, Chan-Su Shin, Antoine Vigneron
    Pages 110-122

  11. On Mobile Agent Verifiable Problems

    • Evangelos Bampas, David Ilcinkas
    Pages 123-137

  12. Computing Maximal Layers of Points in \(E^{f(n)}\)

    • Indranil Banerjee, Dana Richards
    Pages 138-151

  13. On the Total Number of Bends for Planar Octilinear Drawings

    • Michael A. Bekos, Michael Kaufmann, Robert Krug
    Pages 152-163

  14. Bidirectional Variable-Order de Bruijn Graphs

    • Djamal Belazzougui, Travis Gagie, Veli Mäkinen, Marco Previtali, Simon J. Puglisi
    Pages 164-178

  15. The Read/Write Protocol Complex Is Collapsible

    • Fernando Benavides, Sergio Rajsbaum
    Pages 179-191

  16. 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

  17. Increasing Diamonds

    • Olivier Bodini, Matthieu Dien, Xavier Fontaine, Antoine Genitrini, Hsien-Kuei Hwang
    Pages 207-219

  18. 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

  19. 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

  20. Improved Spanning Ratio for Low Degree Plane Spanners

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

Other volumes

  1. LATIN 2016: Theoretical Informatics

Keywords

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

Publish with us

Policies and ethics

Back to top

Search

Navigation