Table of Contents

• Packing Odd Walks and Trails in Multiterminal NetworksMaxim Akhmedov, Maxim A. Babenko. [doi]
• Cut Paths and Their Remainder Structure, with ApplicationsMassimo Cairo, Shahbaz Khan 0004, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli. [doi]
• Restless Temporal Path Parameterized Above Lower BoundsPhilipp Zschoche. [doi]
• Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-CompositionsKlaus Heeger, André Nichterlein, Rolf Niedermeier. [doi]
• Extending Merge Resolution to a Family of QBF-Proof SystemsSravanthi Chede, Anil Shukla. [doi]
• On Rational Recursive SequencesLorenzo Clemente, Maria Donten-Bury, Filip Mazowiecki, Michal Pilipczuk. [doi]
• Improved Weighted Matching in the Sliding Window ModelCezar-Mihail Alexandru, Pavel Dvorák, Christian Konrad 0001, Kheeran K. Naidu. [doi]
• Non-Adaptive Proper Learning PolynomialsNader H. Bshouty. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Exact Matching: Algorithms and Related ProblemsNicolas El Maalouly. [doi]
• Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-WidthPierre Bergé, Édouard Bonnet, Hugues Déprés, Rémi Watrigant. [doi]
• Dynamic Maintenance of Monotone Dynamic Programs and ApplicationsMonika Henzinger, Stefan Neumann 0003, Harald Räcke, Stefan Schmid 0001. [doi]
• Reconfiguration of Digraph HomomorphismsBenjamin Lévêque, Moritz Mühlenthaler, Thomas Suzan. [doi]
• Semigroup Intersection Problems in the Heisenberg GroupsRuiwen Dong 0001. [doi]
• Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future AlgorithmYaniv Sadeh, Haim Kaplan. [doi]
• Distributed Quantum Interactive ProofsFrançois Le Gall, Masayuki Miyamoto, Harumichi Nishimura. [doi]
• Finding and Counting Patterns in Sparse GraphsBalagopal Komarath, Anant Kumar, Suchismita Mishra, Aditi Sethia. [doi]
• The Complexity of Translationally Invariant Problems Beyond Ground State EnergiesJames D. Watson, Johannes Bausch, Sevag Gharibian. [doi]
• A Brief History of History-Determinism (Invited Talk)Karoliina Lehtinen. [doi]
• A Regular and Complete Notion of Delay for Streaming String TransducersEmmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter. [doi]
• Amortised Analysis of Dynamic Data Structures (Invited Talk)Eva Rotenberg. [doi]
• Approximate Sampling and Counting of Graphs with Near-Regular Degree IntervalsGeorgios Amanatidis, Pieter Kleer. [doi]
• One Drop of Non-Determinism in a Random Deterministic AutomatonArnaud Carayol, Philippe Duchon, Florent Koechlin, Cyril Nicaud. [doi]
• New Clocks, Optimal Line Formation and Self-Replication Population ProtocolsLeszek Gasieniec, Paul G. Spirakis, Grzegorz Stachowiak. [doi]
• Tight Bounds for Connectivity Problems Parameterized by CutwidthNarek Bojikian, Vera Chekan, Falko Hegerfeld, Stefan Kratsch. [doi]
• Enumerating Regular Languages with Bounded DelayAntoine Amarilli, Mikaël Monet. [doi]
• Online Paging with Heterogeneous Cache SlotsMarek Chrobak, Samuel Haney, Mehraneh Liaee, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram, Neal E. Young. [doi]
• Solving Homogeneous Linear Equations over Polynomial SemiringsRuiwen Dong 0001. [doi]
• Counting Temporal PathsJessica A. Enright, Kitty Meeks, Hendrik Molter. [doi]
• Dynamic Data Structures for Parameterized String ProblemsJedrzej Olkowski, Michal Pilipczuk, Mateusz Rychlicki, Karol Wegrzycki, Anna Zych-Pawlewicz. [doi]
• Improved NP-Hardness of Approximation for Orthogonality Dimension and MinrankDror Chawin, Ishay Haviv. [doi]
• Geometric Amortization of Enumeration AlgorithmsFlorent Capelli, Yann Strozecki. [doi]
• Sublinear-Time Probabilistic Cellular AutomataAugusto Modanese. [doi]
• Avoidance Games Are PSPACE-CompleteValentin Gledel, Nacim Oijid. [doi]
• Twin-Width V: Linear Minors, Modular Counting, and Matrix MultiplicationÉdouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Stéphan Thomassé. [doi]
• k) Time FPT Algorithm for Convex Flip DistanceHaohong Li, Ge Xia. [doi]
• Regular Separability in Büchi VASSPascal Baumann 0001, Roland Meyer 0001, Georg Zetzsche. [doi]
• Approximate Selection with Unreliable Comparisons in Optimal Expected TimeShengyu Huang, Chih-Hung Liu 0001, Daniel Rutschmann. [doi]
• Maximum Matching via Maximal Matching QueriesChristian Konrad 0001, Kheeran K. Naidu, Arun Steward. [doi]
• Tight Bounds for Repeated Balls-Into-BinsDimitrios Los, Thomas Sauerwald. [doi]
• Logical Algorithmics: From Theory to Practice (Invited Talk)Moshe Y. Vardi. [doi]
• Maintaining CMSO₂ Properties on Dynamic Structures with Bounded Feedback Vertex NumberKonrad Majewski, Michal Pilipczuk, Marek Sokolowski. [doi]
• Barriers for Faster Dimensionality ReductionOra Nova Fandina, Mikael Møller Høgsgaard, Kasper Green Larsen. [doi]
• Induced Matching Below Guarantees: Average Paves the Way for Fixed-Parameter TractabilityTomohiro Koana. [doi]
• Tight Lower Bounds for Problems Parameterized by Rank-WidthBenjamin Bergougnoux, Tuukka Korhonen, Jesper Nederlof. [doi]
• On the Multilinear Complexity of Associative AlgebrasMarkus Bläser, Hendrik Mayer, Devansh Shringi. [doi]
• Representation of Short Distances in Structurally Sparse GraphsZdenek Dvorák. [doi]
• The Complexity of Checking Quasi-Identities over Finite Algebras with a Mal'cev TermErhard Aichinger, Simon Grünbacher. [doi]
• An Approximation Algorithm for Distance-Constrained Vehicle Routing on TreesMarc Dufay, Claire Mathieu, Hang Zhou 0001. [doi]
• Real Numbers Equally Compressible in Every BaseSatyadev Nandakumar, Subin Pulari. [doi]
• Relating Description Complexity to EntropyReijo Jaakkola, Antti Kuusisto, Miikka Vilander. [doi]
• Strongly Hyperbolic Unit Disk GraphsThomas Bläsius, Tobias Friedrich 0001, Maximilian Katzmann, Daniel Stephan. [doi]
• Gap Preserving Reductions Between Reconfiguration ProblemsNaoto Ohsaka. [doi]
• An Algebraic Approach to Vectorial ProgramsCharles Paperman, Sylvain Salvati, Claire Soyez-Martin. [doi]
• On Hardness of Testing Equivalence to Sparse Polynomials Under ShiftsSuryajith Chillara, Coral Grichener, Amir Shpilka. [doi]
• Reconstructing Words Using Queries on Subwords or FactorsGwénaël Richomme, Matthieu Rosenfeld. [doi]