Advertisement

© 2014

LATIN 2014: Theoretical Informatics

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

  • Alberto Pardo
  • Alfredo Viola
Conference proceedings LATIN 2014

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

Table of contents

  1. Front Matter
    PDF

  2. Complexity 1

    1. Conjugacy in Baumslag’s Group, Generic Case Complexity, and Division in Power Circuits
      Volker Diekert, Alexei G. Myasnikov, Armin Weiß
      Pages 1-12
    2. Hierarchical Complexity of 2-Clique-Colouring Weakly Chordal Graphs and Perfect Graphs Having Cliques of Size at Least 3
      Helio B. Macêdo Filho, Raphael C. S. Machado, Celina M. H. Figueiredo
      Pages 13-23
    3. The Computational Complexity of the Game of Set and Its Theoretical Applications
      Michael Lampis, Valia Mitsou
      Pages 24-34

  3. Complexity 2

    1. Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line
      José R. Correa, Laurent Feuilloley, José A. Soto
      Pages 35-46
    2. Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds
      Nikhil Bansal, Tjark Vredeveld, Ruben van der Zwaan
      Pages 47-59
    3. False-Name Manipulation in Weighted Voting Games Is Hard for Probabilistic Polynomial Time
      Anja Rey, Jörg Rothe
      Pages 60-71
    4. A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width
      Martin Fürer
      Pages 72-83

  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

    1. A Characterization of Those Automata That Structurally Generate Finite Groups
      Ines Klimann, Matthieu Picantin
      Pages 180-189
    2. Linear Grammars with One-Sided Contexts and Their Automaton Representation
      Mikhail Barash, Alexander Okhotin
      Pages 190-201

  7. Computability

    1. On the Computability of Relations on λ-Terms and Rice’s Theorem - The Case of the Expansion Problem for Explicit Substitutions
      Edward Hermann Haeusler, Mauricio Ayala-Rincón
      Pages 202-213
    2. Computing in the Presence of Concurrent Solo Executions
      Maurice Herlihy, Sergio Rajsbaum, Michel Raynal, Julien Stainer
      Pages 214-225

About these proceedings

Introduction

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.

Keywords

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