Table of Contents

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