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