LATIN 2024

March 18 – 22, 2024 in Puerto Varas/Chile


LATIN (Latin American Theoretical Informatics) was born in 1992, when a group of Latin American researchers, under the leadership of Imre Simon (São Paulo, Brazil), launched the first of a series of symposia in theoretical computer science, to be held triennially in Latin America. Since 1998 it has been held biennially: Valparaiso, Chile (1995); Campinas, Brazil (1998); Punta del Este, Uruguay (2000); Cancún, Mexico (2002); Buenos Aires, Argentina (2004); Valdivia, Chile (2006); Búzios, Brazil (2008); Oaxaca, Mexico (2010); Arequipa, Peru (2012); Montevideo, Uruguay (2014); Ensenada, Mexico (2016); Buenos Aires, Argentina (2018); São Paulo, Brazil (2020); Guanajuato, Mexico (2022).

Scope and topics

LATIN 2024 is devoted to different areas in theoretical computer science including, but not limited, to:

  • algorithmic game theory
  • approximation algorithms
  • analytic combinatorics and analysis of algorithms
  • automata theory and formal languages
  • combinatorial algorithms
  • combinatorial optimization
  • combinatorics and graph theory
  • complexity theory
  • computational geometry
  • computational social choice
  • data structures
  • distributed computing
  • fixed-parameter algorithms, including FPT-approximation algorithms
  • foundations of data science and theoretical machine learning
  • online algorithms
  • quantum computing
  • randomized algorithms


LATIN 2024 will take place in the beautiful city of Puerto Varas, located in the South of Chile, in the Los Rios Region. It is known for the scenic views of Osorno Volcano and Lake Llanquihue, its location near popular tourist destinations like the Vicente Perez Rosales National Park, and its German colonial architecture. Puerto Varas is a popular destination for outdoor activities such as hiking, fishing, and skiing.

The conference will be hosted in the Hotel Cabaña del Lago, located directly at the Lake Llanquihue in Puerto Varas. It is in walking distance (approximately 15min) to the center of Puerto Varas.

Important dates

Paper submission (extended): 9 October 2023 (anywhere on earth)

Author notification: 20 December 2023

Camera-ready: 8 January 2024

LATIN Symposium: 18 to 22 March 2024


