LATIN 2014: Theoretical Informatics

11th Latin American Symposium, Montevideo, Uruguay, March 31–April 4, 2014. Proceedings

  • Alberto Pardo
  • Alfredo Viola

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

Table of contents

  1. Approximation Algorithms

    1. Mário César San Felice, David P. Williamson, Orlando Lee
      Pages 574-585
    2. Amihood Amir, Jessica Ficler, Robert Krauthgamer, Liam Roditty, Oren Sar Shalom
      Pages 586-597
    3. Matthias Poloczek, David P. Williamson, Anke van Zuylen
      Pages 598-609
  2. Analysis of Algorithms

    1. Antonios Antoniadis, Neal Barcelo, Daniel Cole, Kyle Fox, Benjamin Moseley, Michael Nugent et al.
      Pages 610-621
    2. Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Eduardo Pacheco
      Pages 622-633
    3. Kévin Perrot, Éric Rémila
      Pages 634-647
  3. Computational Algebra

    1. Deepanjan Kesh, Shashank K. Mehta
      Pages 648-659
  4. Aplications to Bioinformatics

  5. Budget Problems

    1. Josep Díaz, Ioannis Giotis, Lefteris Kirousis, Evangelos Markakis, Maria Serna
      Pages 695-706
    2. Cristina G. Fernandes, Rafael C. S. Schouery
      Pages 707-718
    3. Thibaut Horel, Stratis Ioannidis, S. Muthukrishnan
      Pages 719-730
  6. Algorithms and Data Structures

    1. Travis Gagie, Paweł Gawrychowski, Juha Kärkkäinen, Yakov Nekrich, Simon J. Puglisi
      Pages 731-742
    2. Nikolett Bereczky, Amalia Duch, Krisztián Németh, Salvador Roura
      Pages 743-754
    3. Prosenjit Bose, Rolf Fagerberg, John Howat, Pat Morin
      Pages 755-764
  7. Back Matter

About these proceedings


This book constitutes the refereed proceedings of the 11th Latin American Symposium on Theoretical Informatics, LATIN 2014, held in Montevideo, Uruguay, in March/April 2014. The 65 papers presented together with 5 abstracts were carefully reviewed and selected from 192 submissions. The papers address a variety of topics in theoretical computer science with a certain focus on complexity, computational geometry, graph drawing, automata, computability, algorithms on graphs, algorithms, random structures, complexity on graphs, analytic combinatorics, analytic and enumerative combinatorics, approximation algorithms, analysis of algorithms, computational algebra, applications to bioinformatics, budget problems, and algorithms and data structures.


algorithms approximation algorithms automata budget problems combinatorics complexity on graphs computability computational complexity computational geometry data structures discrete mathematics game theory graph algorithms graph coloring graph drawing planar graphs random structures theoretical computer science theory of computation

Editors and affiliations

  • Alberto Pardo
    • 1
  • Alfredo Viola
    • 1
  1. 1.Facultad de Ingeniería, Instituto de ComputaciónUniversidad de la RepúblicaMontevideoUruguay

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2014
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-54422-4
  • Online ISBN 978-3-642-54423-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
IT & Software