Table of Contents

• Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT AlgorithmsNikhil Vyas 0001, R. Ryan Williams. [doi]
• Lower Bounds for Arithmetic Circuits via the Hankel MatrixNathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre. [doi]
• New Bounds for Randomized List Update in the Paid Exchange ModelSusanne Albers, Maximilian Janke. [doi]
• Succinct Population Protocols for Presburger ArithmeticMichael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax. [doi]
• Constant-Time Dynamic (Δ+1)-ColoringMonika Henzinger, Pan Peng 0001. [doi]
• Computability, Complexity and Programming with Ordinary Differential Equations (Invited Talk)Olivier Bournez. [doi]
• String Indexing with Compressed PatternsPhilip Bille, Inge Li Gørtz, Teresa Anna Steiner. [doi]
• The Tandem Duplication Distance Is NP-HardManuel Lafond, Binhai Zhu, Peng Zou. [doi]
• Typical Sequences Revisited - Computing Width Parameters of GraphsHans L. Bodlaender, Lars Jaffke, Jan Arne Telle. [doi]
• Maximum Matchings in Geometric Intersection GraphsÉdouard Bonnet, Sergio Cabello, Wolfgang Mulzer. [doi]
• NP-Completeness, Proof Systems, and Disjoint NP-PairsTitus Dose, Christian Glaßer. [doi]
• Oracle Complexity Classes and Local Measurements on Physical HamiltoniansSevag Gharibian, Stephen Piddock, Justin Yirka. [doi]
• On Computing Multilinear Polynomials Using Multi-r-ic Depth Four CircuitsSuryajith Chillara. [doi]
• Observation and Distinction. Representing Information in Infinite GamesDietmar Berwanger, Laurent Doyen 0001. [doi]
• Fixed-Parameter Algorithms for Unsplittable Flow CoverAndrés Cristi, Mathieu Mari, Andreas Wiese. [doi]
• Solving Vertex Cover in Polynomial Time on Hyperbolic Random GraphsThomas Bläsius, Philipp Fischbeck, Tobias Friedrich 0001, Maximilian Katzmann. [doi]
• Computing Maximum Matchings in Temporal GraphsGeorge B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche. [doi]
• Non-Rectangular Convolutions and (Sub-)Cadences with Three ElementsMitsuru Funakoshi, Julian Pape-Lange. [doi]
• On Covering Segments with Unit IntervalsDan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj. [doi]
• Tight Bounds for the Cover Times of Random Walks with Heterogeneous Step LengthsBrieuc Guinard, Amos Korman. [doi]
• Perfect Resolution of Conflict-Free Colouring of Interval HypergraphsS. M. Dhannya, N. S. Narayanaswamy. [doi]
• On the Termination of FloodingWalter Hussak, Amitabh Trehan. [doi]
• Reversible Pebble Games and the Relation Between Tree-Like and General Resolution SpaceJacobo Torán, Florian Wörz. [doi]
• Weisfeiler and Leman's Unlikely Journey from Graph Isomorphism to Neural Networks (Invited Talk)Martin Grohe. [doi]
• Streaming Complexity of Spanning Tree ComputationYi-Jun Chang, Martin Farach-Colton, Tsan-sheng Hsu, Meng-Tsung Tsai. [doi]
• Existential Length UniversalityPawel Gawrychowski, Martin Lange, Narad Rampersad, Jeffrey O. Shallit, Marek Szykula. [doi]
• Using Statistical Encoding to Achieve Tree Succinctness Never Seen BeforeMichal Ganczorz. [doi]
• Grundy Coloring & Friends, Half-Graphs, BicliquesPierre Aboulker, Édouard Bonnet, Eun Jung Kim 0002, Florian Sikora. [doi]
• Computing Shrub-Depth DecompositionsJakub Gajarský, Stephan Kreutzer. [doi]
• Asymptotic Divergences and Strong DichotomyXiang Huang 0001, Jack H. Lutz, Elvira Mayordomo, Donald M. Stull. [doi]
• Domino Problem Under Horizontal ConstraintsNathalie Aubrun, Julien Esnay, Mathieu Sablik. [doi]
• Statistical Physics and Algorithms (Invited Talk)Dana Randall. [doi]
• Shortest Reconfiguration of Colorings Under Kempe ChangesMarthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi 0001, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa. [doi]
• Information Distance RevisitedBruno Bauwens. [doi]
• Efficient Parameterized Algorithms for Computing All-Pairs Shortest PathsStefan Kratsch, Florian Nelles. [doi]
• Parameterized Pre-Coloring Extension and List Coloring ProblemsGregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström. [doi]
• An Automaton Group with PSPACE-Complete Word ProblemJan Philipp Wächter, Armin Weiß. [doi]
• Quantum Distributed Algorithm for Triangle Finding in the CONGEST ModelTaisuke Izumi, François Le Gall, Frédéric Magniez. [doi]
• Solving Connectivity Problems Parameterized by Treedepth in Single-Exponential Time and Polynomial SpaceFalko Hegerfeld, Stefan Kratsch. [doi]
• Graphical Models: Queries, Complexity, Algorithms (Tutorial)Martin C. Cooper, Simon de Givry, Thomas Schiex. [doi]
• Secret Key Agreement from Correlated Data, with No Prior InformationMarius Zimand. [doi]
• Near-Optimal Complexity Bounds for Fragments of the Skolem ProblemS. Akshay, Nikhil Balaji, Aniket Murhekar, Rohith Varma, Nikhil Vyas 0001. [doi]
• Improved Bounds on Fourier Entropy and Min-EntropySrinivasan Arunachalam, Sourav Chakraborty 0001, Michal Koucký, Nitin Saurabh, Ronald de Wolf. [doi]
• An FPT Algorithm for Minimum Additive Spanner ProblemYusuke Kobayashi 0001. [doi]
• A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence ProblemLech Duraj. [doi]
• Decidability and Periodicity of Low Complexity TilingsJarkko Kari, Etienne Moutot. [doi]
• Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire ContainmentMirmahdi Rahgoshay, Mohammad R. Salavatipour. [doi]
• Generalised Pattern Matching RevisitedBartlomiej Dudek 0001, Pawel Gawrychowski, Tatiana Starikovskaya. [doi]
• Better Approximations for General Caching and UFP-Cover Under Resource AugmentationAndrés Cristi, Andreas Wiese. [doi]
• How Fast Can You Escape a Compact Polytope?Julian D'Costa, Engel Lefaucheux, Joël Ouaknine, James Worrell 0001. [doi]
• Descriptive Complexity on Non-Polish SpacesAntonin Callard, Mathieu Hoyrup. [doi]
• Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict WidthMichal Wrona. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Cryptocurrency Mining Games with Economic Discount and Decreasing RewardsMarcelo Arenas, Juan L. Reutter, Etienne Toussaint, Martín Ugarte, Francisco José Vial Prado, Domagoj Vrgoc. [doi]
• Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman AlgorithmFrank Fuhlbrück, Johannes Köbler, Oleg Verbitsky. [doi]
• Elimination Distances, Blocking Sets, and Kernels for Vertex CoverEva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse. [doi]
• Inapproximability Results for Scheduling with Interval and Resource RestrictionsMarten Maack, Klaus Jansen. [doi]
• Randomness and Initial Segment Complexity for Probability MeasuresAndré Nies, Frank Stephan 0001. [doi]
• A Trichotomy for Regular Trail QueriesWim Martens, Matthias Niewerth, Tina Trautner. [doi]
• Unambiguous Separators for Tropical Tree AutomataThomas Colcombet, Sylvain Lombardy. [doi]
• The SDP Value for Random Two-Eigenvalue CSPsSidhanth Mohanty, Ryan O'Donnell, Pedro Paredes 0002. [doi]