Table of Contents

• Counting Simplices in Hypergraph StreamsAmit Chakrabarti, Themistoklis K. Haris. [doi]
• List Colouring Trees in Logarithmic SpaceHans L. Bodlaender, Carla Groenland, Hugo Jacob. [doi]
• Lyndon Arrays SimplifiedJonas Ellert. [doi]
• Localized Geometric Moves to Compute Hyperbolic Structures on Triangulated 3-ManifoldsClément Maria, Owen Rouillé. [doi]
• SAT Backdoors: Depth Beats SizeJan Dreier, Sebastian Ordyniak, Stefan Szeider. [doi]
• Improved Bounds for Online Balanced Graph Re-PartitioningRajmohan Rajaraman, Omer Wasim. [doi]
• Computing Smallest Convex Intersecting PolygonsAntonios Antoniadis, Mark de Berg, Sándor Kisfaludi-Bak, Antonis Skarlatos. [doi]
• An Upper Bound on the Number of Extreme Shortest Paths in Arbitrary DimensionsFlorian Barth, Stefan Funke, Claudius Proissl. [doi]
• Embedding Phylogenetic Trees in Networks of Low TreewidthLeo van Iersel, Mark Jones 0001, Mathias Weller. [doi]
• Computing Treedepth in Polynomial Space and Linear FPT TimeWojciech Nadara, Michal Pilipczuk, Marcin Smulewicz. [doi]
• Vertex Sparsifiers for Hyperedge ConnectivityHan Jiang, Shang-En Huang, Thatchaphol Saranurak, Tian Zhang. [doi]
• Submodular Maximization Subject to Matroid Intersection on the FlyMoran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen. [doi]
• Simple Streaming Algorithms for Edge ColoringMohammad Ansari, Mohammad Saneian, Hamid Zarrabi-Zadeh. [doi]
• Techniques for Generalized Colorful k-Center ProblemsGeorg Anegg, Laura Vargas Koch, Rico Zenklusen. [doi]
• Optimizing Safe Flow Decompositions in DAGsShahbaz Khan 0004, Alexandru I. Tomescu. [doi]
• Abstract Morphing Using the Hausdorff Distance and Voronoi DiagramsLex de Kogel, Marc J. van Kreveld, Jordi L. Vermeulen. [doi]
• Fast RSK Correspondence by Doubling SearchAlexander Tiskin. [doi]
• Efficient Recognition of Subgraphs of Planar Cubic Bridgeless GraphsMiriam Goetze, Paul Jungeblut, Torsten Ueckerdt. [doi]
• Simple Worst-Case Optimal Adaptive Prefix-Free CodingTravis Gagie. [doi]
• O(1) Steiner Point Removal in Series-Parallel GraphsD. Ellis Hershkowitz, Jason Li. [doi]
• Galactic Token SlidingValentin Bartier, Nicolas Bousquet, Amer E. Mouawad. [doi]
• Resource Sharing Revisited: Local Weak Duality and Optimal ConvergenceDaniel Blankenburg. [doi]
• When Are Cache-Oblivious Algorithms Cache Adaptive? A Case Study of Matrix Multiplication and SortingArghya Bhattacharya, Abiyaz Chowdhury, Helen Xu, Rathish Das, Rezaul Alam Chowdhury, Rob Johnson, Rishab Nithyanand, Michael A. Bender. [doi]
• Algorithmic Meta-Theorems for Combinatorial Reconfiguration RevisitedTatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi. [doi]
• Efficient Fréchet Distance Queries for SegmentsMaike Buchin, Ivor van der Hoog, Tim Ophelders, Lena Schlipf, Rodrigo I. Silveira, Frank Staals. [doi]
• Approximation Algorithms for Round-UFP and Round-SAPDebajyoti Kar, Arindam Khan 0001, Andreas Wiese. [doi]
• Fast Computation of Zigzag PersistenceTamal K. Dey, Tao Hou. [doi]
• Width Helps and Hinders Splitting FlowsManuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan 0004, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams. [doi]
• Enumerating Minimal Connected Dominating SetsFaisal N. Abu-Khzam, Henning Fernau, Benjamin Gras 0002, Mathieu Liedloff, Kevin Mann. [doi]
• Intersection Searching Amid Tetrahedra in 4-Space and Efficient Continuous Collision DetectionEsther Ezra, Micha Sharir. [doi]
• Faster Algorithm for Unique (k, 2)-CSPOr Zamir. [doi]
• Hardness of Token Swapping on TreesOswin Aichholzer, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, Nicole Wein. [doi]
• Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex CapacitiesSusanne Albers, Sebastian Schubert. [doi]
• Approximation Algorithms for Continuous Clustering and Facility Location ProblemsDeeparnab Chakrabarty, Maryam Negahbani, Ankita Sarkar. [doi]
• Insertion Time of Random Walk Cuckoo Hashing below the Peeling ThresholdStefan Walzer. [doi]
• Conditional Lower Bounds for Dynamic Geometric Measure ProblemsJustin Dallant, John Iacono. [doi]
• There and Back Again: On Applying Data Reduction Rules by Undoing OthersAleksander Figiel, Vincent Froese, André Nichterlein, Rolf Niedermeier. [doi]
• Classical and Quantum Algorithms for Variants of Subset-Sum via Dynamic ProgrammingJonathan Allcock, Yassine Hamoudi, Antoine Joux, Felix Klingelhöfer, Miklos Santha. [doi]
• Faster Approximate Covering of Subcurves Under the Fréchet DistanceFrederik Brüning, Jacobus Conradi, Anne Driemel. [doi]
• Learning-Augmented Query Policies for Minimum Spanning Tree with UncertaintyThomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter. [doi]
• ParGeo: A Library for Parallel Computational GeometryYiqiu Wang, Rahul Yesantharao, Shangdi Yu, Laxman Dhulipala, Yan Gu 0001, Julian Shun. [doi]
• Near Optimal Algorithm for Fault Tolerant Distance Oracle and Single Source Replacement Path ProblemDipan Dey, Manoj Gupta. [doi]
• Determinants from HomomorphismsRadu Curticapean. [doi]
• Bounding and Computing Obstacle Numbers of GraphsMartin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta 0009, Michael Hoffmann 0001, Pavel Valtr, Alexander Wolff 0001. [doi]
• Distinct Elements in Streams: An Algorithm for the (Text) BookSourav Chakraborty 0001, N. V. Vinodchandran, Kuldeep S. Meel. [doi]
• Turbocharging Heuristics for Weak Coloring NumbersAlexander Dobler, Manuel Sorge, Anaïs Villedieu. [doi]
• An Empirical Evaluation of k-Means CoresetsChris Schwiegelshohn, Omar Ali Sheikh-Omar. [doi]
• On Polynomial Kernels for Traveling Salesperson Problem and Its GeneralizationsVáclav Blazej, Pratibha Choudhary, Dusan Knop, Simon Schierreich, Ondrej Suchý, Tomás Valla. [doi]
• Maximizing Sums of Non-Monotone Submodular and Linear Functions: Understanding the Unconstrained CaseKobi Bodek, Moran Feldman. [doi]
• A Systematic Study of Isomorphism Invariants of Finite Groups via the Weisfeiler-Leman DimensionJendrik Brachter, Pascal Schweitzer. [doi]
• Online Metric Allocation and Time-Varying RegularizationNikhil Bansal 0001, Christian Coester. [doi]
• Computing the 4-Edge-Connected Components of a Graph: An Experimental StudyLoukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas. [doi]
• Scheduling Kernels via Configuration LPDusan Knop, Martin Koutecký. [doi]
• Search-Space Reduction via Essential VerticesBenjamin Merlin Bumpus, Bart M. P. Jansen, Jari J. H. de Kroon. [doi]
• Non-Adaptive Edge Counting and Sampling via Bipartite Independent Set QueriesRaghavendra Addanki, Andrew McGregor 0001, Cameron Musco. [doi]
• Chromatic k-Nearest Neighbor QueriesThijs van der Horst, Maarten Löffler, Frank Staals. [doi]
• Faster Path Queries in Colored Trees via Sparse Matrix Multiplication and Min-Plus ProductYounan Gao, Meng He 0001. [doi]
• Average Sensitivity of the Knapsack ProblemSoh Kumabe, Yuichi Yoshida. [doi]
• Combining Predicted and Live Traffic with Time-Dependent A* PotentialsNils Werner, Tim Zeitz. [doi]
• A Local Search Algorithm for Large Maximum Weight Independent Set ProblemsYuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen. [doi]
• Online Spanners in Metric SpacesSujoy Bhore, Arnold Filtser, Hadi Khodabandeh, Csaba D. Tóth. [doi]
• The Pareto Cover ProblemBento Natura, Meike Neuwohner, Stefan Weltge. [doi]
• Improved Search of Relevant Points for Nearest-Neighbor ClassificationAlejandro Flores-Velazco. [doi]
• (In-)Approximability Results for Interval, Resource Restricted, and Low Rank SchedulingMarten Maack, Simon Pukrop, Anna Rodriguez Rasmussen. [doi]
• An Improved Algorithm for Finding the Shortest Synchronizing WordsMarek Szykula, Adam Zyzik. [doi]
• Correlated Stochastic Knapsack with a Submodular ObjectiveSheng Yang, Samir Khuller, Sunav Choudhary, Subrata Mitra, Kanak Mahadik. [doi]
• Taming Graphs with No Large Creatures and Skinny LaddersJakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná 0001, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza. [doi]
• Cardinality Estimation Using Gumbel DistributionAleksander Lukasiewicz, Przemyslaw Uznanski. [doi]
• Computing NP-Hard Repetitiveness Measures via MAX-SATHideo Bannai, Keisuke Goto 0001, Masakazu Ishihata, Shunsuke Kanda, Dominik Köppl, Takaaki Nishimoto. [doi]
• A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix GamesArgyrios Deligkas, Michail Fasoulakis, Evangelos Markakis. [doi]
• Polynomial Kernel for Immersion Hitting in TournamentsLukasz Bozyk, Michal Pilipczuk. [doi]
• A Unified Framework for HopsetsOfer Neiman, Idan Shabat. [doi]
• Longest Cycle Above Erdős-Gallai BoundFedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov. [doi]
• Sparse Temporal Spanners with Low StretchDavide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci 0001, Mirko Rossi. [doi]
• Approximate Circular Pattern MatchingPanagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Solon P. Pissis, Wojciech Rytter, Tomasz Walen, Wiktor Zuba. [doi]
• Improved Polynomial-Time Approximations for Clustering with Minimum Sum of Radii or DiametersZachary Friggstad, Mahya Jamshidian. [doi]
• Simple Dynamic Spanners with Near-Optimal Recourse Against an Adaptive AdversarySayan Bhattacharya, Thatchaphol Saranurak, Pattara Sukprasert. [doi]
• Finding a Cluster in Incomplete DataEduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider. [doi]
• On the External Validity of Average-Case Analyses of Graph AlgorithmsThomas Bläsius, Philipp Fischbeck. [doi]
• TSP in a Simple PolygonHenk Alkema, Mark de Berg, Morteza Monemizadeh, Leonidas Theocharous. [doi]
• A Simpler QPTAS for Scheduling Jobs with Precedence ConstraintsSyamantak Das, Andreas Wiese. [doi]
• Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local SearchBaris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma. [doi]
• Dynamic Coloring of Unit Interval Graphs with Limited Recourse BudgetBartlomiej Bosek, Anna Zych-Pawlewicz. [doi]
• Data Structures for Node Connectivity QueriesZeev Nutov. [doi]
• Spanner Approximations in PracticeMarkus Chimani, Finn Stutzenstein. [doi]
• Hedonic Games and Treewidth RevisitedTesshu Hanaka, Michael Lampis. [doi]
• The Price of Hierarchical ClusteringAnna Arutyunova, Heiko Röglin. [doi]
• Multi-Dimensional Stable Roommates in 2-Dimensional Euclidean SpaceJiehua Chen 0001, Sanjukta Roy. [doi]
• Maximum Weight b-Matchings in Random-Order StreamsChien-Chung Huang, François Sellier. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Fine-Grained Complexity Lower Bounds for Families of Dynamic GraphsMonika Henzinger, Ami Paz, A. R. Sricharan. [doi]
• Approximating Dynamic Time Warping Distance Between Run-Length Encoded StringsZoe Xi, William Kuszmaul. [doi]
• Adaptive-Adversary-Robust Algorithms via Small Copy Tree EmbeddingsBernhard Haepler, D. Ellis Hershkowitz, Goran Zuzic. [doi]