Accepted papers

Track A

Jakob Greilhuber, Philipp Schepper and Philip Wellnitz. Residue Domination in Bounded-Treewidth Graphs
Patrick Schnider, Linus Stalder and Simon Weber. Unfairly Splitting Separable Necklaces
Alexey Milovanov and Bruno Loff. The hardness of decision tree complexity
Felix Hommelsheim, Zhenwei Liu, Nicole Megow and Guochuan Zhang. Protecting the Connectivity of a Graph under Non-uniform Edge Failures
Leah Epstein and Asaf Levin. Efficient approximation schemes for scheduling on a stochastic number of machines
Haitao Wang and Yiming Zhao. Dynamic Unit-Disk Range Reporting
Kazumasa Shinagawa and Koji Nuida. Card-Based Protocols Imply PSM Protocols
Nastaran Behrooznia and Torsten Mütze. Listing spanning trees of outerplanar graphs by pivot exchanges
Pavel Hrubes and Pushkar Joglekar. On read-k projections of the determinant
Nathan Claudet and Simon Perdrix. Local equivalence of stabilizer states: a graphical characterisation
Nick Fischer, Evangelos Kipouridis, Jonas Klausen and Mikkel Thorup. A Faster Algorithm for Constrained Correlation Clustering
Stacey Jeffery and Galina Pass. Multidimensional Quantum Walks, Recursion, and Quantum Divide & Conquer
Stéphane Devismes, David Ilcinkas, Colette Johnen and Fréderic Mazoit. Being Efficient in Time, Space, and Workload: a Self-stabilizing Unison and its Consequences
Anastasiia Tkachenko and Haitao Wang. Dominating Set, Independent Set, Discrete $k$-Center, Dispersion, and Related Problems for Planar Points in Convex Position
Quentin Hillebrand, Vorapong Suppakitpaisarn and Tetsuo Shibuya. Cycle Counting under Local Differential Privacy for Degeneracy-bounded Graphs
Yasushi Kawase and Tomohiro Nakayoshi. Online Matching with Delays and Size-based Costs
Noam Touitou. Nearly-Optimal Algorithm for Non-Clairvoyant Service with Delay
Tim A. Hartmann and Dániel Marx. Independence and Domination on Bounded-Treewidth Graphs: Integer, Rational, and Irrational Distances
Julia Katheder, Michael Kaufmann, Sergey Pupyrev and Torsten Ueckerdt. Transforming Stacks into Queues: Mixed and Separated Layouts of Graphs
Matthias Kaul, Kelin Luo, Matthias Mnich and Heiko Röglin. Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously
Boaz Patt-Shamir, Adi Rosén and Seeun William Umboh. Colorful Vertex Recoloring of Bipartite Graphs
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma and Prafullkumar Tale. Metric Dimension and Geodetic Set Parameterized by Vertex Cover
Piotr Kawałek and Armin Weiß. Violating Constant Degree Hypothesis Requires Breaking Symmetry
Aritra Banik, Fedor Fomin, Petr Golovach, Tanmay Inamdar, Satyabrata Jana and Saket Saurabh. Multivariate Exploration of Metric Dilation
Klaus Heeger and Hendrik Molter. Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines
Yuwei Liu, Yijia Chen, Shuangle Li, Bingkai Lin and Xin Zheng. On Average Baby PIH and Its Applications
Aleksander Bjoern Grodt Christiansen, Ivor van der Hoog and Eva Rotenberg. Local Density and its Distributed Approximation
Deborah Haun, Laura Merker and Sergey Pupyrev. Forbidden Patterns in Mixed Linear Layouts
Mohit Jayanti Gurumukhani, Ramamohan Paturi, Michael Saks and Navid Talebanfard. Local Enumeration: The Not-All-Equal Case
Marcin Bienkowski, Jaroslaw Byrka and Łukasz Jeż. Online Disjoint Set Covers: Randomization is not Necessary
Oleg Verbitsky and Maksim Zhukovskii. Canonical labeling of sparse random graphs
Samuel Baguley, Yannic Maus, Janosch Ruff and George Skretas. Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for Colouring
Srinivasan Arunachalam and Louis Schatzki. Generalized Inner Product Estimation with Limited Quantum Communication
Christine Awofeso, Patrick Greaves, Oded Lachish and Felix Reidl. Results on H-freeness testing in graphs of bounded r-admissibility
Shyan Akmal and Tomohiro Koana. Faster Edge Coloring by Partition Sieving
Petr Kolman. A Note on Approximation of Spanning Tree Congestion
Daniel Gibney, Sharma V. Thankachan, Arnab Ganguly and Rahul Shah. Two-Dimensional Longest Common Extension Queries in Compact Space
Jungho Ahn, Hugo Jacob, Noleen Köhler, Christophe Paul, Amadeus Reinald and Sebastian Wiederrecht. Twin-width one
Andrei Bulatov and Amirhossein Kazeminia. Modular Counting CSP: Reductions and Algorithms
Manuel Lafond, Alitzel López Sánchez and Weidong Luo. Cluster Editing on Cographs and Related Classes
Akanksha Agrawal, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh and Shaily Verma. Parameterized Saga of First-Fit and Last-Fit Coloring
Sharareh Alipour, Ermiya Farokhnejad and Tobias Momke. Improved Approximation Algorithms for (1,2)-TSP and Max-TSP Using Path Covers in the Semi-Streaming Model
Dariusz Dereniowski, Aleksander Łukasiewicz and Przemysław Uznański. Noisy (binary) searching: simple, fast and correct
Martin Hoefer, Conrad Schecker and Kevin Schewior. Designing Exploration Contracts
Tomohiro Koana and Magnus Wahlström. Faster algorithms on linear delta-matroids
Matthias Bentert, Fedor Fomin and Petr Golovach. Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths
Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity, Saket Saurabh and Roohani Sharma. MaxMin Separation Problems: FPT Algorithms for st-Separator and Odd Cycle Transversal
Pierre Fraigniaud, Minh Hang Nguyen and Ami Paz. Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structure
Eduard Eiben, Séhane Bel Houari-Durand and Magnus Wahlström. Polynomial kernel and incompressibility for Prison-Free Edge Deletion and Completion
Nikolai Chukhin, Alexander Kulikov and Ivan Mihajlin. Toward Better Depth Lower Bounds: Strong Composition of XOR and a Random Function
Sariel Har-Peled and Saladi Rahul. Approximating Densest Subgraph in Geometric Intersection Graphs
Ameet Gadekar and Tanmay Inamdar. Dimension-Free Parameterized Approximation Schemes for Hybrid Clustering
Keerti Choudhary and Rishabh Dhimann. A Deterministic Approach to Shortest Path Restoration in Edge Faulty Graphs
Radu Curticapean, Simon Döring, Daniel Neuen and Jiaheng Wang. Can You Link Up With Treewidth?
Ursula Hebert-Johnson and Daniel Lokshtanov. Sampling Unlabeled Chordal Graphs in Expected Polynomial Time

