Table of Contents

• Size-Constrained Weighted Ancestors with ApplicationsPhilip Bille, Yakov Nekrich, Solon P. Pissis. [doi]
• Range Reporting for Time Series via Rectangle StabbingLotte Blank, Anne Driemel. [doi]
• Optimizing Symbol Visibility Through DisplacementBernd Gärtner, Vishwas Kalani, Meghana M. Reddy, Wouter Meulemans, Bettina Speckmann, Milos Stojakovic. [doi]
• Dynamic L-Budget Clustering of CurvesKevin Buchin, Maike Buchin, Joachim Gudmundsson, Lukas Plätz, Lea Thiel, Sampson Wong. [doi]
• A Logarithmic Integrality Gap for Generalizations of Quasi-Bipartite Instances of Directed Steiner TreeZachary Friggstad, Hao Sun. [doi]
• Finding Induced Subgraphs from Graphs with Small Mim-WidthYota Otachi, Akira Suzuki, Yuma Tamura. [doi]
• Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic GraphsMatthew Johnson 0002, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen. [doi]
• Arboricity-Dependent Algorithms for Edge ColoringSayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon. [doi]
• Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and BeyondBenjamin Merlin Bumpus, Bart M. P. Jansen, Jaime Venne. [doi]
• Sparsity-Parameterised Dynamic Edge ColouringAleksander B. G. Christiansen, Eva Rotenberg, Juliette Vlieghe. [doi]
• On the Online Weighted Non-Crossing Matching ProblemJoan Boyar, Shahin Kamali, Kim S. Larsen, Ali Mohammad Lavasani, Yaqiao Li, Denis Pankratov. [doi]
• Parameterized Complexity of Submodular Minimization Under UncertaintyNaonori Kakimura, Ildikó Schlotter. [doi]
• Subexponential Algorithms in Geometric Graphs via the Subquadratic Grid Minor Property: The Role of Local RadiusGaétan Berthe, Marin Bougeret, Daniel Gonçalves 0001, Jean-Florent Raymond. [doi]
• Optimizing Visibility-Based Search in Polygonal DomainsKien C. Huynh, Joseph S. B. Mitchell, Linh Nguyen, Valentin Polishchuk. [doi]
• A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge LoadsBenjamin Rockel-Wolff. [doi]
• Path-Reporting Distance Oracles with Linear SizeOfer Neiman, Idan Shabat. [doi]
• Destroying Densest Subgraphs Is HardCristina Bazgan, André Nichterlein, Sofia Vazquez Alferez. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Stability in Graphs with Matroid ConstraintsFedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Saket Saurabh 0001. [doi]
• Correlation Clustering with Vertex SplittingMatthias Bentert, Alex Crane, Pål Grønås Drange, Felix Reidl, Blair D. Sullivan. [doi]
• Daisy Bloom FiltersIoana O. Bercea, Jakob Bæk Tejs Houen, Rasmus Pagh. [doi]
• Pairwise Rearrangement is Fixed-Parameter Tractable in the Single Cut-and-Join ModelLora Bailey, Heather C. Smith Blake, Garner Cochran, Nathan Fox, Michael Levet, Reem Mahmoud, Inne Singgih, Grace Stadnyk, Alexander Wiedemann. [doi]
• Toward Grünbaum's ConjectureChristian Ortlieb, Jens M. Schmidt. [doi]
• Approximation Algorithms for the Airport and Railway ProblemMohammad R. Salavatipour, Lijiangnan Tian. [doi]
• Approximating Minimum Sum Coloring with BundlesSeyed Parsa Darbouy, Zachary Friggstad. [doi]
• Local Spanners RevisitedStav Ashur, Sariel Har-Peled. [doi]
• Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement ConstraintsMIT-NASA Space Robots Team, Josh Brunner, Kenneth C. Cheung, Erik D. Demaine, Jenny Diomidova, Christine Gregg, Della H. Hendrickson, Irina Kostitsyna. [doi]
• Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler-LemanMichael Levet, Puck Rombach, Nicholas Sieger. [doi]
• Eliminating Crossings in Ordered GraphsAkanksha Agrawal 0001, Sergio Cabello, Michael Kaufmann 0001, Saket Saurabh 0001, Roohani Sharma, Yushi Uno, Alexander Wolff 0001. [doi]
• Delaunay Triangulations in the Hilbert MetricAuguste H. Gezalyan, Soo Kim, Carlos Lopez, Daniel Skora, Zofia Stefankovic, David M. Mount. [doi]
• Sparse Cuts in Hypergraphs from Random Walks on Simplicial ComplexesAnand Louis, Rameesh Paul, Arka Ray. [doi]
• Search-Space Reduction via Essential Vertices Revisited: Vertex Multicut and Cograph DeletionBart M. P. Jansen, Ruben F. A. Verhaegh. [doi]
• Deterministic Cache-Oblivious FunnelselectGerth Stølting Brodal, Sebastian Wild. [doi]
• Online Bin Covering with Frequency PredictionsMagnus Berg, Shahin Kamali. [doi]
• On the Independence Number of 1-Planar GraphsTherese Biedl, Prosenjit Bose, Babak Miraftab. [doi]
• Solving a Family Of Multivariate Optimization and Decision Problems on Classes of Bounded ExpansionDaniel Mock, Peter Rossmanith. [doi]
• No-Dimensional Tverberg Partitions RevisitedSariel Har-Peled, Eliot Wong Robson. [doi]
• Recognition and Proper Coloring of Unit Segment Intersection GraphsRobert D. Barish, Tetsuo Shibuya. [doi]
• Optimal In-Place Compaction of Sliding CubesIrina Kostitsyna, Tim Ophelders, Irene Parada, Tom Peters, Willem Sonke, Bettina Speckmann. [doi]
• The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval GraphsJesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Martin Milanic, Peter Mursic, Robert Scheffler 0001. [doi]
• Succinct Data Structure for Chordal Graphs with Bounded Vertex LeafageGirish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane. [doi]