International Symposium on Latin American Theoretical Informatics

LATIN

CORE rank

CORE rank (raw)

Fields of research

Theory of Computation

Papers indexed

851

1992–2024

Best Theory of Computation conferences

Papers per year

199273 peak2024

Most published authors

LATIN papers

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

Year	Title	Authors
2020	Farthest Color Voronoi Diagrams: Complexity and Algorithms.	Ioannis Mantas, Evanthia Papadopoulou, Vera Sacristn, Rodrigo I. Silveira
2020	Towards a Definitive Measure of Repetitiveness.	Tomasz Kociumaka, Gonzalo Navarro, Nicola Prezza
2020	Shortest Rectilinear Path Queries to Rectangles in a Rectangular Domain.	Mincheol Kim, Sang Duk Yoon, Hee-Kap Ahn
2020	Suffix Trees, DAWGs and CDAWGs for Forward and Backward Tries.	Shunsuke Inenaga
2020	Quasi-Random Words and Limits of Word Sequences.	Hip Hn, Marcos Kiwi, Matas Pavez-Sign
2020	On the Helly Subclasses of Interval Bigraphs and Circular Arc Bigraphs.	Marina Groshaus, Andr Luiz Pires Guedes, Fabricio Schiavon Kolberg
2020	Structural Parameterizations for Equitable Coloring.	Guilherme de C. M. Gomes, Matheus R. Guedes, Vincius Fernandes dos Santos
2020	Graph Square Roots of Small Distance from Degree One Graphs.	Petr A. Golovach, Paloma T. Lima, Charis Papadopoulos
2020	Graph Hamiltonicity Parameterized by Proper Interval Deletion Set.	Petr A. Golovach, R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi
2020	Leafy Spanning Arborescences in DAGs.	Cristina G. Fernandes, Carla Negri Lintzmayer
2020	Scheduling on Hybrid Platforms: Improved Approximability Window.	Vincent Fagnon, Imed Kacem, Giorgio Lucarelli, Bertrand Simon
2020	Approximation Algorithms for Cost-Robust Discrete Minimization Problems Based on Their LP-Relaxations.	Khaled M. Elbassioni
2020	Near-Linear Time Algorithm for Approximate Minimum Degree Spanning Trees.	Ran Duan, Haoqing He, Tianyi Zhang
2020	On Some Subclasses of Split B	Zakir Deniz, Simon Nivelle, Bernard Ries, David Schindl
2020	Sherali-Adams and the Binary Encoding of Combinatorial Principles.	Stefan S. Dantchev, Abdul Ghani, Barnaby Martin
2020	Asymptotics for Push on the Complete Graph.	Rami Daknama, Konstantinos Panagiotou, Simon Reisser
2020	Tight Bounds on Sensitivity and Block Sensitivity of Some Classes of Transitive Functions.	Siddhesh Chaubal, Anna Gl
2020	Query Minimization Under Stochastic Uncertainty.	Steven Chaplick, Magns M. Halldrsson, Murilo Santos de Lima, Tigran Tonoyan
2020	Monotone Circuit Lower Bounds from Robust Sunflowers.	Bruno Pasqualotto Cavalar, Mrinal Kumar, Benjamin Rossman
2020	Lower Bounds for Max-Cut via Semidefinite Programming.	Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan
2020	PTAS for Steiner Tree on Map Graphs.	Jaroslaw Byrka, Mateusz Lewandowski, Syed Mohammad Meesum, Joachim Spoerhase, Sumedha Uniyal
2020	Ordered Strip Packing.	Kevin Buchin, Dmitry Kosolobov, Willem Sonke, Bettina Speckmann, Kevin Verbeek
2020	Probabilistically Faulty Searching on a Half-Line - (Extended Abstract).	Anthony Bonato, Konstantinos Georgiou, Calum MacRury, Pawel Pralat
2020	A Method to Prove the Nonrationality of Some Combinatorial Generating Functions.	Mikls Bna
2020	Steiner Trees for Hereditary Graph Classes.	Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Danil Paulusma, Erik Jan van Leeuwen

101–125 of 851← Previous Next →

Comparable venues

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