Submissions are limited to fifteen (15) single-column letter-size pages in Springer LNCS format (see LNCS author guidelines at 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 should be submitted electronically via the EasyChair submission system at

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.

The submission form on easychair provides an opportunity to specify conflicts of interest with any of the PC members. If you feel that you have a valid reason for a conflict of interest beyond the PC members, or any other issues related to the fair treatment of your submission, please contact one of the PC chairs, Jose Soto and Andreas Wiese, or the SafeToC representative for LATIN 2024, Andrea Richa.

Registrations are open

There are full and reduced (i.e., discounted) registrations. The reduced registration is reserved only for master students and PhD students. Please note that each accepted paper requires one full registration (even if the presenter is a student).

Students may also apply for a small stipend to help covering local expenses, using this Google Form. 


Early registration (before January 15, 2024) Late registration (after January 15, 2024)
Full 400,000 CLP 500,000 CLP
Reduced (student) 250,000 CLP 300,000 CLP

Invited speakers

Pablo Barceló

Pablo Barceló

Director of the Institute for Mathematical and Computational Engineering of the School of Engineering and Faculty of Mathematics, Universidad Católica de Chile. His research interests are Logic and Databases.

Pierre Fraigniaud

Pierre Fraigniaud

CNRS researcher (Directeur de Recherche) affiliated to both Université Paris Cité and CNRS. His main research interest is parallel and distributed computing, specifically the design and analysis of distributed algorithms and data structures for networks.

Penny Haxell

Penny Haxell

Professor for Combinatorics and Optimization at the University of Waterloo. Her research interests are extremal combinatorics and graph theory.

Eunjung Kim

Eunjung Kim

Charge de Recherche CNRS (Researcher) at LAMSADE lab at the Université Paris Dauphine. Her research interests are in fixed-parameter algorithms, constraint satisfaction problems, graph theory, linear matroids, and algorithmic applications.

Jon Kleinberg

Jon Kleinberg

Jon Kleinberg is the Tisch University Professor in the Computer Science Department at Cornell University. His research focuses on issues at the interface of networks and information, with an emphasis on the social and information networks that underpin the Web and other on-line media.

Conference program

The program of LATIN 2024 is available now.

Local information

Getting to Puerto Varas

Puerto Varas can be reached by plane to the Puerto Montt airport. From there, you can take a shared shuttle (around 10,000 CLP) or a taxi (around 20,000 CLP) to Puerto Varas. The trip takes around 30min.

The airlines flying to Puerto Montt are LATAM and the low-cost airlines Sky and JetSmart. When you fly to Puerto Montt from abroad, it could be an option to first fly to Santiago and then on a separate ticket from Santiago to Puerto Montt. If you do that, make sure to allow for some time at Santiago airport to do customs and pick up your luggage.


The conference hotel is the Hotel Cabaña del Lago. Since Puerto Varas is a popular tourist destination, there are many other hotels in the city (in different price ranges). The center of Puerto Varas and many hotels are within walking distance of the conference venue. We recommend you to book a hotel in this area.

Time zone

In March, Puerto Varas (and most of Chile in fact) observes Chile Summer Time (CLST), i.e., UTC-03:00.


Credit cards are widely accepted in Puerto Varas. The local currency is the Chilean peso.


The most common sockets in Chile are type C and L. Note that the (European) type F plugs do not fit in such sockets. The standard voltage is 220 V, and the standard frequency is 50 Hz.


It is standard to tip 10% in restaurants, cafes, and bars. Taxi drivers are not tipped in this way, but it is common to let them keep the change.

Tap water

The tap water is safe to drink.


The official language is Spanish. Outside of touristic areas, it can be difficult to communicate in English.

Program committee

  • Shaull Almagor (Technion)
  • Gabriela Araujo (Universidad Nacional Autónoma de México)
  • Flavia Bonomo (Universidad de Buenos Aires)
  • Fabio Botler (Universidade Federal do Rio de Janeiro)
  • Mario Bravo (Universidad Adolfo Ibáñez)
  • Igor Carboni Oliveira (University of Warwick)
  • Timothy Chan (University of Illinois Urbana-Champaign)
  • Mark de Berg (TU Eindhoven)
  • Franziska Eberle (London School of Economics and Political Science)
  • Celina Figueiredo (Universidade Federal do Rio de Janeiro)
  • Johannes Fischer (Technische Universität Dortmund)
  • Emily Fox (The University of Texas at Dallas)
  • Paweł Gawrychowski (University of Wrocław)
  • Cristóbal Guzmán (Pontificia Universidad Católica de Chile)
  • Christoph Haase (University of Oxford)
  • Adriana Hansberg (Universidad Nacional Autónoma de México)
  • Tobias Harks (Universität Passau)
  • Christoph Hertrich (London School of Economics and Political Science)
  • Martin Hoefer (Goethe University Frankfurt)
  • Bart Jansen (TU Eindhoven)
  • Artur Jeż (University of Wrocław)
  • Andrea Jiménez (Universidad de Valparaíso)
  • Michael Kerber (Graz University of Technology)
  • Thomas Kesselheim (University of Bonn)
  • Arindam Khan (Indian Institute of Science, Bengaluru)
  • Stefan Kratsch (Humboldt-Universität zu Berlin)
  • Jan Kretinsky (Technical University of Munich / Masaryk University Brno)
  • Ian Mertz (University of Warwick)
  • Pedro Montealegre (Universidad Adolfo Ibáñez)
  • Ryuhei Mori (Nagoya University)
  • Gonzalo Navarro (Universidad de Chile)
  • Alantha Newman (Université Grenoble Alpes)
  • Harumichi Nishimura (Nagoya University)
  • André Nusser (University of Copenhagen)
  • Joël Ouaknine (Max Planck Institute for Software Systems)
  • Dana Pizarro (Universidad de O’Higgins)
  • Sergio Rajsbaum (Universidad Nacional Autónoma de México)
  • Andrea Richa (Arizona State University)
  • Saket Saurabh (Institute of Mathematical Sciences, Chennai and University of Bergen)
  • Kevin Schewior (University of Southern Denmark)
  • Ildikó Schlotter (Centre for Economic and Regional Studies, Budapest)
  • Sebastian Siebertz (University of Bremen)
  • Jose Soto (Universidad de Chile, co-chair)
  • Maya Stein (Universidad de Chile)
  • Kavitha Telikepalli (Tata Institute of Fundamental Research, Mumbai)
  • Roei Tell (Institute for Advanced Study, Princeton NJ, and Center for Discrete Mathematics and Theoretical Computer Science, Rutgers University)
  • Erik Jan van Leeuwen (Utrecht University)
  • Rob van Stee (University of Siegen)
  • Jose Verschae (Pontificia Universidad Católica de Chile)
  • Seeun William Umboh (The University of Melbourne)
  • Andreas Wiese (Technical University of Munich, co-chair)


The following awards will be given at LATIN 2024.

  • 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 2012 are eligible for the 2024 award.
    This years’ award winners are Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski and Andrzej Pelc for their paper Collective Tree Exploration which  was presented at LATIN 2004. Congratulations!
  • The Alejandro López-Ortiz best paper award for the best paper published at LATIN 2024 is awarded to Amir Abboud, Yarin Shechter, and Nick Fischer for their paper Faster Combinatorial k-Clique Algorithms. Congratulations!


We are grateful to our sponsors for supporting LATIN 2024:

Organization committee

  • Jose Soto, Universidad de Chile, Chile
  • Waldo Galvez, Universidad de O’Higgins, Chile
  • Victor Verdugo, Universidad de O’Higgins, Chile
  • Andreas Wiese, Technical University of Munich, Germany

Steering committee of LATIN

  • Jacques Sakarovitch, CNRS and Télécom Paris, France
  • Armando Castañeda, Universidad Nacional Autónoma de México (UNAM), Mexico
  • Conrado Martínez, Universitat Politècnica de Catalunya, Spain
  • Flávio Keidi Miyazawa, Universidade Estadual de Campinas, Brazil
  • Cristina G. Fernandes, Universidade de São Paulo, Brazil
  • Michael A. Bender, Stony Brook University, USA



List of accepted papers

  • Volker Turau. Counting Fixed Points and Pure 2-Cycles of Tree Cellular Automata
  • Matthias Hoffjan, Anna Maria Kerkmann and Jörg Rothe. Core Stability in Altruistic Coalition Formation Games
  • Alexander Kozachinskiy. Infinite separation between general and chromatic memory
  • Omrit Filtser, Erik Krohn, Bengt J. Nilsson, Christian Rieck and Christiane Schmidt. Guarding Polyominoes under k-Hop Visibility
  • Palash Dey, Sudeshna Kolay and Sipra Singh. Knapsack: Connectedness, Path, and Shortest-Path
  • Duncan Adamson, Nathan Flaherty, Igor Potapov and Paul Spirakis. Structural and combinatorial properties of 2-swap word permutation graphs
  • Uéverton Souza, Luis Cunha, Loana Nogueira, Fabio Protti and Gabriel Duarte. Induced Tree Covering and the Generalized Yutsis Property
  • Matheus Adauto, Viktoriya Bardenova, Mariana Cruz, Celina FigueiredoGlenn Hulbert and Diana Sasaki. Pebbling in Kneser graphs
  • Yixin Cao, Haowei Chen and Shenghua WangSelf-complementary (Pseudo-)Split Graphs
  • Younan Gao and Meng HeOn Approximate Colored Path Counting
  • Sushmita Gupta, Sounak Modak, Saket Saurabh and Sanjay Seetharaman. Quick-Sort Style Approximation Algorithms For Generalizations of Feedback Vertex Set in Tournaments
  • William Evans and Seyed Ali TabatabaeeMinimizing the Size of the Uncertainty Regions for Centers of Moving Entities
  • Thomas Brihaye, Sophie Pinchinat and Alexandre Terefenko. Semantics of Attack-Defense Trees for Dynamic Countermeasures and a New Hierarchy of Star-free Languages
  • Sarita de Berg, Nathan van Beusekom, Max van Mulken, Kevin Verbeek and Jules Wulms. Competitive Searching over Terrains
  • Duncan AdamsonPawel Gawrychowski and Florin ManeaEnumerating m-Length Paths in Directed Graphs with Constant Delay
  • Shubhada Aute and Fahad PanolanParameterized Algorithms for Minimum Sum Vertex Cover
  • Samuel Silva and Uéverton SouzaDecoding tree decompositions from permutations
  • Zsuzsanna Liptak and Luca Parmigiani. A BWT-based algorithm for random de Bruijn sequence construction
  • Gonzalo Navarro and Cristian UrbinaIterated Straight-Line Programs
  • Taehoon Ahn, Chaeyoon Chung, Hee-Kap Ahn, Sang Won Bae, Otfried Cheong and Sang Duk Yoon. Minimum-Width Double-Slabs and Widest Empty Slabs in High Dimensions
  • Diego Maldonado, Pedro Montealegre and Martín Ríos-Wilson. The Hardness of Local Certification of Finite-State Dynamics
  • Cristina G. FernandesGuilherme Oliveira Mota and Nicolás Sanhueza-MatamalaSeparating path systems in complete graphs
  • Marcelo Garlet Milani. Directed Ear Anonymity
  • Soumen Mandal, Pranabendu MisraAshutosh Rai and Saket SaurabhParameterized Approximation Algorithms for Weighted Vertex Cover
  • Pallavi JainFahad PanolanLawqueen Kanesh, Souvik Saha, Abhishek Sahu, Saket Saurabh and Anannya Upasana. Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses
  • Minh Hieu Nguyen, Mourad Baiou, Viet Hung Nguyen and Thi Quynh Trang Vo. Proportional Fairness for Combinatorial Optimization
  • Dhanyamol Antony, L. Sunil Chandran, Ankit Gayen, Shirish Gosavi and Dalu Jacob. Total Domination, Separated-Cluster, CD-Coloring: Algorithms and Hardness
  • Akanksha Agrawal, Satyabrata Jana and Abhishek Sahu. A Polynomial Kernel for Proper Helly Circular-arc Vertex Deletion
  • Ankush Acharyya, Vahideh Keikha, Maria Saumell and Rodrigo I. SilveiraComputing largest minimum color-spanning intervals of imprecise points
  • Pallavi Jain and Manveer Singh Rathore. Sparsity in Covering Solutions
  • Matej Lieskovský. Better Algorithms for Online Bin Stretching via Computer Search
  • Amir Abboud, Nick Fischer, and Yarin Shechter. Faster Combinatorial k-Clique Algorithms
  • Isabel Donoso, Eric Goles, Martín Ríos-Wilson and Sylvain SenéAsymptotic (a)synchronism sensitivity and complexity of elementary cellular automata
  • Pavoll Hell, Arash Rafiey and Akbar Rafiey. Bi-arc Digraphs: Recognition Algorithm and Applications
  • Kristóf Bérczi, Lydia Mirabel Mendoza Cadena and Kitti Varga. Newton-type algorithms for inverse optimization: weighted span objective
  • Palash Dey and Arnab Maiti. On Binary Networked Public Goods Game with Altruism
  • Emilio Di Giacomo, Henry Förster, Daria Kokhovich, Tamara MchedlidzeFabrizio MontecchianiAntonios Symvonis and Anaïs Villedieu. On 1-bend Upward Point-set Embeddings of $st$-digraphs
  • Christian Ortlieb. Schnyder woods and long induced paths in 3-connected planar graphs
  • Lorraine Ayad, Grigorios Loukides, Solon Pissis and Hilde Verbeek. Sparse Suffix and LCP Array: Simple, Direct, Small, and Fast
  • Adrián Goga, Travis Gagie, Gonzalo Navarro and Artur Jeż. Space-efficient conversions from SLPs
  • Yuan Friedrich Qiu and Aaron WilliamsGenerating Signed Permutations by Twisting Two-Sided Ribbons
  • Henry Förster, Philipp KindermannTill MiltzowIrene Parada, Soeren Terziadis and Birgit Vogtenhuber. Geometric Thickness of Multigraphs is ER-Complete
  • Adrián Goga, Andrej Baláž, Travis GagieGonzalo NavarroAlessia Petescia, Simon Heumos and Jouni SirénWheeler maps