Abstract is missing.
- Computing Shortest Paths in the Plane with Removable ObstaclesPankaj K. Agarwal, Neeraj Kumar 0004, Stavros Sintos, Subhash Suri. [doi]
- Sampling-Based Motion Planning: From Intelligent CAD to Crowd Simulation to Protein Folding (Invited Talk)Nancy M. Amato. [doi]
- Lower Bounds on Sparse Spanners, Emulators, and Diameter-reducing shortcutsShang-En Huang, Seth Pettie. [doi]
- Tree Containment With Soft PolytomiesMatthias Bentert, Josef Malík, Mathias Weller. [doi]
- Algorithms for the Discrete Fréchet Distance Under TranslationOmrit Filtser, Matthew J. Katz. [doi]
- Gathering by RepulsionProsenjit Bose, Thomas C. Shermer. [doi]
- Parameterized Aspects of Strong Subgraph ClosurePetr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos. [doi]
- Flip Distance to some Plane ConfigurationsAhmad Biniaz, Anil Maheshwari, Michiel H. M. Smid. [doi]
- Robustness Meets Algorithms (Invited Talk)Ankur Moitra. [doi]
- On Romeo and Juliet Problems: Minimizing Distance-to-SightHee-Kap Ahn, Eunjin Oh 0001, Lena Schlipf, Fabian Stehn, Darren Strash. [doi]
- Economical Delone Sets for Approximating Convex BodiesAhmed Abdelkader, David M. Mount. [doi]
- Reconfiguration of Colorable Sets in Classes of Perfect GraphsTakehiro Ito, Yota Otachi. [doi]
- Tree-Residue Vertex-Breaking: a new tool for proving hardnessErik D. Demaine, Mikhail Rudoy. [doi]
- Optimizing Society? Ensuring Fairness in Automated Decision-Making (Invited Talk)Sorelle Friedler. [doi]
- Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular MatricesKhaled M. Elbassioni, Kazuhisa Makino. [doi]
- An Improved Algorithm for Incremental DFS Tree in Undirected GraphsLijie Chen, Ran Duan, Ruosong Wang, Hanrui Zhang, Tianyi Zhang. [doi]
- New Algorithms for Distributed Sliding WindowsSutanu Gayen, N. V. Vinodchandran. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Load Thresholds for Cuckoo Hashing with Double HashingMichael Mitzenmacher, Konstantinos Panagiotou, Stefan Walzer. [doi]
- Convex Hulls in Polygonal DomainsLuis Barba, Michael Hoffmann 0001, Matias Korman, Alexander Pilz. [doi]
- Succinct Dynamic One-Dimensional Point ReportingHicham El-Zein, J. Ian Munro, Yakov Nekrich. [doi]
- Improved Bounds for Guarding Plane Graphs with EdgesAhmad Biniaz, Prosenjit Bose, Aurélien Ooms, Sander Verdonschot. [doi]
- Multistage MatchingsEvripidis Bampis, Bruno Escoffier, Michael Lampis, Vangelis Th. Paschos. [doi]
- A Greedy Algorithm for Subspace Approximation ProblemNguyen Kim Thang. [doi]
- Nearly Optimal Separation Between Partially and Fully Retroactive Data StructuresLijie Chen, Erik D. Demaine, Yuzhou Gu, Virginia Vassilevska Williams, Yinzhan Xu, Yuancheng Yu. [doi]
- SVM via Saddle Point Optimization: New Bounds and Distributed AlgorithmsLingxiao Huang, Yifei Jin, Jian Li 0015. [doi]
- Parameterized Orientable DeletionTesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora. [doi]
- The Parameterized Hardness of the k-Center Problem in Transportation NetworksAndreas Emil Feldmann, Dániel Marx. [doi]
- Sparse Weight Tolerant Subgraph for Single Source Shortest PathDiptarka Chakraborty, Debarati Das. [doi]
- Planar 3-SAT with a Clause/Variable CycleAlexander Pilz. [doi]
- Tight Lower Bounds for List Edge ColoringLukasz Kowalik, Arkadiusz Socala. [doi]
- Partial Complementation of GraphsFedor V. Fomin, Petr A. Golovach, Torstein J. F. Strømme, Dimitrios M. Thilikos. [doi]
- On the Size of Outer-String RepresentationsTherese C. Biedl, Ahmad Biniaz, Martin Derka. [doi]
- Boundary Labeling for Rectangular DiagramsProsenjit Bose, Paz Carmi, J. Mark Keil, Saeed Mehrabi 0001, Debajyoti Mondal. [doi]