17th Latin American Theoretical Informatics Symposium

Important Dates for Papers

Attention: all deadlines are at 11:59pm AoE (Anywhere on Earth) time zone.

Paper Submission

Submissions are limited to fifteen (15) single-column letter-size pages in Springer LNCS format; see the LNCS author guidelines.

This page limit includes figures and references, but it does not include an optional appendix. Proofs omitted due to space constraints must be placed in the appendix, which will be read by the program committee members at their discretion. In particular, appendices of accepted papers are not going to be published in the proceedings. The main part of the submission should therefore contain a clear technical presentation of the merits of the paper, including a discussion of the paper's importance within the context of prior work and a description of the key technical and conceptual ideas used to achieve its main claims. The conference employs a lightweight double-blind reviewing process. Submissions should not reveal the identity of the authors in any way. In particular, authors' names, affiliations, and email addresses should not appear at the beginning or in the body of the submission. Authors should ensure that any references to their own related work is in the third person (e.g., not "We build on our previous work..." but rather "We build on the work of..."). Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult. In particular, references should not be omitted or anonymized.

Papers must be submitted electronically via the EasyChair submission system.

The submissions will be open one month before the abstract submission due date. Submit your abstract via EasyChair, before the abstract submission deadline. For full paper submission the deadline is one week later than that of the abstract submission.

Simultaneous submission of papers to any other conference with published proceedings, as well as the submission of previously published papers, is not allowed. Papers must be written in English. For each accepted paper at least one author must register and attend the symposium (in person) to present it. Moreover, an author cannot register for multiple papers. That is, each accepted paper must have its own registrant.

Proceedings

Accepted papers will appear in the proceedings of LATIN, which will be published in Springer Lecture Notes in Computer Science. Accepted papers need to be presented in-person in order to appear in the proceedings of LATIN. There must be a full registration associated with every accepted paper (even if the speaker qualifies for a discounted registration).

Special Issue

A special issue dedicated to selected papers of LATIN 2026 will be published in the journal Theoretical Computer Science.

Awards

Imre Simon Test of Time Award

As of 2012, the Imre Simon Test-of-Time Award is given to the LATIN paper deemed most influential among all those published at least ten years prior to the current edition of the conference.
Papers published in the LATIN proceedings up to and including 2016 are eligible for the 2026 award.

For more information on the nomination process see the permanent website on the award.

Best Paper Award

Papers presented at the conference will be considered for the LATIN 2026 Alejandro López-Ortiz Best Paper Award.

Important Dates for Posters

Attention: all deadlines are at 11:59pm AoE (Anywhere on Earth) time zone.

Poster Submission

LATIN 2026 will have poster sessions to facilitate and promote attendance. We especially encourage students and young researchers to submit their preliminary findings and ongoing work covering all the subjects of LATIN.

Authors of posters must submit a two-page abstract prepared using the Springer LNCS format. Detailed formatting instructions are available in the LNCS author guidelines.

All submissions will undergo peer review. At least one author of each accepted abstract is required to attend LATIN 2026 and present the work in person during the poster session. A template for the final poster can be downloaded here.

Abstracts of posters must be submitted electronically via the EasyChair submission system.

Accepted papers

