Skip to content

International Symposium on Latin American Theoretical Informatics

LATIN

B

CORE rank

CORE rank (raw)

B

Fields of research

Theory of Computation

Papers indexed

851

1992–2024

Papers per year

199273 peak2024

LATIN papers

851 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
2010Complexity of Operations on Cofinite Languages.Frdrique Bassino, Laura Giambruno, Cyril Nicaud
2010Compact Rich-Functional Binary Relation Representations.Jrmy Barbay, Francisco Claude, Gonzalo Navarro
2010Tilings Robust to Errors.Alexis Ballier, Bruno Durand, Emmanuel Jeandel
2010The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions.Jonathan Backer, J. Mark Keil
2010On Quadratic Threshold CSPs.Per Austrin, Siavosh Benabbas, Avner Magen
2010Approximating Maximum Diameter-Bounded Subgraphs.Yuichi Asahiro, Eiji Miyano, Kazuaki Samizo
2010Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines.Eric Angel, Evripidis Bampis, Nicolas Thibault
2010Colorful Strips.Greg Aloupis, Jean Cardinal, Sbastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian
2010Matching Points with Things.Greg Aloupis, Jean Cardinal, Sbastien Collette, Erik D. Demaine, Martin L. Demaine, Muriel Dulieu, Ruy Fabila-Monroy, Vi Hart, Ferran Hurtado, Stefan Langerman, Maria Saumell, Carlos Seara, Perouz Taslakian
2010Lipschitz Unimodal and Isotonic Regression on Paths and Trees.Pankaj K. Agarwal, Jeff M. Phillips, Bardia Sadri
2008On 2-Subcolourings of Chordal Graphs.Juraj Stacho
2008Optimal Higher Order Delaunay Triangulations of Polygons.Rodrigo I. Silveira, Marc J. van Kreveld
2008Pseudorandom Graphs from Elliptic Curves.Igor E. Shparlinski
2008Guided Search and a Faster Deterministic Algorithm for 3-SAT.Dominik Scheder
2008Fully-Compressed Suffix Trees.Lus M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira
2008Optimization and Recognition for K 5-minor Free Graphs in Linear Time.Bruce A. Reed, Zhentao Li
2008On Dissemination Thresholds in Regular and Irregular Graph Classes.Ivan Rapaport, Karol Suchan, Ioan Todinca, Jacques Verstrate
2008Profile of Tries.GaHyun Park, Hsien-Kuei Hwang, Pierre Nicodme, Wojciech Szpankowski
2008An Improved Algorithm Finding Nearest Neighbor Using Kd-trees.Rina Panigrahy
2008Approximating Steiner Networks with Node Weights.Zeev Nutov
2008I/O-Efficient Point Location in a Set of Rectangles.Yakov Nekrich
2008The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences.Richard Matthew McCutchen
2008Algorithms to Locate Errors Using Covering Arrays.Conrado Martnez, Lucia Moura, Daniel Panario, Brett Stevens
2008Myhill-Nerode Theorem for Recognizable Tree Series Revisited.Andreas Maletti
2008Weighted Rectilinear Approximation of Points in the Plane.Mario Alberto Lpez, Yan Mayster
426450 of 851← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.