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
Springer-Verlag Berlin Heidelberg 2014
Springer, Berlin, Heidelberg
Series Print ISSN
Series Online ISSN
About this book