Table of Contents

• Fine-Grained Classification of Detecting Dominating PatternsJonathan Dransfeld, Marvin Künnemann, Mirza Redzic. [doi]
• Efficiency of Learned Indexes on Genome SpectraMd. Hasin Abrar, Paul Medvedev, Giorgio Vinciguerra. [doi]
• Core-Sparse Monge Matrix Multiplication: Improved Algorithm and ApplicationsPawel Gawrychowski, Egor Gorbachev, Tomasz Kociumaka. [doi]
• Semi-Streaming Algorithms for Hypergraph MatchingHenrik Reinstädtler, S. M. Ferdous, Alex Pothen, Bora Uçar, Christian Schulz 0003. [doi]
• Fast and Lightweight Distributed Suffix Array ConstructionManuel Haag, Florian Kurpicz, Peter Sanders 0001, Matthias Schimek. [doi]
• Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow ShortcutsBernhard Haeupler, Yaowei Long, Thatchaphol Saranurak, Shengzhe Wang. [doi]
• Near-Optimal Vertex Fault-Tolerant Labels for Steiner ConnectivityKoustav Bhanja, Asaf Petruschka. [doi]
• Maximum List r-Colorable Induced Subgraphs in kP₃-Free GraphsEsther Galby, Paloma T. Lima, Andrea Munaro, Amir Nikabadi. [doi]
• Non-Boolean OMv: One More Reason to Believe Lower Bounds for Dynamic ProblemsBingbing Hu, Adam Polak 0001. [doi]
• Fault-Tolerant Matroid BasesMatthias Bentert, Fedor V. Fomin, Petr A. Golovach, Laure Morelle. [doi]
• Classical Algorithms for Constant Approximation of the Ground State Energy of Local HamiltoniansFrançois Le Gall. [doi]
• Fast Computation of k-Runs, Parameterized Squares, and Other Generalised SquaresYuto Nakashima 0001, Jakub Radoszewski, Tomasz Walen. [doi]
• New Algorithms for Pigeonhole Equal Subset SumCe Jin 0001, Ryan Williams 0001, Stan Zhang. [doi]
• α DistanceYupan Liu, Qisheng Wang. [doi]
• Generalized Graph Packing Problems Parameterized by TreewidthBaris Can Esmer, Dániel Marx. [doi]
• Online Metric TSPChristian Bertram. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Streaming Diameter of High-Dimensional PointsMagnús M. Halldórsson, Nicolaos Matsakis, Pavel Veselý 0001. [doi]
• Optimal Antimatroid SortingBenjamin Aram Berendsohn. [doi]
• An O(nlog n) Algorithm for Single-Source Shortest Paths in Disk GraphsMark de Berg, Sergio Cabello. [doi]
• Faster Algorithm for Second (s, t)-Mincut and Breaking Quadratic Barrier for Dual Edge Sensitivity for (s, t)-MincutSurender Baswana, Koustav Bhanja, Anupam Roy. [doi]
• Courcelle's Theorem for Lipschitz ContinuityTatsuya Gima, Soh Kumabe, Yuichi Yoshida. [doi]
• Testing Depth First Search NumberingArtur Czumaj, Christian Sohler, Stefan Walzer. [doi]
• Online Hitting Sets for Disks of Bounded RadiiMinati De, Satyam Singh 0001, Csaba D. Tóth. [doi]
• Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold MechanismLaxman Dhulipala, Monika Henzinger, George Z. Li, Quanquan C. Liu, A. R. Sricharan, Leqi Zhu. [doi]
• (Multivariate) k-SUM as Barrier to Succinct ComputationGeri Gokaj, Marvin Künnemann, Sabine Storandt, Carina Truschel. [doi]
• Instance-Optimal Imprecise Convex HullSarita de Berg, Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann, Sampson Wong. [doi]
• Going Beyond Surfaces in Diameter ApproximationMichal Wlodarczyk 0001. [doi]
• Linear Layouts Revisited: Stacks, Queues, and Exact AlgorithmsThomas Depian, Simon D. Fink, Robert Ganian, Vaishali Surianarayanan. [doi]
• The Geodesic Fréchet Distance Between Two Curves Bounding a Simple PolygonThijs van der Horst, Marc J. van Kreveld, Tim Ophelders, Bettina Speckmann. [doi]
• Bootstrapping Dynamic APSP via SparsificationRasmus Kyng, Simon Meierhans, Gernot Zöcklein. [doi]
• Subtrajectory Clustering and Coverage Maximization in Cubic Time, or BetterJacobus Conradi, Anne Driemel. [doi]
• Improved Dominance Filtering for Unions and Minkowski Sums of Pareto SetsKonstantinos Karathanasis, Spyros C. Kontogiannis, Christos D. Zaroliagis. [doi]
• Constructing Long Paths in Graph StreamsChristian Konrad 0001, Chhaya Trehan. [doi]
• Beating Competitive Ratio 4 for Graphic Matroid SecretaryKiarash Banihashem, MohammadTaghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta, Danny Mittal, Jan Olkowski. [doi]
• An Optimal Algorithm for Shortest Paths in Unweighted Disk GraphsBruce W. Brewer, Haitao Wang 0001. [doi]
• Incremental Maximization for a Broad Class of ObjectivesYann Disser, David Weckbecker. [doi]
• Min-Max Correlation Clustering via Neighborhood SimilarityNairen Cao, Steven Roche, Hsin-Hao Su. [doi]
• Buffered Partially-Persistent External-Memory Search TreesGerth Stølting Brodal, Casper Moldrup Rysgaard, Rolf Svenning. [doi]
• External-Memory Priority Queues with Optimal InsertionsGerth Stølting Brodal, Michael T. Goodrich, John Iacono, Jared Lo, Ulrich Meyer 0001, Victor Pagan, Nodari Sitchinava, Rolf Svenning. [doi]
• Fast Gaussian Elimination for Low Treewidth MatricesMartin Fürer, Carlos Hoppen, Vilmar Trevisan. [doi]
• Counting Small Induced Subgraphs: Scorpions Are Easy but Not TrivialRadu Curticapean, Simon Döring, Daniel Neuen. [doi]
• A Unified FPT Framework for Crossing Number ProblemsÉric Colin de Verdière, Petr Hlinený. [doi]
• Efficient Top-Down Updates in AVL TreesVincent Jugé. [doi]
• A Dynamic Piecewise-Linear Geometric Index with Worst-Case GuaranteesEmil Toftegaard Gæde, Ivor van der Hoog, Eva Rotenberg, Tord Stordalen. [doi]
• Multicut Problems in Almost-Planar Graphs: the Dependency of Complexity on the Demand PatternFlorian Hörsch, Dániel Marx. [doi]
• Cut-Query Algorithms with Few RoundsYotam Kenneth-Mordoch, Robert Krauthgamer. [doi]
• Better Indexing for Rectangular Pattern MatchingPawel Gawrychowski, Adam Górkiewicz. [doi]
• Connected k-Median with Disjoint and Non-Disjoint ClustersJan Eube, Kelin Luo, Dorian Reineccius, Heiko Röglin, Melanie Schmidt 0001. [doi]
• An Improved Bound for Plane Covering PathsHugo A. Akitaya, Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, John Iacono, Linda Kleist, Michiel Smid, Diane L. Souvaine, Leonidas Theocharous. [doi]
• The Tape Reconfiguration Problem and Its Consequences for Dominating Set ReconfigurationNicolas Bousquet 0001, Quentin Deschamps, Arnaud Mary, Amer E. Mouawad, Théo Pierron. [doi]
• Quantum Approximate k-Minimum FindingMinbo Gao, Zhengfeng Ji, Qisheng Wang. [doi]
• A Simple Algorithm for Trimmed Multipoint EvaluationNick Fischer, Melvin Kallmayer, Leo Wennmann. [doi]
• Engineering Minimal k-Perfect Hash FunctionsStefan Hermann, Sebastian Kirmayer, Hans-Peter Lehmann, Peter Sanders 0001, Stefan Walzer. [doi]
• Securing Dynamic Data: A Primer on Differentially Private Data Structures (Invited Talk)Monika Henzinger, Roodabeh Safavi. [doi]
• A 3.3904-Competitive Online Algorithm for List Update with Uniform CostsMateusz Basiak, Marcin Bienkowski, Martin Böhm 0001, Marek Chrobak, Lukasz Jez, Jirí Sgall, Agnieszka Tatarczuk. [doi]
• Parameterized Algorithms for Computing Pareto SetsJoshua Könen, Heiko Röglin, Tarek Stuck. [doi]
• Hardness of Median and Center in the Ulam MetricNick Fischer, Elazar Goldenberg, Mursalin Habib, Karthik C. S. 0001. [doi]
• A Faster Parametric Search for the Integral Quickest Transshipment ProblemMariia Anapolska, Dario van den Boom, Christina Büsing, Timo Gersing. [doi]
• Deterministic Approximation Algorithm for Graph BurningMatej Lieskovský. [doi]
• Bounded Weighted Edit Distance: Dynamic Algorithms and Matching Lower BoundsItai Boneh, Egor Gorbachev, Tomasz Kociumaka. [doi]
• The Support of Bin Packing Is ExponentialKlaus Jansen, Lis Pirotton, Malte Tutas. [doi]
• A Simple yet Exact Analysis of the MultiQueueStefan Walzer, Marvin Williams. [doi]
• Color Distance Oracles and Snippets: Separation Between Exact and Approximate SolutionsNoam Horowicz, Tsvi Kopelowitz. [doi]
• Linear-Time Multilevel Graph Partitioning via Edge SparsificationLars Gottesbüren, Nikolai Maas, Dominik Rosch, Peter Sanders 0001, Daniel Seemaier. [doi]
• On the Approximability of Train Routing and the Min-Max Disjoint Paths ProblemUmang Bhaskar, Katharina Eickhoff, Lennart Kauther, Jannik Matuschke, Britta Peis, Laura Vargas Koch. [doi]
• Hardness of Computation of Quantum Invariants on 3-Manifolds with Restricted TopologyHenrique Ennes, Clément Maria. [doi]
• Testing Sumsets Is HardXi Chen 0001, Shivam Nadimpalli, Tim Randolph 0001, Rocco A. Servedio, Or Zamir. [doi]
• Computing Largest Subsets of Points Whose Convex Hulls Have Bounded Area and DiameterGianmarco Picarella, Marc J. van Kreveld, Frank Staals, Sjoerd de Vries. [doi]
• Fast and Memory-Efficient BWT Construction of Repetitive Texts Using Lyndon GrammarsJannik Olbrich. [doi]
• On Algorithmic Applications of ℱ-BranchwidthBenjamin Bergougnoux, Thekla Hamm, Lars Jaffke, Paloma T. Lima. [doi]
• Combined Search and Encoding for Seeds, with an Application to Minimal Perfect HashingHans-Peter Lehmann, Peter Sanders 0001, Stefan Walzer, Jonatan Ziegler. [doi]
• A Fast and Simple Algorithm for the Resource Constrained Shortest Path ProblemSaman Ahmadi, Andrea Raith, Mahdi Jalili. [doi]
• Max-Distance Sparsification for Diversification and ClusteringSoh Kumabe. [doi]
• Connected Partitions via Connected Dominating SetsAikaterini Niklanovits, Kirill Simonov, Shaily Verma, Ziena Zeif. [doi]
• Improved Hardness-Of-Approximation for Token-SwappingSam Hiken, Nicole Wein. [doi]
• A Deterministic Partition Tree and ApplicationsHaitao Wang 0001. [doi]
• Compact Representation of Semilinear and Terrain-Like GraphsJean Cardinal, Yelena Yuditsky. [doi]
• When Is String Reconstruction Using de Bruijn Graphs Hard?Ben Bals, Sebastiaan van Krieken, Solon P. Pissis, Leen Stougie, Hilde Verbeek 0001. [doi]
• PLS-Completeness of String PermutationsDominik Scheder, Johannes Tantow. [doi]
• Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph DrawingDavid Eppstein, Michael T. Goodrich, Songyu Liu. [doi]
• Efficient Contractions of Dynamic Graphs - With ApplicationsMonika Henzinger, Evangelos Kosinas, Robin Münk, Harald Räcke. [doi]
• Recognizing and Realizing Temporal Reachability GraphsThomas Erlebach, Othon Michail, Nils Morawietz. [doi]
• Online Makespan Scheduling Under ScenariosEkin Ergen. [doi]
• ε-Net Algorithm Implementation on Hyperbolic SurfacesVincent Despré, Camille Lanuel, Marc Pouget, Monique Teillaud. [doi]
• Safe Sequences via Dominators in DAGs for Path-Covering ProblemsFrancisco Sena, Romeo Rizzi, Alexandru I. Tomescu. [doi]
• Fréchet Distance in Unweighted Planar GraphsIvor van der Hoog, Thijs van der Horst, Eva Rotenberg, Lasse Wulf. [doi]
• Polynomial-Time Constant-Approximation for Fair Sum-Of-Radii ClusteringSina Bagheri Nezhad, Sayan Bandyapadhyay, Tianzhi Chen. [doi]
• Improved Parallel Derandomization via Finite Automata with ApplicationsJeff Giliberti, David G. Harris 0001. [doi]
• Edge Clique Partition and Cover Beyond IndependenceFedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov. [doi]
• Parameterized Approximability for Modular Linear EquationsKonrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström. [doi]
• MorphisHash: Improving Space Efficiency of ShockHash for Minimal Perfect HashingStefan Hermann. [doi]
• Sliding Squares in ParallelHugo A. Akitaya, Sándor P. Fekete, Peter Kramer 0001, Saba Molaei, Christian Rieck, Frederick Stock, Tobias Wallner. [doi]
• Beeping Deterministic CONGEST Algorithms in GraphsPawel Garncarek, Dariusz R. Kowalski, Shay Kutten, Miguel A. Mosteiro. [doi]
• Separating Two Points with Obstacles in the Plane: Improved Upper and Lower BoundsJack Spalding-Jamieson, Anurag Murty Naredla. [doi]
• A Combinatorial Proof of Universal Optimality for Computing a Planar Convex HullIvor van der Hoog, Eva Rotenberg, Daniel Rutschmann. [doi]
• On the Complexity of Knapsack Under Explorable Uncertainty: Hardness and AlgorithmsJens Schlöter. [doi]
• Tolerant Testers for Subgraph-FreenessReut Levi, Jonathan Meiri. [doi]
• Bicriteria Approximation for k-Edge-ConnectivityZeev Nutov, Reut Cohen. [doi]
• From Theory to Practice: Engineering Approximation Algorithms for Dynamic OrientationErnestine Großmann, Henrik Reinstädtler, Eva Rotenberg, Christian Schulz 0003, Ivor van der Hoog, Juliette Vlieghe. [doi]
• Tight Guarantees for Cut-Relative Survivable Network Design via a Decomposition TechniqueNikhil Kumar, J. J. Nan, Chaitanya Swamy. [doi]
• Optimal Quantum Algorithm for Estimating Fidelity to a Pure StateWang Fang 0001, Qisheng Wang. [doi]
• Improved Algorithms for Quantum MaxCut via Partially Entangled MatchingsAnuj Apte, Eunou Lee, Kunal Marwaha, Ojas Parekh, James Sud. [doi]
• Smoothed Analysis of Online Metric ProblemsChristian Coester, Jack Umenberger. [doi]
• Simpler Universally Optimal DijkstraIvor van der Hoog, Eva Rotenberg, Daniel Rutschmann. [doi]
• On the Satisfiability of Random 3-SAT Formulas with k-Wise Independent ClausesIoannis Caragiannis, Nick Gravin, Zhile Jiang. [doi]
• Tight Bounds for Some Classical Problems Parameterized by CutwidthNarek Bojikian, Vera Chekan, Stefan Kratsch. [doi]
• Faster Exponential Algorithms for Cut Problems via Geometric Data StructuresLászló Kozma 0002, Junqi Tan. [doi]
• The Planted Orthogonal Vectors ProblemDavid Kühnemann, Adam Polak 0001, Alon Rosen. [doi]
• Weighted Matching in a Poly-Streaming ModelAhammed Ullah, S. M. Ferdous, Alex Pothen. [doi]
• Property Testing of Curve SimilarityPeyman Afshani, Maike Buchin, Anne Driemel, Marena Richter, Sampson Wong. [doi]
• Graph Modification of Bounded Size to Minor-Closed Classes as Fast as Vertex DeletionLaure Morelle, Ignasi Sau, Dimitrios M. Thilikos. [doi]
• Faster Dynamic 2-Edge Connectivity in Directed GraphsLoukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano. [doi]
• Reconstructing Random Graphs from Distance QueriesMichael Krivelevich, Maksim Zhukovskii. [doi]
• Faster Algorithm for Bounded Tree Edit Distance in the Low-Distance RegimeTomasz Kociumaka, Ali Shahali. [doi]
• Graph Decompositions and Length-Constrained Expanders (Invited Talk)Bernhard Haeupler. [doi]