LIPIcs, Volume 101, SWAT 2018

• David Eppstein LIPIcs, Volume 101, SWAT'18, Complete Volume 10.4230/LIPIcs.SWAT.2018
• David Eppstein Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.SWAT.2018.0
• Nancy M. Amato Sampling-Based Motion Planning: From Intelligent CAD to Crowd Simulation to Protein Folding (Invited Talk) 10.4230/LIPIcs.SWAT.2018.1
• Sorelle Friedler Optimizing Society? Ensuring Fairness in Automated Decision-Making (Invited Talk) 10.4230/LIPIcs.SWAT.2018.2
• Ankur Moitra Robustness Meets Algorithms (Invited Talk) 10.4230/LIPIcs.SWAT.2018.3
• Ahmed Abdelkader and David M. Mount Economical Delone Sets for Approximating Convex Bodies 10.4230/LIPIcs.SWAT.2018.4
• Pankaj K. Agarwal, Neeraj Kumar, Stavros Sintos, and Subhash Suri Computing Shortest Paths in the Plane with Removable Obstacles 10.4230/LIPIcs.SWAT.2018.5
• Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, and Darren Strash On Romeo and Juliet Problems: Minimizing Distance-to-Sight 10.4230/LIPIcs.SWAT.2018.6
• Evripidis Bampis, Bruno Escoffier, Michael Lampis, and Vangelis Th. Paschos Multistage Matchings 10.4230/LIPIcs.SWAT.2018.7
• Luis Barba, Michael Hoffmann, Matias Korman, and Alexander Pilz Convex Hulls in Polygonal Domains 10.4230/LIPIcs.SWAT.2018.8
• Matthias Bentert, Josef Malík, and Mathias Weller Tree Containment With Soft Polytomies 10.4230/LIPIcs.SWAT.2018.9
• Therese Biedl, Ahmad Biniaz, and Martin Derka On the Size of Outer-String Representations 10.4230/LIPIcs.SWAT.2018.10
• Ahmad Biniaz, Anil Maheshwari, and Michiel Smid Flip Distance to some Plane Configurations 10.4230/LIPIcs.SWAT.2018.11
• Prosenjit Bose, Paz Carmi, J. Mark Keil, Saeed Mehrabi, and Debajyoti Mondal Boundary Labeling for Rectangular Diagrams 10.4230/LIPIcs.SWAT.2018.12
• Prosenjit Bose and Thomas C. Shermer Gathering by Repulsion 10.4230/LIPIcs.SWAT.2018.13
• Ahmad Biniaz, Prosenjit Bose, Aurélien Ooms, and Sander Verdonschot Improved Bounds for Guarding Plane Graphs with Edges 10.4230/LIPIcs.SWAT.2018.14
• Diptarka Chakraborty and Debarati Das Sparse Weight Tolerant Subgraph for Single Source Shortest Path 10.4230/LIPIcs.SWAT.2018.15
• Lijie Chen, Ran Duan, Ruosong Wang, Hanrui Zhang, and Tianyi Zhang An Improved Algorithm for Incremental DFS Tree in Undirected Graphs 10.4230/LIPIcs.SWAT.2018.16
• Hicham El-Zein, J. Ian Munro, and Yakov Nekrich Succinct Dynamic One-Dimensional Point Reporting 10.4230/LIPIcs.SWAT.2018.17
• Khaled Elbassioni and Kazuhisa Makino Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices 10.4230/LIPIcs.SWAT.2018.18
• Andreas Emil Feldmann and Dániel Marx The Parameterized Hardness of the k-Center Problem in Transportation Networks 10.4230/LIPIcs.SWAT.2018.19
• Omrit Filtser and Matthew J. Katz Algorithms for the Discrete Fréchet Distance Under Translation 10.4230/LIPIcs.SWAT.2018.20
• Fedor V. Fomin, Petr A. Golovach, Torstein J. F. Strømme, and Dimitrios M. Thilikos Partial Complementation of Graphs 10.4230/LIPIcs.SWAT.2018.21
• Sutanu Gayen and N. V. Vinodchandran New Algorithms for Distributed Sliding Windows 10.4230/LIPIcs.SWAT.2018.22
• Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, and Charis Papadopoulos Parameterized Aspects of Strong Subgraph Closure 10.4230/LIPIcs.SWAT.2018.23
• Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, and Florian Sikora Parameterized Orientable Deletion 10.4230/LIPIcs.SWAT.2018.24
• Lingxiao Huang, Yifei Jin, and Jian Li SVM via Saddle Point Optimization: New Bounds and Distributed Algorithms 10.4230/LIPIcs.SWAT.2018.25
• Shang-En Huang and Seth Pettie Lower Bounds on Sparse Spanners, Emulators, and Diameter-reducing shortcuts 10.4230/LIPIcs.SWAT.2018.26
• Takehiro Ito and Yota Otachi Reconfiguration of Colorable Sets in Classes of Perfect Graphs 10.4230/LIPIcs.SWAT.2018.27
• Lukasz Kowalik and Arkadiusz Socala Tight Lower Bounds for List Edge Coloring 10.4230/LIPIcs.SWAT.2018.28
• Michael Mitzenmacher, Konstantinos Panagiotou, and Stefan Walzer Load Thresholds for Cuckoo Hashing with Double Hashing 10.4230/LIPIcs.SWAT.2018.29
• Nguyen Kim Thang A Greedy Algorithm for Subspace Approximation Problem 10.4230/LIPIcs.SWAT.2018.30
• Alexander Pilz Planar 3-SAT with a Clause/Variable Cycle 10.4230/LIPIcs.SWAT.2018.31
• Erik D. Demaine and Mikhail Rudoy Tree-Residue Vertex-Breaking: a new tool for proving hardness 10.4230/LIPIcs.SWAT.2018.32
• Lijie Chen, Erik D. Demaine, Yuzhou Gu, Virginia Vassilevska Williams, Yinzhan Xu, and Yuancheng Yu Nearly Optimal Separation Between Partially and Fully Retroactive Data Structures 10.4230/LIPIcs.SWAT.2018.33