Table of Contents

• Violating Constant Degree Hypothesis Requires Breaking SymmetryPiotr Kawalek, Armin Weiß. [doi]
• Dynamic Unit-Disk Range ReportingHaitao Wang 0001, Yiming Zhao. [doi]
• Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for ColouringSamuel Baguley, Yannic Maus, Janosch Ruff, George Skretas. [doi]
• On Cascades of Reset AutomataRoberto Borelli, Luca Geatti, Marco Montali, Angelo Montanari. [doi]
• Dominating Set, Independent Set, Discrete k-Center, Dispersion, and Related Problems for Planar Points in Convex PositionAnastasiia Tkachenko, Haitao Wang 0001. [doi]
• On Average Baby PIH and Its ApplicationsYuwei Liu, Yijia Chen, Shuangle Li, Bingkai Lin, Xin Zheng. [doi]
• Canonical Labeling of Sparse Random GraphsOleg Verbitsky 0001, Maksim Zhukovskii. [doi]
• Noisy (Binary) Searching: Simple, Fast and CorrectDariusz Dereniowski, Aleksander Lukasiewicz, Przemyslaw Uznanski. [doi]
• Generalized Inner Product Estimation with Limited Quantum CommunicationSrinivasan Arunachalam, Louis Schatzki. [doi]
• Local Equivalence of Stabilizer States: A Graphical CharacterisationNathan Claudet, Simon Perdrix. [doi]
• Being Efficient in Time, Space, and Workload: a Self-Stabilizing Unison and Its ConsequencesStéphane Devismes, David Ilcinkas, Colette Johnen, Frédéric Mazoit. [doi]
• Transforming Stacks into Queues: Mixed and Separated Layouts of GraphsJulia Katheder, Michael Kaufmann 0001, Sergey Pupyrev, Torsten Ueckerdt. [doi]
• Results on H-Freeness Testing in Graphs of Bounded r-AdmissibilityChristine Awofeso, Patrick Greaves, Oded Lachish, Felix Reidl. [doi]
• Nearly-Optimal Algorithm for Non-Clairvoyant Service with DelayNoam Touitou. [doi]
• Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest PathsMatthias Bentert, Fedor V. Fomin, Petr A. Golovach. [doi]
• Local Density and Its Distributed ApproximationAleksander Bjørn Grodt Christiansen, Ivor van der Hoog, Eva Rotenberg. [doi]
• Approximating Densest Subgraph in Geometric Intersection GraphsSariel Har-Peled, Saladi Rahul. [doi]
• Toward Better Depth Lower Bounds: Strong Composition of XOR and a Random FunctionNikolai Chukhin, Alexander S. Kulikov, Ivan Mihajlin. [doi]
• Subshifts Defined by Nondeterministic and Alternating Plane-Walking AutomataBenjamin Hellouin de Menibus, Pacôme Perrotin. [doi]
• Tropical Proof Systems: Between R(CP) and ResolutionYaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch. [doi]
• Residue Domination in Bounded-Treewidth GraphsJakob Greilhuber, Philipp Schepper, Philip Wellnitz. [doi]
• Online Matching with Delays and Size-Based CostsYasushi Kawase, Tomohiro Nakayoshi. [doi]
• A Quasi-Polynomial Time Algorithm for Multi-Arrival on Tree-Like MultigraphsEbrahim Ghorbani, Jonah Leander Hoff, Matthias Mnich. [doi]
• Local Enumeration: The Not-All-Equal CaseMohit Gurumukhani, Ramamohan Paturi, Michael Saks 0001, Navid Talebanfard. [doi]
• Unfairly Splitting Separable NecklacesPatrick Schnider, Linus Stalder, Simon Weber 0001. [doi]
• Efficiently Computing the Minimum Rank of a Matrix in a Monoid of Zero-One MatricesStefan Kiefer, Andrew Ryzhikov. [doi]
• The Hardness of Decision Tree ComplexityBruno Loff, Alexey Milovanov. [doi]
• Cluster Editing on Cographs and Related ClassesManuel Lafond, Alitzel López Sánchez, Weidong Luo. [doi]
• A Faster Algorithm for Constrained Correlation ClusteringNick Fischer, Evangelos Kipouridis, Jonas Klausen, Mikkel Thorup. [doi]
• Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary StructurePierre Fraigniaud, Minh-Hang Nguyen, Ami Paz. [doi]
• The Complexity of Learning LTL, CTL and ATL FormulasBenjamin Bordais, Daniel Neider, Rajarshi Roy 0002. [doi]
• Efficient Approximation Schemes for Scheduling on a Stochastic Number of MachinesLeah Epstein, Asaf Levin. [doi]
• Approximate Minimum Tree Cover in All Symmetric Monotone Norms SimultaneouslyMatthias Kaul, Kelin Luo, Matthias Mnich, Heiko Röglin. [doi]
• Identity-Preserving Lax Extensions and Where to Find ThemSergey Goncharov 0001, Dirk Hofmann, Pedro Nora, Lutz Schröder, Paul Wild. [doi]
• Improved Approximation Algorithms for (1, 2)-TSP and Max-TSP Using Path Covers in the Semi-Streaming ModelSharareh Alipour, Ermiya Farokhnejad, Tobias Mömke. [doi]
• Listing Spanning Trees of Outerplanar Graphs by Pivot-ExchangesNastaran Behrooznia, Torsten Mütze. [doi]
• Commutative ℕ-Rational Series of Polynomial GrowthAliaume Lopez. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Sampling Unlabeled Chordal Graphs in Expected Polynomial TimeÚrsula Hébert-Johnson, Daniel Lokshtanov. [doi]
• MaxMin Separation Problems: FPT Algorithms for st-Separator and Odd Cycle TransversalAjinkya Gaikwad, Hitendra Kumar, Soumen Maity, Saket Saurabh 0001, Roohani Sharma. [doi]
• Approximation of Spanning Tree Congestion Using Hereditary BisectionPetr Kolman. [doi]
• On Read-k Projections of the DeterminantPavel Hrubes, Pushkar S. Joglekar. [doi]
• Independence and Domination on Bounded-Treewidth Graphs: Integer, Rational, and Irrational DistancesTim A. Hartmann, Dániel Marx. [doi]
• A Dichotomy Theorem for Ordinal Ranks in MSODamian Niwinski, Pawel Parys, Michal Skrzypczak. [doi]
• Slightly Non-Linear Higher-Order Tree TransducersLê Thành Dung Nguyên, Gabriele Vanoni. [doi]
• Modal Separation of Fixpoint FormulaeJean Christoph Jung, Jedrzej Kolodziejski. [doi]
• Two-Dimensional Longest Common Extension Queries in Compact SpaceArnab Ganguly 0002, Daniel Gibney, Rahul Shah 0001, Sharma V. Thankachan. [doi]
• CMSO-Transducing Tree-Like Graph DecompositionsRutger Campbell, Bruno Guillon, Mamadou Moustapha Kanté, Eun Jung Kim 0002, Noleen Köhler. [doi]
• Online Disjoint Set Covers: Randomization Is Not NecessaryMarcin Bienkowski, Jaroslaw Byrka, Lukasz Jez. [doi]
• Parameterized Saga of First-Fit and Last-Fit ColoringAkanksha Agrawal 0001, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Shaily Verma. [doi]
• Faster Edge Coloring by Partition SievingShyan Akmal, Tomohiro Koana. [doi]
• Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel MachinesKlaus Heeger, Hendrik Molter. [doi]
• Forbidden Patterns in Mixed Linear LayoutsDeborah Haun, Laura Merker, Sergey Pupyrev. [doi]
• Algebras for Automata: Reasoning with Regularity (Invited Talk)Anupam Das 0002. [doi]
• Polynomial Kernel and Incompressibility for Prison-Free Edge Deletion and CompletionSéhane Bel Houari-Durand, Eduard Eiben, Magnus Wahlström. [doi]
• Protecting the Connectivity of a Graph Under Non-Uniform Edge FailuresFelix Hommelsheim, Zhenwei Liu, Nicole Megow, Guochuan Zhang. [doi]
• How to Play the Accordion: Uniformity and the (Non-)Conservativity of the Linear Approximation of the λ-CalculusRémy Cerda, Lionel Vaux Auclair. [doi]
• Faster Algorithms on Linear Delta-MatroidsTomohiro Koana, Magnus Wahlström. [doi]
• Proof Complexity and Its Relations to SAT Solving (Invited Talk)Albert Atserias. [doi]
• Designing Exploration ContractsMartin Hoefer 0001, Conrad Schecker, Kevin Schewior. [doi]
• Some Recent Advancements in Monotone Circuit Complexity (Invited Talk)Susanna F. de Rezende. [doi]
• A Strongly Polynomial Algorithm for Linear Programs with at Most Two Non-Zero Entries per Row or Column (Invited Talk)Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver, László A. Végh. [doi]
• Multidimensional Quantum Walks, Recursion, and Quantum Divide & ConquerStacey Jeffery, Galina Pass. [doi]
• Monotone Weak Distributive Laws over the Lifted Powerset Monad in Categories of AlgebrasQuentin Aristote. [doi]
• Cycle Counting Under Local Differential Privacy for Degeneracy-Bounded GraphsQuentin Hillebrand, Vorapong Suppakitpaisarn, Tetsuo Shibuya. [doi]
• Twin-Width OneJungho Ahn, Hugo Jacob 0001, Noleen Köhler, Christophe Paul, Amadeus Reinald, Sebastian Wiederrecht. [doi]
• Structure-Guided Automated ReasoningMax Bannach, Markus Hecher. [doi]
• On the Existential Theory of the Reals Enriched with Integer Powers of a Computable NumberJorge Gallego-Hernández, Alessio Mansutti. [doi]
• Dimension-Free Parameterized Approximation Schemes for Hybrid ClusteringAmeet Gadekar, Tanmay Inamdar 0002. [doi]
• A Deterministic Approach to Shortest Path Restoration in Edge Faulty GraphsKeerti Choudhary, Rishabh Dhiman. [doi]
• Colorful Vertex Recoloring of Bipartite GraphsBoaz Patt-Shamir, Adi Rosén, Seeun William Umboh. [doi]
• Computability of Extender Sets in Multidimensional SubshiftsAntonin Callard, Léo Paviet Salomon, Pascal Vanier. [doi]
• Can You Link Up With Treewidth?Radu Curticapean, Simon Döring, Daniel Neuen, Jiaheng Wang 0002. [doi]
• Modular Counting CSP: Reductions and AlgorithmsAmirhossein Kazeminia, Andrei A. Bulatov. [doi]
• Card-Based Protocols Imply PSM ProtocolsKazumasa Shinagawa, Koji Nuida. [doi]
• Multivariate Exploration of Metric DilationAritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar 0002, Satyabrata Jana, Saket Saurabh 0001. [doi]
• Metric Dimension and Geodetic Set Parameterized by Vertex CoverFlorent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li 0005, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale. [doi]