LATIN 2014: Theoretical Informatics

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

  • Alberto Pardo
  • Alfredo Viola
Conference proceedings LATIN 2014

DOI: 10.1007/978-3-642-54423-1

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

Table of contents (65 papers)

  1. Front Matter
  2. Complexity 1

  3. Complexity 2

  4. Computational Geometry 1

    1. Optimal Algorithms for Constrained 1-Center Problems
      Luis Barba, Prosenjit Bose, Stefan Langerman
      Pages 84-95
    2. A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters
      Panagiotis Cheilaris, Elena Khramtcova, Stefan Langerman, Evanthia Papadopoulou
      Pages 96-107
    3. Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs
      Prosenjit Bose, André van Renssen
      Pages 108-119
    4. Computing the L1 Geodesic Diameter and Center of a Simple Polygon in Linear Time
      Sang Won Bae, Matias Korman, Yoshio Okamoto, Haitao Wang
      Pages 120-131
  5. Graph Drawing

    1. The Planar Slope Number of Subcubic Graphs
      Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
      Pages 132-143
    2. Smooth Orthogonal Drawings of Planar Graphs
      Muhammad Jawaherul Alam, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Alexander Wolff
      Pages 144-155
    3. Drawing HV-Restricted Planar Graphs
      Stephane Durocher, Stefan Felsner, Saeed Mehrabi, Debajyoti Mondal
      Pages 156-167
    4. Periodic Planar Straight-Frame Drawings with Polynomial Resolution
      Luca Castelli Aleardi, Éric Fusy, Anatolii Kostrygin
      Pages 168-179
  6. Automata

  7. Computability

    1. Computing in the Presence of Concurrent Solo Executions
      Maurice Herlihy, Sergio Rajsbaum, Michel Raynal, Julien Stainer
      Pages 214-225

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

  • 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