| 2024 | 49th International Symposium on Mathematical Foundations of Computer Science, MFCS 2024, Bratislava, Slovakia, August 26-30, 2024 Rastislav Královic, Antonín Kucera |
| 2024 | A Direct Translation from LTL with Past to Deterministic Rabin Automata. Shaun Azzopardi, David Lidell, Nir Piterman |
| 2024 | A New Characterization of FAC⁰ via Discrete Ordinary Differential Equations. Melissa Antonelli, Arnaud Durand, Juha Kontinen |
| 2024 | A Robust Measure on FDFAs Following Duo-Normalized Acceptance. Dana Fisman, Emmanuel Goldberg, Oded Zimerman |
| 2024 | Agafonov's Theorem for Probabilistic Selectors. Ulysse Léchine, Thomas Seiller, Jakob Grue Simonsen |
| 2024 | Algorithmic Dimensions via Learning Functions. Jack H. Lutz, Andrei N. Migunov |
| 2024 | Algorithms and Complexity for Path Covers of Temporal DAGs. Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud, Ralf Klasing |
| 2024 | An Algorithmic Meta Theorem for Homomorphism Indistinguishability. Tim Seppelt |
| 2024 | An Oracle with no UP-Complete Sets, but NP = PSPACE. David Dingel, Fabian Egidy, Christian Glaßer |
| 2024 | Applications of Littlestone Dimension to Query Learning and to Compression. Hunter Chase, James Freitag, Lev Reyzin |
| 2024 | Approximate Suffix-Prefix Dictionary Queries. Wiktor Zuba, Grigorios Loukides, Solon P. Pissis, Sharma V. Thankachan |
| 2024 | Breaking a Graph into Connected Components with Small Dominating Sets. Matthias Bentert, Michael R. Fellows, Petr A. Golovach, Frances A. Rosamond, Saket Saurabh |
| 2024 | Breaking the Barrier 2^k for Subset Feedback Vertex Set in Chordal Graphs. Tian Bai, Mingyu Xiao |
| 2024 | C_{2k+1}-Coloring of Bounded-Diameter Graphs. Marta Piecyk |
| 2024 | Capturing the Shape of a Point Set with a Line Segment. Nathan van Beusekom, Marc J. van Kreveld, Max van Mulken, Marcel Roeloffzen, Bettina Speckmann, Jules Wulms |
| 2024 | Challenges of the Reachability Problem in Infinite-State Systems (Invited Paper). Wojciech Czerwinski |
| 2024 | Computational Model for Parsing Expression Grammars. Alexander A. Rubtsov, Nikita Chudinov |
| 2024 | Covering and Partitioning of Split, Chain and Cographs with Isometric Paths. Dibyayan Chakraborty, Haiko Müller, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki |
| 2024 | Demonic Variance and a Non-Determinism Score for Markov Decision Processes. Jakob Piribauer |
| 2024 | Distance to Transitivity: New Parameters for Taming Reachability in Temporal Graphs. Arnaud Casteigts, Nils Morawietz, Petra Wolf |
| 2024 | Edit and Alphabet-Ordering Sensitivity of Lex-Parse. Yuto Nakashima, Dominik Köppl, Mitsuru Funakoshi, Shunsuke Inenaga, Hideo Bannai |
| 2024 | Efficient Computation in Congested Anonymous Dynamic Networks. Giuseppe Antonio Di Luna, Giovanni Viglietta |
| 2024 | Equitable Connected Partition and Structural Parameters Revisited: N-Fold Beats Lenstra. Václav Blazej, Dusan Knop, Jan Pokorný, Simon Schierreich |
| 2024 | Faster Approximation Schemes for (Constrained) k-Means with Outliers. Zhen Zhang, Junyu Huang, Qilong Feng |
| 2024 | Fine-Grained Complexity of Program Analysis (Invited Talk). Rupak Majumdar |
| 2024 | First-Fit Coloring of Forests in Random Arrival Model. Bartlomiej Bosek, Grzegorz Gutowski, Michal Lason, Jakub Przybylo |
| 2024 | From TCS to Learning Theory (Invited Paper). Kasper Green Larsen |
| 2024 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2024 | Fully-Adaptive Dynamic Connectivity of Square Intersection Graphs. Ivor van der Hoog, André Nusser, Eva Rotenberg, Frank Staals |
| 2024 | Generalized Completion Problems with Forbidden Tournaments. Zeno Bitter, Antoine Mottet |
| 2024 | Generalizing Roberts' Characterization of Unit Interval Graphs. Virginia Ardévol Martínez, Romeo Rizzi, Abdallah Saffidine, Florian Sikora, Stéphane Vialette |
| 2024 | Graph Search Trees and the Intermezzo Problem. Jesse Beisegel, Ekkehard Köhler, Fabienne Ratajczak, Robert Scheffler, Martin Strehler |
| 2024 | Half-Space Separation in Monophonic Convexity. Mohammed Elaroussi, Lhouari Nourine, Simon Vilmin |
| 2024 | Higher-Order Constrained Dependency Pairs for (Universal) Computability. Liye Guo, Kasper Hagens, Cynthia Kop, Deivid Vale |
| 2024 | Krenn-Gu Conjecture for Sparse Graphs. L. Sunil Chandran, Rishikesh Gajjala, Abraham M. Illickan |
| 2024 | Leakage-Resilient Hardness Equivalence to Logspace Derandomization. Yakov Shalunov |
| 2024 | Local Certification of Geometric Graph Classes. Oscar Defrain, Louis Esperet, Aurélie Lagoutte, Pat Morin, Jean-Florent Raymond |
| 2024 | Logical Characterizations of Weighted Complexity Classes. Guillermo Badia, Manfred Droste, Carles Noguera, Erik Paul |
| 2024 | Minimal Obstructions to C₅-Coloring in Hereditary Graph Classes. Jan Goedgebeur, Jorik Jooken, Karolina Okrasa, Pawel Rzazewski, Oliver Schaudt |
| 2024 | Minimizing Cost Register Automata over a Field. Yahia Idriss Benalioua, Nathan Lhote, Pierre-Alain Reynier |
| 2024 | Monoids of Upper Triangular Matrices over the Boolean Semiring. Andrew Ryzhikov, Petra Wolf |
| 2024 | Monotonicity of the Cops and Robber Game for Bounded Depth Treewidth. Isolde Adler, Eva Fluck |
| 2024 | Multiway Cuts with a Choice of Representatives. Kristóf Bérczi, Tamás Király, Daniel P. Szabo |
| 2024 | Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs. Syamantak Das, Nikhil Kumar, Daniel Vaz |
| 2024 | On Complexity of Confluence and Church-Rosser Proofs. Arnold Beckmann, Georg Moser |
| 2024 | On Fourier Analysis of Sparse Boolean Functions over Certain Abelian Groups. Sourav Chakraborty, Swarnalipa Datta, Pranjal Dutta, Arijit Ghosh, Swagato Sanyal |
| 2024 | On Key Parameters Affecting the Realizability of Degree Sequences (Invited Paper). Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz |
| 2024 | On Line-Separable Weighted Unit-Disk Coverage and Related Problems. Gang Liu, Haitao Wang |
| 2024 | On Low Complexity Colorings of Grids (Invited Talk). Jarkko Kari |
| 2024 | On the Complexity of Community-Aware Network Sparsification. Emanuel Herrendorf, Christian Komusiewicz, Nils Morawietz, Frank Sommer |
| 2024 | On the Complexity of the Conditional Independence Implication Problem with Bounded Cardinalities. Michal Makowski |
| 2024 | On the Descriptive Complexity of Vertex Deletion Problems. Max Bannach, Florian Chudigiewitsch, Till Tantau |
| 2024 | On the Number of Quantifiers Needed to Define Boolean Functions. Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta |
| 2024 | Parameterized Vertex Integrity Revisited. Tesshu Hanaka, Michael Lampis, Manolis Vasilakis, Kanae Yoshiwatari |
| 2024 | Pebble Games and Algebraic Proof Systems. Lisa-Marie Jaser, Jacobo Torán |
| 2024 | Point-To-Set Principle and Constructive Dimension Faithfulness. Satyadev Nandakumar, Subin Pulari, Akhil S |
| 2024 | Polynomial Calculus for Quantified Boolean Logic: Lower Bounds Through Circuits and Degree. Olaf Beyersdorff, Tim Hoffmann, Kaspar Kasche, Luc Nicolas Spachmann |
| 2024 | Preservation Theorems on Sparse Classes Revisited. Anuj Dawar, Ioannis Eleftheriadis |
| 2024 | Punctual Presentability in Certain Classes of Algebraic Structures. Dariusz Kalocinski, Luca San Mauro, Michal Wroclawski |
| 2024 | Quantum Algorithms for Hopcroft's Problem. Vladimirs Andrejevs, Aleksandrs Belovs, Jevgenijs Vihrovs |
| 2024 | Quantum Polynomial Hierarchies: Karp-Lipton, Error Reduction, and Lower Bounds. Avantika Agarwal, Sevag Gharibian, Venkata Koppula, Dorian Rudolph |
| 2024 | Quasi-Isometric Reductions Between Infinite Strings. Karen Frilya Celine, Ziyuan Gao, Sanjay Jain, Ryan Lou, Frank Stephan, Guohua Wu |
| 2024 | Query Maintenance Under Batch Changes with Small-Depth Circuits. Samir Datta, Asif Khan, Anish Mukherjee, Felix Tschirbs, Nils Vortmeier, Thomas Zeume |
| 2024 | Randomness Versus Superspeedability. Rupert Hölzl, Philip Janicki, Wolfgang Merkle, Frank Stephan |
| 2024 | Romeo and Juliet Is EXPTIME-Complete. Harmender Gahlawat, Jan Matyás Kristan, Tomás Valla |
| 2024 | Scheduling with Locality by Routing. Alison Hsiang-Hsuan Liu, Fu-Hong Liu |
| 2024 | Simple Qudit ZX and ZH Calculi, via Integrals. Niel de Beaudrap, Richard D. P. East |
| 2024 | Sparse Graphic Degree Sequences Have Planar Realizations. Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz |
| 2024 | Specification and Automatic Verification of Computational Reductions. Julien Grange, Fabian Vehlken, Nils Vortmeier, Thomas Zeume |
| 2024 | Streaming in Graph Products. Markus Lohrey, Julio Xochitemol |
| 2024 | Structural Parameters for Dense Temporal Graphs. Jessica A. Enright, Samuel D. Hand, Laura Larios-Jones, Kitty Meeks |
| 2024 | Sublinear Time Shortest Path in Expander Graphs. Noga Alon, Allan Grønlund, Søren Fuglede Jørgensen, Kasper Green Larsen |
| 2024 | Switching Classes: Characterization and Computation. Dhanyamol Antony, Yixin Cao, Sagartanu Pal, R. B. Sandeep |
| 2024 | Symmetric-Difference (Degeneracy) and Signed Tree Models. Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev |
| 2024 | Synthesis of Robust Optimal Real-Time Systems. Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier |
| 2024 | The Canadian Traveller Problem on Outerplanar Graphs. Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev, Antoine Dailly, Yan Gerard, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor |
| 2024 | The Complexity of (P₃, H)-Arrowing and Beyond. Zohair Raza Hassan |
| 2024 | The Complexity of Simplifying ω-Automata Through the Alternating Cycle Decomposition. Antonio Casares, Corto Mascle |
| 2024 | The Even-Path Problem in Directed Single-Crossing-Minor-Free Graphs. Archit Chauhan, Samir Datta, Chetan Gupta, Vimal Raj Sharma |
| 2024 | The Freeness Problem for Automaton Semigroups. Daniele D'Angeli, Emanuele Rodaro, Jan Philipp Wächter |
| 2024 | Toward Grünbaum's Conjecture for 4-Connected Graphs. Christian Ortlieb |
| 2024 | Tractability of Packing Vertex-Disjoint A-Paths Under Length Constraints. Susobhan Bandopadhyay, Aritra Banik, Diptapriyo Majumdar, Abhishek Sahu |
| 2024 | Twin-Width of Graphs on Surfaces. Daniel Král, Kristýna Pekárková, Kenny Storgel |
| 2024 | Unveiling the Connection Between the Lyndon Factorization and the Canonical Inverse Lyndon Factorization via a Border Property. Paola Bonizzoni, Clelia De Felice, Brian Riccardi, Rocco Zaccagnino, Rosalba Zizza |
| 2024 | Unweighted Geometric Hitting Set for Line-Constrained Disks and Related Problems. Gang Liu, Haitao Wang |
| 2024 | When Lawvere Meets Peirce: An Equational Presentation of Boolean Hyperdoctrines. Filippo Bonchi, Alessandro Di Giorgio, Davide Trotta |
| 2024 | ℋ-Clique-Width and a Hereditary Analogue of Product Structure. Petr Hlinený, Jan Jedelský |