Table of Contents

• On Geodesic Disks Enclosing Many PointsProsenjit Bose, Guillermo Esteban, David Orden, Rodrigo I. Silveira, Tyler Tuttle. [doi]
• Fantastic Flips and Where to Find Them: A General Framework for Parameterized Local Search on Partitioning ProblemsNiels Grüttemeier, Nils Morawietz, Frank Sommer. [doi]
• On the Complexity of Minimising the Moving Distance for Dispersing ObjectsNicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono 0001. [doi]
• Repairing Schedules by Removing Waiting Times: A Parameterized Complexity AnalysisNiels Grüttemeier, Klaus Heeger. [doi]
• On the Enumeration of Signatures of XOR-CNF'sNadia Creignou, Oscar Defrain, Frédéric Olive, Simon Vilmin. [doi]
• Evolving Distributions Under Local MotionAditya Acharya, David M. Mount. [doi]
• A Near-Linear Time Exact Algorithm for the L₁-Geodesic Fréchet Distance Between Two Curves on the Boundary of a Simple PolygonThijs van der Horst, Marc J. van Kreveld, Tim Ophelders, Bettina Speckmann. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Farthest-Point Voronoi Diagrams in the Hilbert MetricMinju Song, Mook Kwon Jung, Hee-Kap Ahn. [doi]
• Vantage Point Selection Algorithms for Bottleneck Capacity EstimationVikrant Ashvinkumar, Rezaul Chowdhury, Jie Gao 0001, Mayank Goswami 0001, Joseph S. B. Mitchell, Valentin Polishchuk. [doi]
• Parameterized Streaming Algorithms for Topological SortingHo-Lin Chen, Peng-Ting Lin, Meng-Tsung Tsai. [doi]
• Approximation and Parameterized Algorithms for Covering with Disks of Two Types of RadiiSayan Bandyapadhyay, Elijah Mitchell. [doi]
• On the Complexity of Finding 1-Center Spanning TreesPin-Hsian Lee, Meng-Tsung Tsai, Hung-Lung Wang. [doi]
• Clustering Point Sets RevisitedMd. Billal Hossain, Benjamin Raichel. [doi]
• Streaming Algorithms for Conflict-Free ColoringRogers Mathew, Fahad Panolan, Seshikanth. [doi]
• A QPTAS for Facility Location on Unit Disk GraphsZachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour, Hao Sun. [doi]
• Testing Whether a Subgraph Is Convex or IsometricSergio Cabello. [doi]
• An Improved Guillotine Cut for SquaresParinya Chalermsook, Axel Kugelmann, Ly Orgo, Sumedha Uniyal, Minoo Zarsav. [doi]
• Unintuitive Facts About Distances on Planar Graphs (Invited Talk)Hsien-Chih Chang. [doi]
• Convolution and Knapsack in Higher DimensionsKilian Grage, Klaus Jansen, Björn Schumacher. [doi]
• Succinct Data Structures for Chordal Graph with Bounded Leafage or Vertex LeafageMeng He 0001, Kaiyu Wu. [doi]
• Quantum Speedups for Polynomial-Time Dynamic Programming AlgorithmsSusanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista, Michael T. Goodrich, Martin Nöllenburg. [doi]
• Algorithms for Distance Problems in Continuous GraphsSergio Cabello, Delia Garijo, Antonia Kalb, Fabian Klute, Irene Parada, Rodrigo I. Silveira. [doi]
• Fast Kd-Trees for the Kullback-Leibler Divergence and Other Decomposable Bregman DivergencesTuyen Pham, Hubert Wagner. [doi]
• Grandchildren-Weight-Balanced Binary Search TreesVincent Jugé. [doi]
• B-Treaps Revised: Write Efficient Randomized Block Search Trees with High LoadRoodabeh Safavi, Martin P. Seybold. [doi]
• Routing Few Robots in a Crowded NetworkArgyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, Dominik Leko, M. S. Ramanujan 0001. [doi]
• An Efficient Polynomial Time Approximation Scheme for Minimizing the Total Weighted Completion Time on Uniformly Related MachinesLeah Epstein, Asaf Levin. [doi]
• Online Routing in Directed Yao₄^∞ GraphsProsenjit Bose, Jean-Lou De Carufel, John Stuart. [doi]
• The Parameterized Landscape of Labeled Graph ContractionsManuel Lafond, Bertrand Marchand. [doi]
• Approximation Algorithms for the Generalized Point-To-Point ProblemZachary Friggstad, Mohammad R. Salavatipour, Hao Sun. [doi]
• Spanner for the 0/1/∞ Weighted Region ProblemJoachim Gudmundsson, Zijin Huang, André van Renssen, Sampson Wong. [doi]
• Scheduling on Identical Machines with Setup Time and Unknown Execution TimeYasushi Kawase, Kazuhisa Makino, Vinh Long Phan, Hanna Sumita. [doi]
• Lower Bounds for Several Standard Bin Packing Algorithms in the Random Order ModelLeah Epstein, Asaf Levin. [doi]
• On Planar Straight-Line Dominance DrawingsPatrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Fabrizio Frati, Luca Grilli 0001, Giacomo Ortali. [doi]
• On the I/O Complexity of the Cocke-Younger-Kasami Algorithm and of a Family of Related Dynamic Programming AlgorithmsLorenzo De Stefani, Vedant Gupta. [doi]
• Sweeping a Domain with Line-Of-Sight Between Covisible AgentsKien C. Huynh, Joseph S. B. Mitchell, Valentin Polishchuk. [doi]
• A WSPD, Separator and Small Tree Cover for c-Packed GraphsLindsey Deryckere, Joachim Gudmundsson, André van Renssen, Yuan Sha, Sampson Wong. [doi]
• Link Diameter, Radius and 2-Point Link Distance Queries in Polygonal DomainsMart Hagedoorn, Valentin Polishchuk. [doi]
• Linear Layouts of Graphs with Priority QueuesEmilio Di Giacomo, Walter Didimo, Henry Förster, Torsten Ueckerdt, Johannes Zink 0001. [doi]
• Crossing and Independent Families Among PolygonsAnna Brötzner, Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada. [doi]
• On Minimizing Wiggle in Stacked Area ChartsAlexander Dobler, Martin Nöllenburg. [doi]
• Dynamic Streaming Algorithms for Geometric Independent SetTimothy M. Chan, Yuancheng Yu. [doi]
• Novel Complexity Results for Temporal Separators with DeadlinesRiccardo Dondi, Manuel Lafond. [doi]
• Deterministic (2/3 - ε)-Approximation of Matroid Intersection Using Nearly-Linear Independence-Oracle QueriesTatsuya Terao. [doi]
• Enumerating Minimal Dominating Sets and Variants in Chordal Bipartite GraphsEmanuel Elias Silva Castelo, Oscar Defrain, Guilherme C. M. Gomes. [doi]
• Constructing and Routing on Geometric Spanners (Invited Talk)Prosenjit Bose. [doi]
• Computational Geometry with Probabilistically Noisy Primitive OperationsDavid Eppstein, Michael T. Goodrich, Vinesh Sridhar. [doi]
• Skipping Ropes: An Efficient Gray Code Algorithm for Generating Wiggly PermutationsVincent Pilaud, Aaron Williams 0001. [doi]
• Tight Bounds on the Number of Closest Pairs in Vertical SlabsAhmad Biniaz, Prosenjit Bose, Chaeyoon Chung, Jean-Lou De Carufel, John Iacono, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth. [doi]
• Support Vector Machines in the Hilbert GeometryAditya Acharya, Auguste H. Gezalyan, Julian Vanecek, David M. Mount, Sunil Arya. [doi]