Table of Contents

• LF Successor: Compact Space Indexing for Order-Isomorphic Pattern MatchingArnab Ganguly 0002, Dhrumil Patel, Rahul Shah, Sharma V. Thankachan. [doi]
• Property Testing of Regular Languages with Applications to Streaming Property Testing of Visibly Pushdown LanguagesGabriel Bathie, Tatiana Starikovskaya. [doi]
• Application of the Level-2 Quantum Lasserre Hierarchy in Quantum Approximation AlgorithmsOjas Parekh, Kevin Thompson 0007. [doi]
• Random Order Vertex Arrival Contention Resolution Schemes for Matching, with ApplicationsHu Fu, Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu, Qianfan Zhang. [doi]
• An Output-Sensitive Algorithm for Computing the Union of Cubes and Fat Boxes in 3DPankaj K. Agarwal, Alex Steiger. [doi]
• Distributed Subgraph Finding: Progress and Challenges (Invited Talk)Keren Censor Hillel. [doi]
• Kernelization, Proof Complexity and Social ChoiceGabriel Istrate, Cosmin Bonchis, Adrian Craciun. [doi]
• The Greedy Algorithm Is not Optimal for On-Line Edge ColoringAmin Saberi, David Wajc. [doi]
• The Theory of Concatenation over Finite ModelsDominik D. Freydenberger, Liat Peterfreund. [doi]
• Deterministic Rounding of Dynamic Fractional MatchingsSayan Bhattacharya, Peter Kiss. [doi]
• Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest PathsTimothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu. [doi]
• Local Approximations of the Independent Set PolynomialDimitris Achlioptas, Kostas Zampetakis. [doi]
• Sparsification of Directed Graphs via Cut BalanceRuoxu Cen, Yu Cheng, Debmalya Panigrahi, Kevin Sun 0001. [doi]
• Direct Sum and Partitionability Testing over General GroupsAndrej Bogdanov, Gautam Prakriya. [doi]
• An Efficient Coding Theorem via Probabilistic Representations and Its ApplicationsZhenjian Lu, Igor Carboni Oliveira. [doi]
• Coboundary and Cosystolic Expansion from Strong SymmetryTali Kaufman, Izhar Oppenheim. [doi]
• Crossing-Optimal Extension of Simple DrawingsRobert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber. [doi]
• Deterministic Maximum Flows in Simple GraphsTianyi Zhang. [doi]
• Improved Approximation for Longest Common Subsequence over Small AlphabetsShyan Akmal, Virginia Vassilevska Williams. [doi]
• A Subexponential Algorithm for ARRIVALBernd Gärtner, Sebastian Haslebacher, Hung P. Hoang. [doi]
• Haystack Hunting Hints and Locker Room CommunicationArtur Czumaj, George Kontogeorgiou, Mike Paterson. [doi]
• Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and CutwidthDániel Marx, Govind S. Sankar, Philipp Schepper. [doi]
• On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their ApplicationsSayan Bandyapadhyay, Fedor V. Fomin, Kirill Simonov. [doi]
• On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime OrderJ. A. Gregor Lagodzinski, Andreas Göbel 0001, Katrin Casel, Tobias Friedrich 0001. [doi]
• Fast n-Fold Boolean Convolution via Additive CombinatoricsKarl Bringmann, Vasileios Nakos. [doi]
• The Submodular Santa Claus Problem in the Restricted Assignment CaseÉtienne Bamas, Paritosh Garg, Lars Rohwedder. [doi]
• Quantum Query Complexity with Matrix-Vector ProductsAndrew M. Childs, Shih-Han Hung, Tongyang Li. [doi]
• Linear Time Runs Over General Ordered AlphabetsJonas Ellert, Johannes Fischer 0001. [doi]
• Approximation Algorithms for Min-Distance Problems in DAGsMina Dalirrooyfard, Jenny Kaufmann. [doi]
• Strong Approximate Consensus Halving and the Borsuk-Ulam TheoremEleni Batziou, Kristoffer Arnsfelt Hansen, Kasper Høgh. [doi]
• Optimal Fine-Grained Hardness of Approximation of Linear EquationsMitali Bafna, Nikhil Vyas 0001. [doi]
• Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed GraphsLijie Chen 0001, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song 0002, Huacheng Yu. [doi]
• Decision Problems for Second-Order Holonomic RecurrencesEike Neumann, Joël Ouaknine, James Worrell 0001. [doi]
• How to Send a Real Number Using a Single Bit (And Some Shared Randomness)Ran Ben-Basat, Michael Mitzenmacher, Shay Vargaftik. [doi]
• Approximately Counting Independent Sets of a Given Size in Bounded-Degree GraphsEwan Davies, Will Perkins. [doi]
• Constant-Factor Approximation to Deadline TSP and Related Problems in (Almost) Quasi-PolytimeZachary Friggstad, Chaitanya Swamy. [doi]
• An Almost Optimal Edit Distance OraclePanagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann. [doi]
• Search Problems in Trees with Symmetries: Near Optimal Traversal Strategies for Individualization-Refinement AlgorithmsMarkus Anders, Pascal Schweitzer. [doi]
• Optimal Transformations of Games and Automata Using Muller ConditionsAntonio Casares, Thomas Colcombet, Nathanaël Fijalkow. [doi]
• High-Girth Near-Ramanujan Graphs with Lossy Vertex ExpansionTheo McKenzie, Sidhanth Mohanty. [doi]
• Breaking the Barrier Of 2 for the Competitiveness of Longest Queue DropAntonios Antoniadis, Matthias Englert, Nicolaos Matsakis, Pavel Veselý. [doi]
• Testing Triangle Freeness in the General Model in Graphs with Arboricity O(√n)Reut Levi. [doi]
• Fourier Conjectures, Correlation Bounds, and MajorityEmanuele Viola. [doi]
• Fine-Grained Hardness for Edit Distance to a Fixed SequenceAmir Abboud, Virginia Vassilevska Williams. [doi]
• Improved Approximation Factor for Adaptive Influence Maximization via Simple Greedy StrategiesGianlorenzo D'Angelo, Debashmita Poddar, Cosimo Vinci. [doi]
• Online Stochastic Matching with Edge ArrivalsNick Gravin, Zhihao Gavin Tang, Kangning Wang. [doi]
• Sublinear Time Hypergraph Sparsification via Cut and Edge Sampling QueriesYu Chen, Sanjeev Khanna, Ansh Nagda. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Comparison-Free Polyregular FunctionsLê Thành Dung Nguyên, Camille Noûs, Pierre Pradic. [doi]
• Optimal-Time Queries on BWT-Runs Compressed IndexesTakaaki Nishimoto, Yasuo Tabei. [doi]
• Automorphisms and Isomorphisms of Maps in Linear TimeKen-ichi Kawarabayashi, Bojan Mohar, Roman Nedela, Peter Zeman 0001. [doi]
• Fully Dynamic Algorithms for Minimum Weight Cycle and Related ProblemsAdam Karczmarz. [doi]
• Algebraic Proof Systems (Invited Talk)Toniann Pitassi. [doi]
• Genome Assembly, from Practice to Theory: Safe, Complete and Linear-TimeMassimo Cairo, Romeo Rizzi, Alexandru I. Tomescu, Elia C. Zirondelli. [doi]
• On Greedily Packing Anchored RectanglesChristoph Damerius, Dominik Kaaser, Peter Kling, Florian Schneider. [doi]
• Deterministic and Game Separability for Regular Languages of Infinite TreesLorenzo Clemente, Michal Skrzypczak. [doi]
• Matching on the Line Admits No o(√log n)-Competitive AlgorithmEnoch Peserico, Michele Scquizzato. [doi]
• Twin-width III: Max Independent Set, Min Dominating Set, and ColoringÉdouard Bonnet, Colin Geniet, Eun Jung Kim 0002, Stéphan Thomassé, Rémi Watrigant. [doi]
• Computational Characterization of Surface Entropies for ℤ² Subshifts of Finite TypeAntonin Callard, Pascal Vanier. [doi]
• Powerset-Like Monads Weakly Distribute over Themselves in Toposes and Compact Hausdorff SpacesAlexandre Goy 0002, Daniela Petrisan, Marc Aiguier. [doi]
• 4 vs 7 Sparse Undirected Unweighted Diameter is SETH-Hard at Time n^{4/3}Édouard Bonnet. [doi]
• Current Algorithms for Detecting Subgraphs of Bounded Treewidth Are Probably OptimalKarl Bringmann, Jasper Slusallek. [doi]
• Symmetries and Complexity (Invited Talk)Andrei A. Bulatov. [doi]
• Constructing a Distance Sensitivity Oracle in O(n^2.5794 M) TimeYong Gu, Hanlin Ren. [doi]
• Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph ExpandersMarc Roth, Johannes Schmitt 0002, Philip Wellnitz. [doi]
• Dynamic Enumeration of Similarity JoinsPankaj K. Agarwal, Xiao Hu, Stavros Sintos, Jun Yang 0001. [doi]
• On the Approximability of Multistage Min-Sum Set CoverDimitris Fotakis, Panagiotis Kostopanagiotis, Vasileios Nakos, Georgios Piliouras, Stratis Skoulakis. [doi]
• Beating Two-Thirds For Random-Order Streaming MatchingSepehr Assadi, Soheil Behnezhad. [doi]
• Lifting for Constant-Depth Circuits and Applications to MCSPMarco Carmosino, Kenneth Hoover, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova. [doi]
• Faster Algorithms for Bounded Tree Edit DistanceShyan Akmal, Ce Jin. [doi]
• Faster Algorithms for Bounded Liveness in Graphs and Game GraphsKrishnendu Chatterjee, Monika Henzinger, Sagar Kale, Alexander Svozil. [doi]
• Multiple Random Walks on Graphs: Mixing Few to Cover ManyNicolás Rivera, Thomas Sauerwald, John Sylvester. [doi]
• Analysis of Smooth Heaps and Slim HeapsMaria Hartmann, László Kozma 0002, Corwin Sinnamon, Robert E. Tarjan. [doi]
• A Complexity Approach to Tree Algebras: the Bounded CaseThomas Colcombet, Arthur Jaquard. [doi]
• A Very Sketchy Talk (Invited Talk)David P. Woodruff. [doi]
• Minimum-Norm Load Balancing Is (Almost) as Easy as Minimizing MakespanSharat Ibrahimpur, Chaitanya Swamy. [doi]
• The Structure of Minimum Vertex CutsSeth Pettie, Longhui Yin. [doi]
• Logarithmic Weisfeiler-Leman Identifies All Planar GraphsMartin Grohe, Sandra Kiefer. [doi]
• Majority vs. Approximate Linear Sum and Average-Case Complexity Below NC¹Lijie Chen 0001, Zhenjian Lu, Xin Lyu 0002, Igor Carboni Oliveira. [doi]
• Counting Short Vector Pairs by Inner Product and Relations to the PermanentAndreas Björklund, Petteri Kaski. [doi]
• Minimum Stable Cut and TreewidthMichael Lampis. [doi]
• Quantum Logspace Algorithm for Powering Matrices with Bounded NormUma Girish, Ran Raz, Wei Zhan. [doi]
• Optimal Spectral-Norm Approximate Minimization of Weighted Finite AutomataBorja Balle, Clara Lacroce, Prakash Panangaden, Doina Precup, Guillaume Rabusseau. [doi]
• Revisiting Priority k-Center: Fairness and OutliersTanvi Bajpai, Deeparnab Chakrabarty, Chandra Chekuri, Maryam Negahbani. [doi]
• Testing Dynamic Environments: Back to BasicsYonatan Nakar, Dana Ron. [doi]
• Uniform Elgot Iteration in FoundationsSergey Goncharov 0001. [doi]
• Faster Algorithms for Rooted Connectivity in Directed GraphsChandra Chekuri, Kent Quanrud. [doi]
• Structural Iterative Rounding for Generalized k-Median ProblemsAnupam Gupta, Benjamin Moseley, Rudy Zhou. [doi]
• Approximating Maximum Integral Multiflows on Bounded Genus GraphsChien-Chung Huang, Mathieu Mari, Claire Mathieu, Jens Vygen. [doi]
• A Spectral Independence View on Hard Spheres via Block DynamicsTobias Friedrich 0001, Andreas Göbel 0001, Martin S. Krejca, Marcus Pappik. [doi]
• Arboreal Categories and ResourcesSamson Abramsky, Luca Reggio. [doi]
• Learning Stochastic Decision TreesGuy Blanc, Jane Lange, Li-Yang Tan. [doi]
• p-Norm Solvers in Slightly Dense Graphs via SparsificationDeeksha Adil, Brian Bullins, Rasmus Kyng, Sushant Sachdeva. [doi]
• Quantum Relational Hoare Logic with ExpectationsYangjia Li, Dominique Unruh. [doi]
• Almost-Optimal Deterministic Treasure Hunt in Arbitrary GraphsSébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc. [doi]
• Additive Approximation Schemes for Load Balancing ProblemsMoritz Buchem, Lars Rohwedder, Tjark Vredeveld, Andreas Wiese. [doi]
• Towards the k-Server Conjecture: A Unifying Potential, Pushing the Frontier to the CircleChristian Coester, Elias Koutsoupias. [doi]
• Maximum Matchings and PopularityTelikepalli Kavitha. [doi]
• Graph Similarity and Homomorphism DensitiesJan Böker. [doi]
• Relational Algorithms for k-Means ClusteringBenjamin Moseley, Kirk Pruhs, Alireza Samadian, Yuyan Wang. [doi]
• Traveling Repairperson, Unrelated Machines, and Other Stories About Average Completion TimesMarcin Bienkowski, Artur Kraska, Hsiang Hsuan Liu. [doi]
• Error Resilient Space Partitioning (Invited Talk)Orr Dunkelman, Zeev Geyzel, Chaya Keller, Nathan Keller, Eyal Ronen, Adi Shamir, Ran J. Tessler. [doi]
• Truthful Allocation in Graphs and HypergraphsGeorge Christodoulou 0001, Elias Koutsoupias, Annamária Kovács. [doi]
• Using a Geometric Lens to Find k Disjoint Shortest PathsMatthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche. [doi]
• A Rice's Theorem for Abstract SemanticsPaolo Baldan, Francesco Ranzato, Linpeng Zhang. [doi]
• From Verification to Causality-Based Explications (Invited Talk)Christel Baier, Clemens Dubslaff, Florian Funke 0002, Simon Jantsch, Rupak Majumdar, Jakob Piribauer, Robin Ziemek. [doi]
• Comparative Design-Choice Analysis of Color Refinement Algorithms Beyond the Worst CaseMarkus Anders, Pascal Schweitzer, Florian Wetzels. [doi]
• Efficient Splitting of NecklacesNoga Alon, Andrei Graur. [doi]
• Improved Lower Bounds for Reachability in Vector Addition SystemsWojciech Czerwinski, Slawomir Lasota 0001, Lukasz Orlikowski. [doi]
• A Linear-Time n^{0.4}-Approximation for Longest Common SubsequenceKarl Bringmann, Debarati Das. [doi]
• Playing Stochastically in Weighted Timed Games to Emulate MemoryBenjamin Monmege, Julie Parreaux, Pierre-Alain Reynier. [doi]
• Beyond PCSP(1-in-3, NAE)Alex Brandts, Stanislav Zivný. [doi]
• Universal Algorithms for Clustering ProblemsArun Ganesh, Bruce M. Maggs, Debmalya Panigrahi. [doi]
• Inference Systems with Corules for Fair Subtyping and Liveness Properties of Binary Session TypesLuca Ciccone, Luca Padovani. [doi]
• Improving Gebauer's Construction of 3-Chromatic Hypergraphs with Few EdgesJakub Kozik. [doi]
• Elementary Equivalence Versus Isomorphism in Semiring SemanticsErich Grädel, Lovro Mrkonjic. [doi]
• SoS Certification for Symmetric Quadratic Functions and Its Connection to Constrained Boolean Hypercube OptimizationAdam Kurpisz, Aaron Potechin, Elias Samuel Wirth. [doi]
• Near-Optimal Schedules for Simultaneous MulticastsBernhard Haeupler, D. Ellis Hershkowitz, David Wajc. [doi]
• Datalog-Expressibility for Monadic and Guarded Second-Order LogicManuel Bodirsky, Simon Knäuer, Sebastian Rudolph. [doi]
• Quasi-Polynomial Time Algorithms for Free Quantum Games in Bounded DimensionHyejung H. Jee, Carlo Sparaciari, Omar Fawzi, Mario Berta. [doi]
• Decremental APSP in Unweighted Digraphs Versus an Adaptive AdversaryJacob Evald, Viktor Fredslund-Hansen, Maximilian Probst Gutenberg, Christian Wulff-Nilsen. [doi]
• Relaxed Locally Correctable Codes with Improved ParametersVahid R. Asadi, Igor Shinkar. [doi]
• Breaking O(nr) for Matroid IntersectionJoakim Blikstad. [doi]
• Conditional Dichotomy of Boolean Ordered Promise CSPsJoshua Brakensiek, Venkatesan Guruswami, Sai Sandeep. [doi]
• Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement PathsYuzhou Gu, Adam Polak 0001, Virginia Vassilevska Williams, Yinzhan Xu. [doi]
• Knapsack and Subset Sum with Small ItemsAdam Polak 0001, Lars Rohwedder, Karol Wegrzycki. [doi]
• Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common SubsequenceKuan Cheng, Alireza Farhadi 0001, MohammadTaghi Hajiaghayi, Zhengzhong Jin, Xin Li 0006, Aviad Rubinstein, Saeed Seddighin, Yu Zheng. [doi]
• Parameterized Applications of Symbolic Differentiation of (Totally) Multilinear PolynomialsCornelius Brand, Kevin Pratt. [doi]
• Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for ConnectivityChandra Chekuri, Kent Quanrud. [doi]
• Separations for Estimating Large Frequency Moments on Data StreamsDavid P. Woodruff, Samson Zhou. [doi]
• Smooth Approximations and Relational Width CollapsesAntoine Mottet, Tomás Nagy, Michael Pinsker, Michal Wrona. [doi]
• Guarded Kleene Algebra with Tests: Coequations, Coinduction, and CompletenessTodd Schmid, Tobias Kappé, Dexter Kozen, Alexandra Silva 0001. [doi]
• Breaking the 2ⁿ Barrier for 5-Coloring and 6-ColoringOr Zamir. [doi]
• Fluted Logic with CountingIan Pratt-Hartmann. [doi]
• Sorting Short IntegersMichal Koucký 0001, Karel Král 0002. [doi]
• Lower Bounds on Dynamic Programming for Maximum Weight Independent SetTuukka Korhonen. [doi]
• New Techniques for Universality in Unambiguous Register AutomataWojciech Czerwinski, Antoine Mottet, Karin Quaas. [doi]
• Analytical Differential Calculus with IntegrationHan Xu, Zhenjiang Hu. [doi]
• New Sublinear Algorithms and Lower Bounds for LIS EstimationIlan Newman, Nithin Varma. [doi]
• Higher-Order Model Checking Step by StepPawel Parys. [doi]
• Non-Mergeable Sketching for Cardinality EstimationSeth Pettie, Dingyu Wang, Longhui Yin. [doi]
• Quantum Algorithms for Matrix Scaling and Matrix BalancingJoran van Apeldoorn, Sander Gribling, Yinan Li, Harold Nieuwboer, Michael Walter, Ronald de Wolf. [doi]
• Fault Tolerant Max-CutKeren Censor Hillel, Noa Marelly, Roy Schwartz 0002, Tigran Tonoyan. [doi]
• Dynamic Membership for Regular LanguagesAntoine Amarilli, Louis Jachiet, Charles Paperman. [doi]