• Majority Boolean networks classifying density: structural characterization and complexity. Marius Rolland and Kévin Perrot
• Graph Exploration with Edge Weight Estimates. Matthias Gehnen, Ralf Klasing, and Emile Naquin
• Computing Dominating Sets in Disk Graphs with Centers in Convex Position. Anastasiia Tkachenko and Haitao Wang
• A (4/3 + ε)-Approximation for Preemptive Scheduling with Batch Setup Times. Max A. Deppert, David Fischer and Klaus Jansen
• Launching Identity Testing into (Bounded) Space. Pranav Bisht, Nikhil Gupta, Prajakta Nimbhorkar and Ilya Volkovich
• On the near-tightness of chi ≤ 2r: a general sigma-ary construction and a binary case via LFSRs. Vinicius Tikara Venturi Date and Leandro Miranda Zatesko
• Fair Correlation Clustering Meets Graph Parameters. Johannes Blaha, Robert Ganian, Katharina Gillig, Jonathan Højlev and Simon Wietheger
• Online computation of normalized substring complexity. Gregory Kucherov and Yakov Nekrich
• Spirals and Beyond: Competitive Plane Search with Multi-Speed Agents. Konstantinos Georgiou, Caleb Jones and Matthew Madej
• Constructing alphabet reduction pairs of arrays. Sophie Toulouse
• Complexity of the Possible and the Necessary President Problem in Schulze Voting. Jörg Rothe and Jana Woitaschik
• Generating 2-Gray codes for grand Motzkin paths and grand Dyck paths with air pockets in constant amortized time. Lei Dong, Bowie Liu, Dennis Wong, Lin Chen, Chan-Tong Lam and Sio-Kei Im
• Quantum Circuit for Quantum Fourier Transform for Arbitrary Qubit Connectivity Graphs. Kamil Khadiev, Aliya Khadieva, Vadim Sagitov and Kamil Khasanov
• How many times can two minimum spanning trees cross?. Todor Antic, Morteza Saghafian, Maria Saumell, Felix Schröder, Josef Tkadlec and Pavel Valtr
• A 9/5-Approximation Algorithm for the Maximum Edge 2-Coloring Problem on Bipartite Graphs. Alexandru Popa
• Two Complexity Results on Spanning-Tree Congestion Problems. Sunny Atalig, Marek Chrobak, Christoph Durr, Petr Kolman, Huong Luu, Jiri Sgall and Gregory Zhou
• Homogeneous substructures in random ordered uniform matchings. Andrzej Dudek, Jarek Grytczuk, Jakub Przybylo and Andrzej Rucinski
• Local Resilience for Containment of Bounded Degree Spanning Subgraphs. Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa and Mihir Neve
• Multihead Finite-State Compression. Neil Lutz
• Optimized 2-approximation of Treewidth. Mahdi Belbasi, Martin Fürer and Medha Kumar
• Not all semirings are strong. David Madore and Jacques Sakarovitch
• Computational Complexity of Covers and Partial Covers of 2-in-2-out-regular Digraphs. Jiri Fiala, Samuel Gardelle, Jan Kratochvil and Andrzej Proskurowski
• Compressed Set Representations based on Set Difference. Meng He, Travis Gagie and Gonzalo Navarro
• On Numbers of Simplicial Walks and Equivalent Canonizations for Graph Recognition. Marek Cerný
• Coresets for Farthest Point Problems in Hyperbolic Space. Eunku Park and Antoine Vigneron
• How to Sort in a Refrigerator: Simple Entropy-Sensitive Strictly In-Place Sorting Algorithms. Michael T. Goodrich, Ofek Gila and Vinesh Sridhar
• Square root of split graphs: linear algorithms for threshold and split-indifference graphs. Aleffer Rocha, Renato Carmo and André L. P. Guedes
• Computing fixed point free automorphisms of graphs. Emanuel Juliano Morais Silva, Gabriel Coutinho, Vinicius Fernandes dos Santos, Sjanne Zeijlemaker and Aida Abiad
• A lower bound of 4 for online graph exploration. Julia Baligacs
• Hitting all longest paths in H-free graphs and H-graphs. Paloma de Lima, Amir Nikabadi and Pawel Rzazewski
• Dynamic data structures for twin-ordered matrices. Bartlomiej Bosek, Jadwiga Czyzewska, Evangelos Kipouridis, Wojciech Nadara, Michal Pilipczuk, Karol Wegrzycki and Anna Zych-Pawlewicz
• A Markov-Chain Characterization of Finite-State Dimension and a Generalization of Agafonov's Theorem. Laurent Bienvenu, Hugo Gimbert and Subin Pulari
• Combinatorial ranking algorithms for the general linear group. Gustavo Zambonin, Tiago Siqueira, Larissa Gremelmaier Rosa, Rodrigo Alois Muhr Stefanes, Ricardo Custódio and Daniel Panario
• Towards Succinct Beer Proper Interval Graphs. Meng He and Kaiyu Wu
• Inapproximability of H-Coloring Problems. Kamyar Khodamoradi and Arash Rafiey
• Splittable Spanning Trees and Balanced Forests in Random Graphs. David Gillman, Jacob Platnick and Dana Randall
• On the Computational Complexity of Asymmetric Median Consensus Trees. Daniel Harvey, Jesper Jansson and Yutong Yang
• Improvement of the Size of Control Alphabet for Controlled Generation of Unary Strings of Specified Length. Daihei Ise and Satoshi Kobayashi
• The Parameterized Complexity of Geometric 1-Planarity. Alexander Firbas
• Algorithms and Complexity for Edge Set Switching in Graphs. Christoph Kern, Alexander Firbas and Manuel Sorge
• Lazy List Merge Heaps. Gerth Stølting Brodal, John Iacono, Casper Rysgaard and Sebastian Wild
• Limits of Kernelization and Parametrization for Phylogenetic Diversity with Dependencies. Niels Holtgrefe, Jannik Schestag and Norbert Zeh