Track B

Benjamin Hellouin de Menibus and Pacôme Perrotin. Alternating hierarchy of subshifts defined by nondeterministic plane-walking automata
Max Bannach and Markus Hecher. Structure-Guided Automated Reasoning
Aliaume Lopez. Commutative N-rational series of polynomial growth
Yaroslav Alekseev, Dima Grigoriev and Edward A. Hirsch. Tropical Proof Systems: Between R(CP) and Resolution
Jorge Gallego and Alessio Mansutti. On the Existential Theory of the Reals Enriched with Integer Powers of a Computable Number
Antonin Callard, Léo Paviet Salomon and Pascal Vanier. Computability of extender sets in multidimensional subshifts
Ebrahim Ghorbani, Jonah Leander Hoff and Matthias Mnich. Generalized Arrival on Tree-Like Multigraphs
Jean Christoph Jung and Jędrzej Kołodziejski. Modal Separation of Fixpoint Formulae
Damian Niwiński, Paweł Parys and Michał Skrzypczak. A Dichotomy Theorem for Ordinal Ranks in MSO
Benjamin Bordais, Daniel Neider and Rajarshi Roy. The Complexity of Learning LTL, CTL and ATL formulas
Stefan Kiefer and Andrew Ryzhikov. Efficiently computing the minimum rank of a matrix in a monoid of zero-one matrices
Rutger Campbell, Bruno Guillon, Mamadou Moustapha Kanté, Eun Jung Kim and Noleen Köhler. CMSO-transducing tree-like graph decompositions
Lê Thành Dũng Nguyễn and Gabriele Vanoni. Slightly non-linear higher-order tree transducers
Roberto Borelli, Luca Geatti, Marco Montali and Angelo Montanari. On Cascades of Reset Automata
Quentin Aristote. Monotone weak distributive laws over the lifted powerset monad in categories of algebras
Sergey Goncharov, Dirk Hofmann, Pedro Nora, Lutz Schröder and Paul Wild. Identity-Preserving Lax Extensions and Where to Find Them
Rémy Cerda and Lionel Vaux Auclair. How to play the Accordion: Uniformity and the (non-)conservativity of the linear approximation of the λ-calculus