Table of Contents

• Tight Analysis of the Primal-Dual Method for Edge-Covering Pliable Set FamiliesZeev Nutov. [doi]
• Lexicographic Transductions of Finite WordsEmmanuel Filiot, Nathan Lhote, Pierre-Alain Reynier. [doi]
• Universality Frontier for Asynchronous Cellular AutomataIvan Baburin, Matthew Cook, Florian Grötschla, Andreas Plesner, Roger Wattenhofer. [doi]
• Kernelization in Almost Linear Time for Clustering into Bounded Vertex Cover ComponentsSriram Bhyravarapu, Pritesh Kumar, Madhumita Kundu, Shivesh K. Roy, Sahiba, Saket Saurabh 0001. [doi]
• Isometric-Universal Graphs for TreesEdgar Baucher, François Dross, Cyril Gavoille. [doi]
• Regular Model Checking for Systems with Effectively Regular Reachability RelationJavier Esparza, Valentin Krasotin. [doi]
• Higher Connectivity in Directed Graphs (Invited Talk)Giuseppe F. Italiano. [doi]
• Elimination Distance to Dominated ClustersNicole Schirrmacher, Sebastian Siebertz, Alexandre Vigny. [doi]
• Model-Theoretic Forcing in Transition AlgebraHashimoto Go, Daniel Gaina. [doi]
• Efficient Matching of Some Fundamental Regular Expressions with BackreferencesTaisei Nogami, Tachio Terauchi. [doi]
• Relative Randomness and Continuous Translation FunctionsIvan Titov. [doi]
• Approximating Prize-Collecting Variants of TSPMorteza Alimi, Tobias Mömke, Michael Ruderer. [doi]
• Adaptive Query Algorithms for Relational Structures Based on Homomorphism CountsBalder ten Cate, Phokion G. Kolaitis, Arnar Á. Kristjánsson. [doi]
• Deciding Regular Games: a Playground for Exponential Time AlgorithmsZihui Liang, Bakh Khoussainov, Mingyu Xiao 0001. [doi]
• Catalytic Computing and Register Programs Beyond Log-DepthYaroslav Alekseev, Yuval Filmus, Ian Mertz, Alexander Smal, Antoine Vinciguerra. [doi]
• On Large Zeros of Linear Recurrence SequencesFlorian Luca, Joël Ouaknine, James Worrell 0001. [doi]
• #SAT-Algorithms for Classes of Threshold Circuits Based on Probabilistic RankNutan Limaye, Adarsh Srinivasan, Srikanth Srinivasan 0001. [doi]
• On Graph Queries and Modal Constraints (Invited Talk)Filip Murlak. [doi]
• Almost-Linear Time Algorithms for Partially Dynamic Graphs (Invited Talk)Rasmus Kyng. [doi]
• On the Reachability Problem for Two-Dimensional Branching VASSClotilde Bizière, Thibault Hilaire, Jérôme Leroux, Grégoire Sutre. [doi]
• Color Refinement for Relational StructuresBenjamin Scheidt, Nicole Schweikardt. [doi]
• Three Fundamental Questions in Modern Infinite-Domain Constraint SatisfactionMichael Pinsker, Jakub Rydval, Moritz Schöbi, Christoph Spiess. [doi]
• Homomorphism Indistinguishability and Game Comonads for Restricted Conjunction and RequantificationGeorg Schindling. [doi]
• Hitting and Covering Affine Families of Convex Polyhedra, with Applications to Robust OptimizationJean Cardinal, Xavier Goaoc, Sarah Wajsbrot. [doi]
• Random Permutations in Computational ComplexityJohn M. Hitchcock, Adewale Sekoni, Hadi Shafei. [doi]
• Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed CapacityJingyang Zhao 0001, Mingyu Xiao 0001. [doi]
• Complexity of Anchored Crossing Number and Crossing Number of Almost Planar GraphsPetr Hlinený. [doi]
• Polynomial-Time Tractable Problems over the p-Adic NumbersManuel Bodirsky, Arno Fehm. [doi]
• Lazy B-TreesCasper Moldrup Rysgaard, Sebastian Wild. [doi]
• Deciding Termination of Simple Randomized LoopsÉléanore Meyer, Jürgen Giesl. [doi]
• Lambdas, Transducers and MSO (Invited Talk)Thomas Colcombet. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Resolving Nondeterminism with RandomnessThomas A. Henzinger, Aditya Prakash 0002, K. S. Thejaswini. [doi]
• Algebraic Barriers to Halving Algorithmic Information Quantities in Correlated StringsAndrei E. Romashchenko. [doi]
• Symmetric Proofs in the Ideal Proof SystemAnuj Dawar, Erich Grädel, Leon Kullmann, Benedikt Pago. [doi]
• Morphisms and BWT-Run SensitivityGabriele Fici, Giuseppe Romana, Marinella Sciortino, Cristian Urbina. [doi]
• FO-Query Enumeration over SLP-Compressed Structures of Bounded DegreeMarkus Lohrey, Sebastian Maneth, Markus L. Schmid. [doi]
• Computational Complexity of Covering Regular TreesJan Bok, Jirí Fiala 0001, Nikola Jedlicková, Jan Kratochvíl. [doi]
• Quantum Programming in Polylogarithmic TimeFlorent Ferrari, Emmanuel Hainry, Romain Péchoux, Mário Silva 0001. [doi]
• Cops and Robbers for Graphs on Surfaces with CrossingsProsenjit Bose, Pat Morin, Karthik Murali 0001. [doi]
• On Synthesis of Distributed Monitors (Invited Talk)Anca Muscholl. [doi]
• Broadcasting Under Structural RestrictionsYudai Egami, Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz 0001. [doi]
• Temporal Graph Realization with Bounded StretchGeorge B. Mertzios, Hendrik Molter, Nils Morawietz, Paul G. Spirakis. [doi]
• Counting Locally Optimal Tours in the TSPBodo Manthey, Jesse van Rhijn. [doi]
• One-Parametric Presburger Arithmetic Has Quantifier EliminationAlessio Mansutti, Mikhail R. Starchak. [doi]
• Online Knapsack Problems with EstimatesJakub Balabán, Matthias Gehnen, Henri Lotze, Finn Seesemann, Moritz Stocker. [doi]
• Deciding Robust Instances of an Escape Problem for Dynamical Systems in Euclidean SpaceEike Neumann. [doi]
• Games with ω-Automatic Preference RelationsVéronique Bruyère, Christophe Grandmont, Jean-François Raskin. [doi]
• Right-Linear Lattices: An Algebraic Theory of ω-Regular Languages, with Fixed PointsAnupam Das 0002, Abhishek De 0001. [doi]
• Symmetry Classes of Hamiltonian CyclesJúlia Baligács, Sofia Brenner, Annette Lutz, Lena Volk. [doi]
• Dynamic Membership for Regular Tree LanguagesAntoine Amarilli, Corentin Barloy, Louis Jachiet, Charles Paperman. [doi]
• Minimization of Deterministic Finite Automata Modulo the Edit DistanceJakub Michaliszyn, Jan Otop. [doi]
• On the Performance of Mildly Greedy Players in k-Coloring GamesVittorio Bilò, Andrea D'Ascenzo, Mattia D'Emidio, Giuseppe F. Italiano. [doi]
• Positional-Player GamesOrna Kupferman, Noam Shenwald. [doi]
• Cutoff Theorems for the Equivalence of Parameterized Quantum CircuitsNeil J. Ross, Scott Wesley. [doi]
• The Complexity of Computing Second SolutionsFabian Egidy, Christian Glaßer, Fynn Godau. [doi]
• On the Complexity of Recoverable Robust Optimization in the Polynomial HierarchyChristoph Grüne, Lasse Wulf. [doi]
• Labelled Well Quasi Ordered Classes of Bounded Linear Clique-WidthAliaume Lopez. [doi]
• New Hardness Results for Low-Rank Matrix CompletionDror Chawin, Ishay Haviv. [doi]
• An EPTAS for Minimizing the Total Weighted Completion Time of Jobs with Release Dates on Uniformly Related MachinesLeah Epstein, Asaf Levin. [doi]
• Register Automata with PermutationsMrudula Balachander, Emmanuel Filiot, Raffaella Gentilini, Nikos Tzevelekos. [doi]
• On Piecewise Affine Reachability with Bellman OperatorsAnton Varonka, Kazuki Watanabe 0003. [doi]
• Solving Partial Dominating Set and Related Problems Using Twin-WidthJakub Balabán, Daniel Mock, Peter Rossmanith. [doi]
• The Complexity of Separability for Semilinear Sets and Parikh AutomataElias Rojas Collins, Chris Köcher, Georg Zetzsche. [doi]
• Wait-Only Broadcast Protocols Are Easier to VerifyLucie Guillou, Arnaud Sangnier, Nathalie Sznajder. [doi]
• Finding Equilibria: Simpler for Pessimists, Simplest for OptimistsLéonard Brice, Thomas A. Henzinger, K. S. Thejaswini. [doi]
• A Proof of Shur's Conjecture on the Growth of Power-Free Languages over Large AlphabetsVuong Bui, Matthieu Rosenfeld. [doi]
• Subcoloring of (Unit) Disk GraphsMalory Marin, Rémi Watrigant. [doi]
• Guarding Offices with Maximum DispersionSándor P. Fekete, Kai Kobbe, Dominik Krupke, Joseph S. B. Mitchell, Christian Rieck, Christian Scheffer. [doi]
• Shortest Paths in Multimode GraphsYael Kirkpatrick, Virginia Vassilevska Williams. [doi]
• Word Structures and Their Automatic PresentationsXiaoyang Gong, Bakh Khoussainov, Yuyang Zhuge. [doi]
• Characterizing Small Circuit Classes from FAC⁰ to FAC¹ via Discrete Ordinary Differential EquationsMelissa Antonelli, Arnaud Durand 0001, Juha Kontinen. [doi]
• A Universal Uniform Approximation Theorem for Neural NetworksOlivier Bournez, Johanne Cohen, Adrian Wurm. [doi]
• Quantum Relaxations of CSP and Structure IsomorphismAmin Karamlou. [doi]
• Counting Distinct Square Substrings in Sublinear TimePanagiotis Charalampopoulos, Manal Mohamed 0001, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba. [doi]
• Graphs with No Long Claws: An Improved Bound for the Analog of the Gyárfás' Path ArgumentRomain Bourneuf, Jana Masaríková, Wojciech Nadara, Marcin Pilipczuk. [doi]
• Sensitivity and Query Complexity Under UncertaintyDeepu Benson, Balagopal Komarath, Nikhil S. Mande, Nalli Sai Soumya, Jayalal Sarma, Karteek Sreenivasaiah. [doi]
• Reachability in Symmetric VASSLukasz Kaminski, Slawomir Lasota 0001. [doi]
• Quasipolynomial-Time Deterministic Kernelization and (Gammoid) RepresentationRohit Gurjar, Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi. [doi]
• Probabilistic Finite Automaton Emptiness Is Undecidable for a Fixed AutomatonGünter Rote. [doi]
• Which Graph Motif Parameters Count?Markus Bläser, Radu Curticapean, Julian Dörfler, Christian Ikenmeyer. [doi]
• A Note on the Complexity of Defensive DominationSteven Chaplick, Grzegorz Gutowski, Tomasz Krawczyk. [doi]
• Strong Keys for Tensor Isomorphism CryptographyAnand Kumar Narayanan. [doi]
• On Expansions of Monadic Second-Order Logic with Dynamical PredicatesJoris Nieuwveld, Joël Ouaknine. [doi]
• Parameterized Spanning Tree CongestionMichael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz 0001. [doi]
• Linear Time Subsequence and Supersequence Regex MatchingAntoine Amarilli, Florin Manea, Tina Ringleb, Markus L. Schmid. [doi]
• Generalized De Bruijn Words, Invertible Necklaces, and the Burrows-Wheeler TransformGabriele Fici, Estéban Gabory. [doi]
• Negated String Containment Is DecidableVojtech Havlena, Michal Hecko, Lukás Holík, Ondrej Lengál. [doi]
• Temporal Valued Constraint Satisfaction ProblemsManuel Bodirsky, Édouard Bonnet, Zaneta Semanisinová. [doi]
• Supercritical Size-Width Tree-Like Resolution Trade-Offs for Graph IsomorphismChristoph Berkholz, Moritz Lichter, Harry Vinall-Smeeth. [doi]
• Token Sliding Reconfiguration on DAGsJona Dirks, Alexandre Vigny. [doi]
• Monotone Bounded-Depth Complexity of Homomorphism PolynomialsC. S. Bhargav, Shiteng Chen, Radu Curticapean, Prateek Dwivedi 0001. [doi]
• Quantitative Monoidal Algebra: Axiomatising Distance with String DiagramsGabriele Lobbia, Wojciech Rozowski, Ralph Sarkis, Fabio Zanasi. [doi]
• The Complexity of Reachability Problems in Strongly Connected Finite AutomataStefan Kiefer, Andrew Ryzhikov. [doi]