LATIN 2024 program
Monday
| 8:50 | Opening remarks |
| 9:00 | Invited talk: Pierre Fraigniaud |
| 10:00 | Coffee break |
| 10:30 | Session 1: Algorithms and Data Structures |
| Emilio Di Giacomo, Henry Förster, Daria Kokhovich, Tamara Mchedlidze, Fabrizio Montecchiani, Antonios Symvonis and Anaïs Villedieu. On 1-bend Upward Point-set Embeddings of $st$-digraphs | |
| Samuel Silva and Uéverton Souza. Decoding tree decompositions from permutations | |
| Duncan Adamson, Pawel Gawrychowski and Florin Manea. Enumerating m-Length Paths in Directed Graphs with Constant Delay | |
| Diego Maldonado, Pedro Montealegre and Martín Ríos-Wilson. The Hardness of Local Certification of Finite-State Dynamics | |
| 12:00 | Lunch break |
| 14:00 | Session 2: Approximation and Online Algorithms |
| Younan Gao and Meng He. On 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 | |
| Matej Lieskovský. Better Algorithms for Online Bin Stretching via Computer Search | |
| Sarita de Berg, Nathan van Beusekom, Max van Mulken, Kevin Verbeek and Jules Wulms. Competitive Searching over Terrains | |
| 15:30 | Coffee break |
| 16:00 | Session 3: Computational Geometry |
| William Evans and Seyed Ali Tabatabaee. Minimizing the Size of the Uncertainty Regions for Centers of Moving Entities | |
| Omrit Filtser, Erik Krohn, Bengt J. Nilsson, Christian Rieck and Christiane Schmidt. Guarding Polyominoes under k-Hop Visibility | |
| 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 | |
| Henry Förster, Philipp Kindermann, Till Miltzow, Irene Parada, Soeren Terziadis and Birgit Vogtenhuber. Geometric Thickness of Multigraphs is ER-Complete | |
| 17:30 | Reception |
Tuesday
| 9:00 | Invited talk: Penny Haxell |
| 10:00 | Coffee break |
| 10:30 | Session 4: Combinatorics and Graph Theory |
| Yixin Cao, Haowei Chen and Shenghua Wang. Self-complementary (Pseudo-)Split Graphs | |
| Christian Ortlieb. Schnyder woods and long induced paths in 3-connected planar graphs | |
| Pavol Hell, Arash Rafiey and Akbar Rafiey. Bi-arc Digraphs: Recognition Algorithm and Applications | |
| Matheus Adauto, Viktoriya Bardenova, Mariana Cruz, Celina Figueiredo, Glenn Hulbert and Diana Sasaki. Pebbling in Kneser graphs | |
| 12:00 | Lunch break |
| 14:00 | Session 5: Algorithms and Data Structures |
| Gonzalo Navarro and Cristian Urbina. Iterated Straight-Line Programs | |
| Ankush Acharyya, Vahideh Keikha, Maria Saumell and Rodrigo I. Silveira. Computing largest minimum color-spanning intervals of imprecise points | |
| Dhanyamol Antony, L. Sunil Chandran, Ankit Gayen, Shirish Gosavi and Dalu Jacob. Total Domination, Separated-Cluster, CD-Coloring: Algorithms and Hardness | |
| Yuan Friedrich Qiu and Aaron Williams. Generating Signed Permutations by Twisting Two-Sided Ribbons | |
| 15:30 | Coffee break |
| 16:00 | Session 6: Parametrized algorithms and complexity theory |
| Pallavi Jain and Manveer Singh Rathore. Sparsity in Covering Solutions | |
| Uéverton Souza, Luis Cunha, Loana Nogueira, Fabio Protti and Gabriel Duarte. Induced Tree Covering and the Generalized Yutsis Property | |
| Christoph Grüne. The Complexity Classes of Hamming Distance Recoverable Robust Problems | |
| 17:30 | Break |
| 18:00 | Session 7: Alejandro López-Ortiz Best paper award and Imre Simon Test-of-Time award |
| 19:00 | Business meeting |
Wednesday
| 9:00 | Invited talk: Pablo Barceló |
| 10:00 | Coffee break |
| 10:30 | Session 8: Algorithms and Data Structures |
| Zsuzsanna Liptak and Luca Parmigiani. A BWT-based algorithm for random de Bruijn sequence construction | |
| Adrián Goga, Travis Gagie, Gonzalo Navarro and Artur Jeż. Space-efficient conversions from SLPs | |
| Lorraine Ayad, Grigorios Loukides, Solon Pissis and Hilde Verbeek. Sparse Suffix and LCP Array: Simple, Direct, Small, and Fast | |
| Adrián Goga, Andrej Baláž, Travis Gagie, Gonzalo Navarro, Alessia Petescia, Simon Heumos and Jouni Sirén. Wheeler maps | |
| 12:00 | Lunch break |
| 14:00 | Excursion |
| Visit to the Vicente Pérez Rosales National Park | |
| 19:00 | Conference dinner |
Thursday
| 9:00 | Invited talk: Eunjung Kim |
| 10:00 | Coffee break |
| 10:30 | Session 9: Parametrized algorithms |
| Soumen Mandal, Pranabendu Misra, Ashutosh Rai and Saket Saurabh. Parameterized Approximation Algorithms for Weighted Vertex Cover | |
| Shubhada Aute and Fahad Panolan. Parameterized Algorithms for Minimum Sum Vertex Cover | |
| Akanksha Agrawal, Satyabrata Jana and Abhishek Sahu. A Polynomial Kernel for Proper Helly Circular-arc Vertex Deletion | |
| Pallavi Jain, Fahad Panolan, Lawqueen Kanesh, Souvik Saha, Abhishek Sahu, Saket Saurabh and Anannya Upasana. Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses | |
| 12:00 | Lunch break |
| 14:00 | Session 10: Combinatorics and Graph Theory |
| Duncan Adamson, Nathan Flaherty, Igor Potapov and Paul Spirakis. Structural and combinatorial properties of 2-swap word permutation graphs | |
| Marcelo Garlet Milani. Directed Ear Anonymity | |
| Cristina G. Fernandes, Guilherme Oliveira Mota and Nicolás Sanhueza-Matamala. Separating path systems in complete graphs | |
| Alexander Kozachinskiy. Infinite separation between general and chromatic memory | |
| 15:30 | Coffee break |
| 16:00 | Session 11: Automata Theory and Formal Languages |
| Volker Turau. Counting Fixed Points and Pure 2-Cycles of Tree Cellular Automata | |
| Thomas Brihaye, Sophie Pinchinat and Alexandre Terefenko. Semantics of Attack-Defense Trees for Dynamic Countermeasures and a New Hierarchy of Star-free Languages | |
| Isabel Donoso, Eric Goles, Martín Ríos-Wilson and Sylvain Sené. Asymptotic (a)synchronism sensitivity and complexity of elementary cellular automata |
Friday
| 9:00 | Invited talk: Jon Kleinberg |
| 10:00 | Coffee break |
| 10:30 | Session 12: Game theory and fairness |
| Kristóf Bérczi, Lydia Mirabel Mendoza Cadena and Kitti Varga. Newton-type algorithms for inverse optimization: weighted span objective | |
| Minh Hieu Nguyen, Mourad Baiou, Viet Hung Nguyen and Thi Quynh Trang Vo. Proportional Fairness for Combinatorial Optimization | |
| Matthias Hoffjan, Anna Maria Kerkmann and Jörg Rothe. Core Stability in Altruistic Coalition Formation Games | |
| Palash Dey and Arnab Maiti. On Binary Networked Public Goods Game with Altruism | |
| 12:00 | Closing |
© LATIN 2024