Amir Abboud, Nick Fischer and Yarin Shechter, Faster Combinatorial k-Clique Algorithms. [Bibtex] Ankush Acharyya, Vahideh Keikha, Maria Saumell and Rodrigo I. Silveira, Computing Largest Minimum Color-Spanning Intervals of Imprecise Points. [Bibtex] Duncan Adamson, Pawel Gawrychowski and Florin Manea, Enumerating m-Length Walks in Directed Graphs with Constant Delay. [Bibtex] 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. [Bibtex] Dhanyamol Antony, L. Sunil Chandran, Ankit Gayen, Shirish Gosavi and Dalu Jacob, Total Domination, Separated-Cluster, CD-Coloring: Algorithms and Hardness. [Bibtex] Lorraine A. K. Ayad, Grigorios Loukides, Solon P. Pissis and Hilde Verbeek, Sparse Suffix and {LCP} Array: Simple, Direct, Small, and Fast. [Bibtex] Andrej Baláz, Travis Gagie, Adrián Goga, Simon Heumos, Gonzalo Navarro, Alessia Petescia and Jouni Sirén, Wheeler Maps. [Bibtex] Sarita de Berg, Nathan van Beusekom, Max van Mulken, Kevin Verbeek and Jules Wulms, Competitive Searching over Terrains. [Bibtex] William Evans and Seyed Ali Tabatabaee, Minimizing the Size of the Uncertainty Regions for Centers of Moving Entities. [Bibtex] Omrit Filtser, Erik Krohn, Bengt J. Nilsson, Christian Rieck and Christiane Schmidt, Guarding Polyominoes Under k-Hop Visibility. [Bibtex] Henry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis and Birgit Vogtenhuber, Geometric Thickness of Multigraphs is \(\exists\) \(\mathbb{R}\)-Complete. [Bibtex] Travis Gagie, Adrián Goga, Artur Jez and Gonzalo Navarro, Space-Efficient Conversions from SLPs. [Bibtex] Younan Gao and Meng He, On Approximate Colored Path Counting. [Bibtex] 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. [Bibtex] Christoph Grüne, The Complexity Classes of Hamming Distance Recoverable Robust Problems. [Bibtex] Sushmita Gupta, Sounak Modak, Saket Saurabh and Sanjay Seetharaman, Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments. [Bibtex] Matej Lieskovský, Better Algorithms for Online Bin Stretching via Computer Search. [Bibtex] Zsuzsanna Lipták and Luca Parmigiani, A BWT-Based Algorithm for Random de Bruijn Sequence Construction. [Bibtex] Diego Maldonado, Pedro Montealegre and Martín Ríos-Wilson, The Hardness of Local Certification of Finite-State Dynamics. [Bibtex] Gonzalo Navarro and Cristian Urbina, Iterated Straight-Line Programs. [Bibtex] Yuan Qiu and Aaron Williams, Generating Signed Permutations by Twisting Two-Sided Ribbons. [Bibtex] Samuel Eduardo da Silva and Uéverton S. Souza, Decoding Tree Decompositions from Permutations. [Bibtex] . [Bibtex] Duncan Adamson, Nathan Flaherty, Igor Potapov and Paul G. Spirakis, Structural and Combinatorial Properties of 2-Swap Word Permutation Graphs. [Bibtex] Matheus Adauto, Viktoriya Bardenova, Mariana da Cruz, Celina M. H. de Figueiredo, Glenn Hurlbert and Diana Sasaki, Pebbling in Kneser Graphs. [Bibtex] Akanksha Agrawal, Satyabrata Jana and Abhishek Sahu, A Polynomial Kernel for Proper Helly Circular-Arc Vertex Deletion. [Bibtex] Shubhada Aute and Fahad Panolan, Parameterized Algorithms for Minimum Sum Vertex Cover. [Bibtex] Kristóf Bérczi, Lydia Mirabel Mendoza-Cadena and Kitti Varga, Newton-Type Algorithms for Inverse Optimization: Weighted Span Objective. [Bibtex] Thomas Brihaye, Sophie Pinchinat and Alexandre Terefenko, Semantics of Attack-Defense Trees for Dynamic Countermeasures and a New Hierarchy of Star-Free Languages. [Bibtex] Yixin Cao, Haowei Chen and Shenghua Wang, Self-complementary (Pseudo-)Split Graphs. [Bibtex] Luís Cunha, Gabriel L. Duarte, Fábio Protti, Loana Tito Nogueira and Uéverton S. Souza, Induced Tree Covering and the Generalized Yutsis Property. [Bibtex] Palash Dey, Sudeshna Kolay and Sipra Singh, Knapsack: Connectedness, Path, and Shortest-Path. [Bibtex] Cristina G. Fernandes, Guilherme Oliveira Mota and Nicolás Sanhueza-Matamala, Separating Path Systems in Complete Graphs. [Bibtex] Pavol Hell, Akbar Rafiey and Arash Rafiey, Bi-arc Digraphs: Recognition Algorithm and Applications. [Bibtex] Matthias Hoffjan, Anna Maria Kerkmann and Jörg Rothe, Core Stability in Altruistic Coalition Formation Games. [Bibtex] Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh and Anannya Upasana, Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses. [Bibtex] Pallavi Jain and Manveer Singh Rathore, Sparsity in Covering Solutions. [Bibtex] Alexander Kozachinskiy, Infinite Separation Between General and Chromatic Memory. [Bibtex] Isabel Donoso Leiva, Eric Goles, Martín Ríos-Wilson and Sylvain Sené, Asymptotic (a)Synchronism Sensitivity and Complexity of Elementary Cellular Automata. [Bibtex] Arnab Maiti and Palash Dey, On Binary Networked Public Goods Game with Altruism. [Bibtex] Soumen Mandal, Pranabendu Misra, Ashutosh Rai and Saket Saurabh, Parameterized Approximation Algorithms for Weighted Vertex Cover. [Bibtex] Marcelo Garlet Milani, Directed Ear Anonymity. [Bibtex] Minh Hieu Nguyen, Mourad Baïou, Viet Hung Nguyen and Thi Quynh Trang Vo, Proportional Fairness for Combinatorial Optimization. [Bibtex] Volker Turau, Counting Fixed Points and Pure 2-Cycles of Tree Cellular Automata. [Bibtex] Christian Ortlieb, Schnyder Woods and Long Induced Paths in 3-Connected Planar Graphs. [Bibtex] . [Bibtex]

[Home] [All LATIN Papers] [LATIN 2024]