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
2018The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue.R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi
2018Maximal and Convex Layers of Random Point Sets.Meng He, Cuong P. Nguyen, Norbert Zeh
2018Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions.Sourav Chakraborty, Sushrut Karmalkar, Srijita Kundu, Satyanarayana V. Lokam, Nitin Saurabh
2016Independent Set of Convex Polygons: From nAndreas Wiese
2016(k, n-k)-Max-Cut: An 𝒪Saket Saurabh, Meirav Zehavi
2016Simple Approximation Algorithms for Balanced MAX 2SAT.Alice Paul, Matthias Poloczek, David P. Williamson
2016Computing a Geodesic Two-Center of Points in a Simple Polygon.Eunjin Oh, Sang Won Bae, Hee-Kap Ahn
2016New Deterministic Algorithms for Solving Parity Games.Matthias Mnich, Heiko Rglin, Clemens Rsner
2016Rank Reduction of Directed Graphs by Vertex and Edge Deletions.Syed Mohammad Meesum, Saket Saurabh
2016Trees and Languages with Periodic Signature.Victor Marsault, Jacques Sakarovitch
2016Containment and Evasion in Stochastic Point Data.Nirman Kumar, Subhash Suri
2016Edge-Editing to a Dense and a Sparse Graph Class.Michal Kotrbck, Rastislav Krlovic, Sebastian Ordyniak
2016Graph Drawings with One Bend and Few Slopes.Kolja Knauer, Bartosz Walczak
2016Routing in Unit Disk Graphs.Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
2016Generating Random Spanning Trees via Fast Matrix Multiplication.Nicholas J. A. Harvey, Keyulu Xu
2016Unshuffling Permutations.Samuele Giraudo, Stphane Vialette
2016Tree Compression Using String Grammars.Moses Ganardi, Danny Hucke, Markus Lohrey, Eric Noeth
2016Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings.Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers
2016Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering.Carsten Fischer, Heiko Rglin
2016Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center.Cristina G. Fernandes, Samuel P. de Paula, Lehilton L. C. Pedrosa
2016Tight Approximations of Degeneracy in Large Graphs.Martin Farach-Colton, Meng-Tsung Tsai
2016A Bounded-Risk Mechanism for the Kidney Exchange Game.Hossein Esfandiari, Guy Kortsarz
2016On the Planar Split Thickness of Graphs.David Eppstein, Philipp Kindermann, Stephen G. Kobourov, Giuseppe Liotta, Anna Lubiw, Aude Maignan, Debajyoti Mondal, Hamideh Vosoughpour, Sue Whitesides, Stephen K. Wismath
2016From Discrepancy to Majority.David Eppstein, Daniel S. Hirschberg
2016Random Partial Match in Quad-K-d Trees.Amalia Duch, Gustavo Lau, Conrado Martnez
201225 of 851← PreviousNext →

Comparable venues

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