Table of Contents

• Kernelization Dichotomies for Hitting Minors Under Structural ParameterizationsMarin Bougeret, Eric Brandwein, Ignasi Sau. [doi]
• The Complexity of Homomorphism Reconstruction RevisitedTimo Gervens, Martin Grohe, Louis Härtel, Philipp da Silva Fonseca. [doi]
• Generalised Quantifiers Based on Rabin-Mostowski IndexDenis Kuperberg, Damian Niwinski, Pawel Parys, Michal Skrzypczak. [doi]
• The Asymptotic Size of Finite Irreducible Semigroups of Rational MatricesStefan Kiefer, Andrew Ryzhikov. [doi]
• Optimal Deterministic Rendezvous in Labeled LinesYann Bourreau, Ananth Narayanan, Alexandre Nolin. [doi]
• Circle Graphs Can Be Recognized in Linear TimeChristophe Paul, Ignaz Rutter. [doi]
• A Linear Kernel for Independent Set Reconfiguration in Planar GraphsNicolas Bousquet 0001, Daniel W. Cranston. [doi]
• Pumping-Like Results for Copyless Cost Register Automata and Polynomially Ambiguous Weighted AutomataFilip Mazowiecki, Antoni Puch, Daniel Smertnig. [doi]
• Line Cover and Related ProblemsMatthias Bentert, Fedor V. Fomin, Petr A. Golovach, Souvik Saha 0002, Sanjay Seetharaman, Anannya Upasana. [doi]
• A Polynomial Bound on the Pathwidth of Graphs Edge-Coverable by k Shortest PathsJulien Baste, Lucas de Meyer, Ugo Giocanti, Étienne Objois, Timothé Picavet. [doi]
• The Communication Complexity of Combinatorial Auctions in GraphsGeorge Christodoulou 0001, Elias Koutsoupias, Annamária Kovács, Ioannis Vlachos 0002. [doi]
• Computing Twin-Width via Treedepth and Vertex IntegrityRobert Ganian, Mathis Rocton. [doi]
• Colouring Probe H-Free GraphsDaniël Paulusma, Johannes Rauch, Erik Jan van Leeuwen. [doi]
• Moments in Time: Algebraic Analysis for Solvable Loops (Invited Talk)Laura Kovács. [doi]
• Relative Compressed Reverse Suffix ArrayMuhammed Oguzhan Külekci, Mano Prakash Parthasarathi, Rahul Shah 0001, Sharma V. Thankachan. [doi]
• Computational Hardness of Estimating Quantum Entropies via Binary Entropy BoundsYupan Liu. [doi]
• Polynomial Complementation of Nondeterministic Two-Way Finite Automata by 1-Limited AutomataBruno Guillon, Luca Prigioniero, Javad Taheri. [doi]
• Decidability of Extensions of Presburger Arithmetic by Hardy Field FunctionsHera Brown, Jakub Konieczny. [doi]
• On the p-adic Skolem ProblemPiotr Bacik, Joël Ouaknine, David Purser, James Worrell 0001. [doi]
• A Polynomial Kernel for Face Cover on Non-Embedded Planar GraphsThekla Hamm, Sukanya Pandey, Krisztina Szilágyi. [doi]
• Efficient Compression in SemigroupsAlexander Thumm, Armin Weiß. [doi]
• Threshold-Driven Streaming Graph: Expansion and Rumor SpreadingFlora Angileri, Andrea Clementi, Emanuele Natale, Michele Salvi, Isabella Ziccardi. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• List Coloring Ordered Graphs with Forbidden Induced SubgraphsMarta Piecyk, Pawel Rzazewski. [doi]
• Modularity of Preferential Attachment GraphsKatarzyna Rybarczyk, Malgorzata Sulkowska. [doi]
• Optimal Average Disk-Inspection via Fermat's PrincipleKonstantinos Georgiou. [doi]
• Homomorphism Indistinguishability, Multiplicity Automata Equivalence, and Polynomial Identity TestingMarek Cerný, Tim Seppelt. [doi]
• On the Complexity of Language Membership for Probabilistic WordsAntoine Amarilli, Mikaël Monet, Paul Raphaël, Sylvain Salvati. [doi]
• On Effective Banach-Mazur Games and an Application to the Poincaré Recurrence Theorem for CategoryPrajval Koul, Satyadev Nandakumar. [doi]
• A Pumping-Like Lemma for Languages over Infinite AlphabetsYoav Danieli. [doi]
• On the Hardness of the One-Sided Code Sparsifier ProblemElena Grigorescu, Alice Moayyedi. [doi]
• When Is Local Search Both Effective and Efficient?Artem Kaznatcheev, Sofia Vazquez Alferez. [doi]
• Approximate Cartesian Tree Matching with SubstitutionsPanagiotis Charalampopoulos, Jonas Ellert, Manal Mohamed 0001. [doi]
• Simple Circuit Extensions for XOR in PTIMEMarco Carmosino, Ngu Dang, Tim Jackman. [doi]
• Dynamic Pattern Matching with WildcardsArshia Ataee Naeini, Amir-Parsa Mobed, Masoud Seddighin, Saeed Seddighin. [doi]
• Random Models and Guarded LogicOskar Fiuk. [doi]
• Protrusion Decompositions Revisited: Uniform Lossy Kernels for Reducing Treewidth and Linear Kernels for Hitting Disconnected MinorsRoohani Sharma, Michal Wlodarczyk 0001. [doi]
• Structural Parameterization of Steiner Tree PackingNiko Hastrich, Kirill Simonov. [doi]
• Spectral Norm, Economical Sieve, and Linear Invariance Testing of Boolean FunctionsSwarnalipa Datta, Arijit Ghosh, Chandrima Kayal, Manaswi Paraashar, Manmatha Roy. [doi]
• Upper and Lower Bounds for the Linear Ordering PrincipleEdward A. Hirsch, Ilya Volkovich. [doi]
• Query Languages for Machine-Learning Models (Invited Talk)Martin Grohe. [doi]
• Improving Lagarias-Odlyzko Algorithm for Average-Case Subset Sum: Modular Arithmetic ApproachAntoine Joux, Karol Wegrzycki. [doi]
• A Practical 73/50 Approximation for Contiguous Monotone Moldable Job SchedulingKlaus Jansen, Felix Ohnesorge. [doi]
• Testing H-Freeness on Sparse Graphs, the Case of Bounded ExpansionSamuel Humeau 0002, Mamadou Moustapha Kanté, Daniel Mock, Timothé Picavet, Alexandre Vigny. [doi]
• Optimal Verification of a Minimum-Weight Basis in an Uncertainty MatroidHaya Diwan, Lisa Hellerstein, Nicole Megow, Jens Schlöter. [doi]
• Mind the Gap. Doubling Constant Parametrization of Weighted Problems: TSP, Max-Cut, and MoreMihail Stoian. [doi]
• Lower Bounds for Ranking-Based Pivot RulesYann Disser, Georg Loho, Matthew T. Maat, Nils Mosis. [doi]
• Foremost, Fastest, Shortest: Temporal Graph Realization Under Various Path MetricsJustine Cauvi, Nils Morawietz, Laurent Viennot. [doi]
• Algebraic Characterizations of Classes of Regular Languages in DynFOCorentin Barloy, Felix Tschirbs, Nils Vortmeier, Thomas Zeume. [doi]
• A Permanental Analog of the Rank-Nullity Theorem for Symmetric MatricesPriyanshu Pant, Surabhi Chakrabartty, Ranveer Singh. [doi]
• Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph DensityMatthias Bentert, Tom-Lukas Breitkopf, Vincent Froese, Anton Herrmann, André Nichterlein. [doi]
• Counting Unit Circular Arc IntersectionsHaitao Wang 0001. [doi]
• Approximation Algorithms for Integer Programming with Resource AugmentationHauke Brinkop, Hua Chen, Lin Chen 0009, Klaus Jansen, Guochuan Zhang. [doi]
• Demystifying Codensity Monads via DualityFabian Lenke, Nico Wittrock, Stefan Milius, Henning Urbat. [doi]
• Effective Versions of Strong Measure ZeroMatthew Rayman. [doi]
• Planting and MCMC Sampling from the Potts ModelAndreas Galanis, Leslie Ann Goldberg, Paulina Smolarova. [doi]
• Maximum Reachability Orientation of Mixed GraphsFlorian Hörsch. [doi]
• 2D Minimal Graph Rigidity is in NC for One-Crossing-Minor-Free GraphsRohit Gurjar, Kilian Rothmund, Thomas Thierauf. [doi]
• Computing Tarski Fixed Points in Financial NetworksLeander Besting, Martin Hoefer 0001, Lars Huth. [doi]
• The Diameter of (Threshold) Geometric Inhomogeneous Random GraphsZylan Benjert, Kostas Lakis, Johannes Lengler, Raghu Raman Ravi. [doi]
• Modular Counting over 3-Element and Conservative DomainsAndrei A. Bulatov, Amirhossein Kazeminia. [doi]
• Higher Hardness Results for the Reconfiguration of Odd MatchingsJoseph Dorfer. [doi]
• Advancements in Online Edge Coloring Algorithms (Invited Talk)Ola Svensson. [doi]
• Conditional Complexity Hardness: Monotone Circuit Size, Matrix Rigidity, and Tensor RankNikolai Chukhin, Alexander S. Kulikov, Ivan Mihajlin, Arina Smirnova. [doi]
• Algorithm and Strategy Construction for Sure-Almost-Sure Stochastic Parity GamesLaurent Doyen 0001, Shibashis Guha. [doi]
• A Quantum Pigeonhole Principle and Two Semidefinite Relaxations of Communication ComplexityPavel Dvorák, Bruno Loff, Suhail Sherif. [doi]
• Fully Dynamic Spectral Sparsification for Directed HypergraphsSebastian Forster, Gramoz Goranci, Ali Momeni 0003. [doi]
• The Complexity of Resilience for Digraph QueriesManuel Bodirsky, Zaneta Semanisinová. [doi]
• On the Complexity of Computing Strahler NumbersMoses Ganardi, Markus Lohrey. [doi]
• Smaller Circuits for Bit AdditionMikhail Goncharov, Alexander S. Kulikov, Georgie Levtsov. [doi]
• An Improved Version of Hmelevskii's Theorem on Three-Variable Word EquationsAleksi Saarela. [doi]
• Maker-Maker Games of Rank 4 Are PSPACE-CompleteFlorian Galliot, Jonas Sénizergues. [doi]
• A 13/6-Approximation for Strip Packing via the Bottom-Left AlgorithmStefan Hougardy, Bart Zondervan. [doi]
• Broadcast in Almost Mixing TimeAnton Paramonov, Roger Wattenhofer. [doi]
• One-Clock Synthesis ProblemsSlawomir Lasota 0001, Mathieu Lehaut, Julie Parreaux, Radoslaw Piórkowski. [doi]
• A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSPAndreas Kalavas, Charalampos Platanos, Thanos Tolias. [doi]
• Approximating q → p Norms of Non-Negative Matrices in Nearly-Linear TimeÉtienne Objois, Adrian Vladu. [doi]
• To Buy or Not to Buy: Online Rent-Or-Buy on Node-Weighted GraphsSander Borst, Moritz Venzin. [doi]
• Stealing from the Dragon's Hoard: Online Unbounded Knapsack With RemovalMatthias Gehnen, Moritz Stocker. [doi]
• Refining the Complexity Landscape of Speed Scaling: Hardness and AlgorithmsAntonios Antoniadis 0001, Denise Graafsma, Ruben Hoeksma, Maria Vlasiou. [doi]
• Time-Optimal Construction of String Synchronizing SetsJonas Ellert, Tomasz Kociumaka. [doi]
• Unit Interval Selection in Random Order StreamsCezar-Mihail Alexandru, Adithya Diddapur, Magnús M. Halldórsson, Christian Konrad 0001, Kheeran K. Naidu. [doi]