Preface-S.I.: LATIN 2014

Abstract

This special issue contains the journal versions of a selection of papers from the 11th Latin American Symposium on Theoretical Informatics (LATIN), held on March 31–April 4 2014, in Montevideo, Uruguay. The conference covered a broad range of topics in theoretical computer science, including algorithms, analytic and enumerative combinatorics, analysis of algorithms, approximation algorithms, automata theory, combinatorics and graph theory, complexity theory, computability, computational algebra, computational geometry, data structures, graph drawing, and random structures. Eight papers were selected for this special issue, all of which went through the thorough reviewing process that is the standard for Algorithmica. The selection was based on two criteria: the quality of the manuscripts and the desire to give readers a sense of the breadth and depth of the topics covered by LATIN. The overview that follows underscores these points In A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters, Cheilaris, Khramtcova, Langerman and Papadopoulou present a construction based on point location, that computes this diagram in expected O(n log2 n) time and expected O(n) space. Their techniques efficiently handle nonstandard characteristics of generalizedVoronoi diagrams, such as sites of non-constant complexity, sites that are not enclosed in their Voronoi regions, and empty Voronoi regions. The conjugacy problem asks whether two words over generators of a fixed group G are conjugated. In Conjugacy in Baumslag’s group, generic case complexity,