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