Table of Contents

• Positionality in Σ⁰₂ and a Completeness ResultPierre Ohlmann, Michal Skrzypczak. [doi]
• Semënov Arithmetic, Affine {VASS}, and String ConstraintsAndrei Draghici, Christoph Haase, Florin Manea. [doi]
• Testing Equivalence to Design PolynomialsOmkar Baraskar, Agrim Dewan, Chandan Saha 0001. [doi]
• Contributions to the Domino Problem: Seeding, Recurrence and SatisfiabilityNicolás Bitar. [doi]
• Fault-tolerant k-Supplier with OutliersDeeparnab Chakrabarty, Luc Côté, Ankita Sarkar. [doi]
• Quantum and Classical Communication Complexity of Permutation-Invariant FunctionsZiyi Guan, Yunqi Huang, Penghui Yao, Zekun Ye. [doi]
• Linear Loop Synthesis for Quadratic InvariantsS. Hitarth, George Kenison, Laura Kovács, Anton Varonka. [doi]
• Approximate Circular Pattern Matching Under Edit DistancePanagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba. [doi]
• Arena-Independent Memory Bounds for Nash Equilibria in Reachability GamesJames C. A. Main. [doi]
• Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform HypergraphsMarek Filakovský, Tamio-Vesa Nakajima, Jakub Oprsal, Gianluca Tasinato, Uli Wagner 0001. [doi]
• An Improved Approximation Algorithm for Dynamic Minimum Linear ArrangementMarcin Bienkowski, Guy Even. [doi]
• On the Exact Matching Problem in Dense GraphsNicolas El Maalouly, Sebastian Haslebacher, Lasse Wulf. [doi]
• Satisfiability of Context-Free String Constraints with Subword-Ordering and TransducersC. Aiswarya, Soumodev Mal, Prakash Saivasan. [doi]
• FPT Approximation of Generalised Hypertree Width for Bounded Intersection HypergraphsMatthias Lanzinger, Igor Razgon. [doi]
• Lower Bounds for Set-Blocked Clauses ProofsEmre Yolcu. [doi]
• On the Power of Border Width-2 ABPs over Fields of Characteristic 2Pranjal Dutta, Christian Ikenmeyer, Balagopal Komarath, Harshil Mittal, Saraswati Girish Nanoti, Dhara Thakkar. [doi]
• Temporalizing Digraphs via Linear-Size Balanced Bi-TreesStéphane Bessy, Stéphan Thomassé, Laurent Viennot. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Local Certification of Local Properties: Tight Bounds, Trade-Offs and New ParametersNicolas Bousquet, Laurent Feuilloley, Sébastien Zeitoun. [doi]
• Randomized Query Composition and Product DistributionsSwagato Sanyal. [doi]
• A Faster Algorithm for Constructing the Frequency Difference Consensus TreeJesper Jansson 0001, Wing-Kin Sung, Seyed Ali Tabatabaee, Yutong Yang. [doi]
• A Characterization of Efficiently Compilable Constraint LanguagesChristoph Berkholz, Stefan Mengel, Hermann Wilhelm. [doi]
• Worst-Case and Smoothed Analysis of the Hartigan-Wong Method for k-Means ClusteringBodo Manthey, Jesse van Rhijn. [doi]
• Gapped String Indexing in Subquadratic Space and Sublinear Query TimePhilip Bille, Inge Li Gørtz, Moshe Lewenstein, Solon P. Pissis, Eva Rotenberg, Teresa Anna Steiner. [doi]
• One n Remains to Settle the Tree ConjectureJack Dippel, Adrian Vetta. [doi]
• The Role of Local Algorithms in Privacy (Invited Talk)Sofya Raskhodnikova. [doi]
• Algorithms for Computing Closest Points for SegmentsHaitao Wang 0001. [doi]
• Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-WidthDaniel Neuen. [doi]
• Structurally Tractable Graph Classes (Invited Talk)Szymon Torunczyk. [doi]
• Algorithms for Claims TradingMartin Hoefer 0001, Carmine Ventre, Lisa Wilhelmi. [doi]
• Modal Logic Is More Succinct Iff Bi-Implication Is Available in Some FormChristoph Berkholz, Dietrich Kuske, Christian Schwarz. [doi]
• Parameterized and Approximation Algorithms for Coverings Points with Segments in the PlaneKatarzyna Anna Kowalska, Michal Pilipczuk. [doi]
• Shortest Two Disjoint Paths in Conservative GraphsIldikó Schlotter. [doi]
• Weighted HOM-Problem for Nonnegative IntegersAndreas Maletti, Andreea-Teodora Nász, Erik Paul. [doi]
• A Myhill-Nerode Theorem for Generalized Automata, with Applications to Pattern Matching and CompressionNicola Cotumaccio. [doi]
• Polynomial-Time Pseudodeterministic Constructions (Invited Talk)Igor C. Oliveira. [doi]
• Online Simple Knapsack with Bounded PredictionsMatthias Gehnen, Henri Lotze, Peter Rossmanith. [doi]
• The Complexity of Homomorphism ReconstructibilityJan Böker, Louis Härtel, Nina Runde, Tim Seppelt, Christoph Standke. [doi]
• Max Weight Independent Set in Sparse Graphs with No Long ClawsTara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski. [doi]
• O(1/ε) Is the Answer in Online Weighted Throughput MaximizationFranziska Eberle. [doi]
• Depth-3 Circuit Lower Bounds for k-OVTameem Choudhury, Karteek Sreenivasaiah. [doi]
• The 2-Attractor Problem Is NP-CompleteJanosch Fuchs, Philip Whittington. [doi]
• Decremental Sensitivity Oracles for Covering and Packing MinorsLawqueen Kanesh, Fahad Panolan, M. S. Ramanujan 0001, Peter Strulo. [doi]
• Faster Graph Algorithms Through DAG CompressionMax Bannach, Florian Andreas Marwitz, Till Tantau. [doi]
• Sub-Exponential Time Lower Bounds for #VC and #Matching on 3-Regular GraphsYing Liu, Shiteng Chen. [doi]
• Nonnegativity Problems for Matrix SemigroupsJulian D'Costa, Joël Ouaknine, James Worrell 0001. [doi]
• Solving Discontinuous Initial Value Problems with Unique Solutions Is Equivalent to Computing over the TransfiniteOlivier Bournez, Riccardo Gozzi. [doi]
• Circuit Equivalence in 2-Nilpotent AlgebrasPiotr Kawalek, Michael Kompatscher, Jacek Krzaczkowski. [doi]
• Fixed-Parameter Debordering of Waring RankPranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov. [doi]
• Tree-Layout Based Graph Classes: Proper Chordal GraphsChristophe Paul, Evangelos Protopapas. [doi]
• A Subquadratic Bound for Online BisectionMarcin Bienkowski, Stefan Schmid 0001. [doi]
• The Subpower Membership Problem of 2-Nilpotent AlgebrasMichael Kompatscher. [doi]
• The AC⁰-Complexity of Visibly Pushdown LanguagesStefan Göller, Nathan Grosshans. [doi]
• Directed Regular and Context-Free LanguagesMoses Ganardi, Irmak Saglam, Georg Zetzsche. [doi]
• Spectral Approach to the Communication Complexity of Multi-Party Key AgreementGeoffroy Caillat-Grenier, Andrei E. Romashchenko. [doi]
• A Faster Algorithm for Vertex Cover Parameterized by Solution SizeDavid G. Harris 0001, N. S. Narayanaswamy. [doi]
• Expressive Quantale-Valued Logics for Coalgebras: An Adjunction-Based ApproachHarsh Beohar, Sebastian Gurke, Barbara König 0001, Karla Messing, Jonas Forster, Lutz Schröder, Paul Wild. [doi]
• Computing Twin-Width Parameterized by the Feedback Edge NumberJakub Balabán, Robert Ganian, Mathis Rocton. [doi]
• On a Hierarchy of Spectral Invariants for GraphsVikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky 0001. [doi]
• Removable Online Knapsack and AdviceHans-Joachim Böckenhauer, Fabian Frei, Peter Rossmanith. [doi]