LATIN 2014: Theoretical Informatics

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

Editors:

ISBN: 978-3-642-54422-4 (Print) 978-3-642-54423-1 (Online)

Table of contents (65 chapters)

previous Page of 4
  1. Front Matter

    Pages -

  2. Complexity 1

    1. No Access

      Book Chapter

      Pages 1-12

      Conjugacy in Baumslag’s Group, Generic Case Complexity, and Division in Power Circuits

    2. No Access

      Book Chapter

      Pages 13-23

      Hierarchical Complexity of 2-Clique-Colouring Weakly Chordal Graphs and Perfect Graphs Having Cliques of Size at Least 3

    3. No Access

      Book Chapter

      Pages 24-34

      The Computational Complexity of the Game of Set and Its Theoretical Applications

  3. Complexity 2

    1. No Access

      Book Chapter

      Pages 35-46

      Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line

    2. No Access

      Book Chapter

      Pages 47-59

      Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds

    3. No Access

      Book Chapter

      Pages 60-71

      False-Name Manipulation in Weighted Voting Games Is Hard for Probabilistic Polynomial Time

    4. No Access

      Book Chapter

      Pages 72-83

      A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width

  4. Computational Geometry 1

    1. No Access

      Book Chapter

      Pages 84-95

      Optimal Algorithms for Constrained 1-Center Problems

    2. No Access

      Book Chapter

      Pages 96-107

      A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters

    3. No Access

      Book Chapter

      Pages 108-119

      Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs

    4. No Access

      Book Chapter

      Pages 120-131

      Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time

  5. Graph Drawing

    1. No Access

      Book Chapter

      Pages 132-143

      The Planar Slope Number of Subcubic Graphs

    2. No Access

      Book Chapter

      Pages 144-155

      Smooth Orthogonal Drawings of Planar Graphs

    3. No Access

      Book Chapter

      Pages 156-167

      Drawing HV-Restricted Planar Graphs

    4. No Access

      Book Chapter

      Pages 168-179

      Periodic Planar Straight-Frame Drawings with Polynomial Resolution

  6. Automata

    1. No Access

      Book Chapter

      Pages 180-189

      A Characterization of Those Automata That Structurally Generate Finite Groups

    2. No Access

      Book Chapter

      Pages 190-201

      Linear Grammars with One-Sided Contexts and Their Automaton Representation

  7. Computability

    1. No Access

      Book Chapter

      Pages 202-213

      On the Computability of Relations on λ-Terms and Rice’s Theorem - The Case of the Expansion Problem for Explicit Substitutions

    2. No Access

      Book Chapter

      Pages 214-225

      Computing in the Presence of Concurrent Solo Executions

  8. Algorithms on Graphs

    1. No Access

      Book Chapter

      Pages 226-237

      Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems

previous Page of 4