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. Front Matter
  2. Complexity 1

  3. Complexity 2

  4. Computational Geometry 1

    1. Luis Barba, Prosenjit Bose, Stefan Langerman
      Pages 84-95
    2. Panagiotis Cheilaris, Elena Khramtcova, Stefan Langerman, Evanthia Papadopoulou
      Pages 96-107
    3. Prosenjit Bose, André van Renssen
      Pages 108-119
    4. Sang Won Bae, Matias Korman, Yoshio Okamoto, Haitao Wang
      Pages 120-131
  5. Graph Drawing

    1. Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
      Pages 132-143
    2. Muhammad Jawaherul Alam, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Alexander Wolff
      Pages 144-155
    3. Stephane Durocher, Stefan Felsner, Saeed Mehrabi, Debajyoti Mondal
      Pages 156-167
    4. Luca Castelli Aleardi, Éric Fusy, Anatolii Kostrygin
      Pages 168-179
  6. Automata

  7. Computability

    1. Maurice Herlihy, Sergio Rajsbaum, Michel Raynal, Julien Stainer
      Pages 214-225
  8. Algorithms on Graphs

    1. Toshimasa Ishii, Hirotaka Ono, Yushi Uno
      Pages 238-249
    2. Martín Farach-Colton, Meng-Tsung Tsai
      Pages 250-260
  9. Computational Geometry 2

    1. Rolf Klein, Christos Levcopoulos, Andrzej Lingas
      Pages 261-272
    2. Sang-Sub Kim, Hee-Kap Ahn
      Pages 273-284
    3. Stephane Durocher, Omrit Filtser, Robert Fraser, Ali D. Mehrabi, Saeed Mehrabi
      Pages 294-305
  10. Algorithms

    1. Sourav Chakraborty, Rameshwar Pratap, Sasanka Roy, Shubhangi Saraf
      Pages 306-317
    2. Matthias Englert, Nicolaos Matsakis, Marcin Mucha
      Pages 318-329
    3. Binay Bhattacharya, Tsunehiko Kameda, Zhao Song
      Pages 330-341
    4. Jurek Czyzowicz, Dariusz Dereniowski, Leszek Gasieniec, Ralf Klasing, Adrian Kosowski, Dominik Pająk
      Pages 342-354
  11. Random Structures

    1. Peter Allen, Julia Böttcher, Hiệp Hàn, Yoshiharu Kohayakawa, Yury Person
      Pages 355-366
    2. Philippe Duchon, Romaric Duvignau
      Pages 367-378
    3. Felipe De Campos Mesquita, Letícia Rodrigues Bueno, Rodrigo De Alencar Hausen
      Pages 379-390
    4. Colin McDiarmid, Kerstin Weller
      Pages 391-398
  12. Complexity on Graphs 1

    1. Min Chih Lin, Michel J. Mizrahi, Jayme L. Szwarcfiter
      Pages 399-408
    2. Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai
      Pages 409-420
    3. Marie Albenque, Kolja Knauer
      Pages 421-432
    4. Fabrício Benevides, Victor Campos, Mitre Dourado, Simon Griffiths, Robert Morris, Leonardo Sampaio et al.
      Pages 433-441
  13. Analytic Combinatorics

    1. Julien Clément, Laura Giambruno
      Pages 442-453
    2. Élie de Panafieu, Danièle Gardy, Bernhard Gittenberger, Markus Kuba
      Pages 454-465
  14. Analytic and Enumerative Combinatorics

    1. Eyal Ackerman, Michelle M. Allen, Gill Barequet, Maarten Löffler, Joshua Mermelstein, Diane L. Souvaine et al.
      Pages 478-489
  15. Complexity on Graphs 2

    1. Lukas Barth, Sara Irina Fabrikant, Stephen G. Kobourov, Anna Lubiw, Martin Nöllenburg, Yoshio Okamoto et al.
      Pages 514-525
    2. Pavol Hell, Shenwei Huang
      Pages 538-549
  16. Approximation Algorithms

    1. Nikhil Bansal, Cyriel Rutten, Suzanne van der Ster, Tjark Vredeveld, Ruben van der Zwaan
      Pages 550-561
    2. Lehilton L. C. Pedrosa, Maxim Sviridenko
      Pages 562-573

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