<h2>LIPIcs, Volume 99, SoCG 2018</h2>
<ul>
<li>
<span class="authors">Bettina Speckmann and Csaba D. Tóth</span>
<span class="title">LIPIcs, Volume 99, SoCG'18, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018">10.4230/LIPIcs.SoCG.2018</a>
</li>
<li>
<span class="authors">Bettina Speckmann and Csaba D. Tóth</span>
<span class="title">Front Matter, Table of Contents, Foreword, Conference Organization, Additional Reviewers, Acknowledgement of Support, Invited Talks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.0">10.4230/LIPIcs.SoCG.2018.0</a>
</li>
<li>
<span class="authors">Ahmed Abdelkader, Chandrajit L. Bajaj, Mohamed S. Ebeida, Ahmed H. Mahmoud, Scott A. Mitchell, John D. Owens, and Ahmad A. Rushdi</span>
<span class="title">Sampling Conditions for Conforming Voronoi Meshing by the VoroCrust Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.1">10.4230/LIPIcs.SoCG.2018.1</a>
</li>
<li>
<span class="authors">A. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel Smid, and Shakhar Smorodinsky</span>
<span class="title">Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.2">10.4230/LIPIcs.SoCG.2018.2</a>
</li>
<li>
<span class="authors">Michal Adamaszek, Henry Adams, Ellen Gasparovic, Maria Gommel, Emilie Purvine, Radmila Sazdanovic, Bei Wang, Yusu Wang, and Lori Ziegelmeier</span>
<span class="title">Vietoris-Rips and Cech Complexes of Metric Gluings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.3">10.4230/LIPIcs.SoCG.2018.3</a>
</li>
<li>
<span class="authors">Pankaj K. Agarwal, Lars Arge, and Frank Staals</span>
<span class="title">Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.4">10.4230/LIPIcs.SoCG.2018.4</a>
</li>
<li>
<span class="authors">Ryo Ashida and Kotaro Nakagawa</span>
<span class="title">O~(n^{1/3})-Space Algorithm for the Grid Graph Reachability Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.5">10.4230/LIPIcs.SoCG.2018.5</a>
</li>
<li>
<span class="authors">Sang Won Bae, Sergio Cabello, Otfried Cheong, Yoonsung Choi, Fabian Stehn, and Sang Duk Yoon</span>
<span class="title">The Reverse Kakeya Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.6">10.4230/LIPIcs.SoCG.2018.6</a>
</li>
<li>
<span class="authors">Sayan Bandyapadhyay, Santanu Bhowmick, Tanmay Inamdar, and Kasturi Varadarajan</span>
<span class="title">Capacitated Covering Problems in Geometric Spaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.7">10.4230/LIPIcs.SoCG.2018.7</a>
</li>
<li>
<span class="authors">Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Ian Munro, and Michiel Smid</span>
<span class="title">Faster Algorithms for some Optimization Problems on Collinear Points</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.8">10.4230/LIPIcs.SoCG.2018.8</a>
</li>
<li>
<span class="authors">Jean-Daniel Boissonnat, Ramsay Dyer, Arijit Ghosh, and Mathijs Wintraecken</span>
<span class="title">Local Criteria for Triangulation of Manifolds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.9">10.4230/LIPIcs.SoCG.2018.9</a>
</li>
<li>
<span class="authors">Jean-Daniel Boissonnat, André Lieutier, and Mathijs Wintraecken</span>
<span class="title">The Reach, Metric Distortion, Geodesic Convexity and the Variation of Tangent Spaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.10">10.4230/LIPIcs.SoCG.2018.10</a>
</li>
<li>
<span class="authors">Édouard Bonnet and Panos Giannopoulos</span>
<span class="title">Orthogonal Terrain Guarding is NP-complete</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.11">10.4230/LIPIcs.SoCG.2018.11</a>
</li>
<li>
<span class="authors">Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, and Florian Sikora</span>
<span class="title">QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.12">10.4230/LIPIcs.SoCG.2018.12</a>
</li>
<li>
<span class="authors">Håvard Bakke Bjerkevik and Magnus Bakke Botnan</span>
<span class="title">Computational Complexity of the Interleaving Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.13">10.4230/LIPIcs.SoCG.2018.13</a>
</li>
<li>
<span class="authors">Adam Brown and Bei Wang</span>
<span class="title">Sheaf-Theoretic Stratification Learning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.14">10.4230/LIPIcs.SoCG.2018.14</a>
</li>
<li>
<span class="authors">Mickaël Buchet and Emerson G. Escolar</span>
<span class="title">Realizations of Indecomposable Persistence Modules of Arbitrarily Large Dimension</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.15">10.4230/LIPIcs.SoCG.2018.15</a>
</li>
<li>
<span class="authors">Kevin Buchin, Jeff M. Phillips, and Pingfan Tang</span>
<span class="title">Approximating the Distribution of the Median and other Robust Estimators on Uncertain Data</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.16">10.4230/LIPIcs.SoCG.2018.16</a>
</li>
<li>
<span class="authors">Boris Bukh, Xavier Goaoc, Alfredo Hubard, and Matthew Trager</span>
<span class="title">Consistent Sets of Lines with no Colorful Incidence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.17">10.4230/LIPIcs.SoCG.2018.17</a>
</li>
<li>
<span class="authors">Benjamin A. Burton</span>
<span class="title">The HOMFLY-PT Polynomial is Fixed-Parameter Tractable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.18">10.4230/LIPIcs.SoCG.2018.18</a>
</li>
<li>
<span class="authors">Ludovic Calès, Apostolos Chalkis, Ioannis Z. Emiris, and Vissarion Fisikopoulos</span>
<span class="title">Practical Volume Computation of Structured Convex Bodies, and an Application to Modeling Portfolio Dependencies and Financial Crises</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.19">10.4230/LIPIcs.SoCG.2018.19</a>
</li>
<li>
<span class="authors">Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, and Aurélien Ooms</span>
<span class="title">Subquadratic Encodings for Point Configurations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.20">10.4230/LIPIcs.SoCG.2018.20</a>
</li>
<li>
<span class="authors">Timothy Carpenter, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Anastasios Sidiropoulos</span>
<span class="title">Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.21">10.4230/LIPIcs.SoCG.2018.21</a>
</li>
<li>
<span class="authors">Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, and Yann Vaxès</span>
<span class="title">Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.22">10.4230/LIPIcs.SoCG.2018.22</a>
</li>
<li>
<span class="authors">Timothy M. Chan</span>
<span class="title">Tree Drawings Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.23">10.4230/LIPIcs.SoCG.2018.23</a>
</li>
<li>
<span class="authors">Timothy M. Chan and Dimitrios Skrepetos</span>
<span class="title">Approximate Shortest Paths and Distance Oracles in Weighted Unit-Disk Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.24">10.4230/LIPIcs.SoCG.2018.24</a>
</li>
<li>
<span class="authors">Timothy M. Chan and Konstantinos Tsakalidis</span>
<span class="title">Dynamic Planar Orthogonal Point Location in Sublogarithmic Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.25">10.4230/LIPIcs.SoCG.2018.25</a>
</li>
<li>
<span class="authors">Frédéric Chazal and Vincent Divol</span>
<span class="title">The Density of Expected Persistence Diagrams and its Kernel Based Estimation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.26">10.4230/LIPIcs.SoCG.2018.26</a>
</li>
<li>
<span class="authors">Éric Colin de Verdière, Thomas Magnard, and Bojan Mohar</span>
<span class="title">Embedding Graphs into Two-Dimensional Simplicial Complexes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.27">10.4230/LIPIcs.SoCG.2018.27</a>
</li>
<li>
<span class="authors">Roee David, Karthik C. S., and Bundit Laekhanukit</span>
<span class="title">On the Complexity of Closest Pair via Polar-Pair of Point-Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.28">10.4230/LIPIcs.SoCG.2018.28</a>
</li>
<li>
<span class="authors">Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Christian Scheffer, and Henk Meijer</span>
<span class="title">Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.29">10.4230/LIPIcs.SoCG.2018.29</a>
</li>
<li>
<span class="authors">Olivier Devillers, Sylvain Lazard, and William J. Lenhart</span>
<span class="title">3D Snap Rounding</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.30">10.4230/LIPIcs.SoCG.2018.30</a>
</li>
<li>
<span class="authors">Tamal K. Dey, Jiayuan Wang, and Yusu Wang</span>
<span class="title">Graph Reconstruction by Discrete Morse Theory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.31">10.4230/LIPIcs.SoCG.2018.31</a>
</li>
<li>
<span class="authors">Tamal K. Dey and Cheng Xin</span>
<span class="title">Computing Bottleneck Distance for 2-D Interval Decomposable Modules</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.32">10.4230/LIPIcs.SoCG.2018.32</a>
</li>
<li>
<span class="authors">Zdenek Dvorák, Petr Hlinený, and Bojan Mohar</span>
<span class="title">Structure and Generation of Crossing-Critical Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.33">10.4230/LIPIcs.SoCG.2018.33</a>
</li>
<li>
<span class="authors">Herbert Edelsbrunner and Georg Osang</span>
<span class="title">The Multi-cover Persistence of Euclidean Balls</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.34">10.4230/LIPIcs.SoCG.2018.34</a>
</li>
<li>
<span class="authors">Herbert Edelsbrunner, Ziga Virk, and Hubert Wagner</span>
<span class="title">Smallest Enclosing Spheres and Chernoff Points in BregmanGeometry</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.35">10.4230/LIPIcs.SoCG.2018.35</a>
</li>
<li>
<span class="authors">Michael Elkin and Ofer Neiman</span>
<span class="title">Near Isometric Terminal Embeddings for Doubling Metrics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.36">10.4230/LIPIcs.SoCG.2018.36</a>
</li>
<li>
<span class="authors">Ioannis Z. Emiris and Ioannis Psarros</span>
<span class="title">Products of Euclidean Metrics and Applications to Proximity Questions among Curves</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.37">10.4230/LIPIcs.SoCG.2018.37</a>
</li>
<li>
<span class="authors">Stefan Felsner, Linda Kleist, Torsten Mütze, and Leon Sering</span>
<span class="title">Rainbow Cycles in Flip Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.38">10.4230/LIPIcs.SoCG.2018.38</a>
</li>
<li>
<span class="authors">Radoslav Fulek and Jan Kyncl</span>
<span class="title">Hanani-Tutte for Approximating Maps of Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.39">10.4230/LIPIcs.SoCG.2018.39</a>
</li>
<li>
<span class="authors">Radoslav Fulek and Jan Kyncl</span>
<span class="title">The Z_2-Genus of Kuratowski Minors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.40">10.4230/LIPIcs.SoCG.2018.40</a>
</li>
<li>
<span class="authors">Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, and Uli Wagner</span>
<span class="title">Shellability is NP-Complete</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.41">10.4230/LIPIcs.SoCG.2018.41</a>
</li>
<li>
<span class="authors">Arthur van Goethem and Kevin Verbeek</span>
<span class="title">Optimal Morphs of Planar Orthogonal Drawings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.42">10.4230/LIPIcs.SoCG.2018.42</a>
</li>
<li>
<span class="authors">Joshua A. Grochow and Jamie Tucker-Foltz</span>
<span class="title">Computational Topology and the Unique Games Conjecture</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.43">10.4230/LIPIcs.SoCG.2018.43</a>
</li>
<li>
<span class="authors">Andreas Haas</span>
<span class="title">Solving Large-Scale Minimum-Weight Triangulation Instances to Provable Optimality</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.44">10.4230/LIPIcs.SoCG.2018.44</a>
</li>
<li>
<span class="authors">Ivor van der Hoog, Elena Khramtcova, and Maarten Löffler</span>
<span class="title">Dynamic Smooth Compressed Quadtrees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.45">10.4230/LIPIcs.SoCG.2018.45</a>
</li>
<li>
<span class="authors">Kristóf Huszár, Jonathan Spreer, and Uli Wagner</span>
<span class="title">On the Treewidth of Triangulated 3-Manifolds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.46">10.4230/LIPIcs.SoCG.2018.46</a>
</li>
<li>
<span class="authors">Tanmay Inamdar and Kasturi Varadarajan</span>
<span class="title">On Partial Covering For Geometric Set Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.47">10.4230/LIPIcs.SoCG.2018.47</a>
</li>
<li>
<span class="authors">Bruno Jartoux and Nabil H. Mustafa</span>
<span class="title">Optimality of Geometric Local Search</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.48">10.4230/LIPIcs.SoCG.2018.48</a>
</li>
<li>
<span class="authors">Yifei Jin, Jian Li, and Wei Zhan</span>
<span class="title">Odd Yao-Yao Graphs are Not Spanners</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.49">10.4230/LIPIcs.SoCG.2018.49</a>
</li>
<li>
<span class="authors">Kolja Junginger and Evanthia Papadopoulou</span>
<span class="title">Deletion in Abstract Voronoi Diagrams in Expected Linear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.50">10.4230/LIPIcs.SoCG.2018.50</a>
</li>
<li>
<span class="authors">Chaya Keller and Shakhar Smorodinsky</span>
<span class="title">From a (p,2)-Theorem to a Tight (p,q)-Theorem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.51">10.4230/LIPIcs.SoCG.2018.51</a>
</li>
<li>
<span class="authors">Balázs Keszegh</span>
<span class="title">Coloring Intersection Hypergraphs of Pseudo-Disks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.52">10.4230/LIPIcs.SoCG.2018.52</a>
</li>
<li>
<span class="authors">Fabian Klute and Martin Nöllenburg</span>
<span class="title">Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.53">10.4230/LIPIcs.SoCG.2018.53</a>
</li>
<li>
<span class="authors">Kevin Knudson and Bei Wang</span>
<span class="title">Discrete Stratified Morse Theory: A User's Guide</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.54">10.4230/LIPIcs.SoCG.2018.54</a>
</li>
<li>
<span class="authors">Irina Kostitsyna, Bahram Kouhestani, Stefan Langerman, and David Rappaport</span>
<span class="title">An Optimal Algorithm to Compute the Inverse Beacon Attraction Region</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.55">10.4230/LIPIcs.SoCG.2018.55</a>
</li>
<li>
<span class="authors">Marc van Kreveld, Maarten Löffler, and Lionov Wiratma</span>
<span class="title">On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.56">10.4230/LIPIcs.SoCG.2018.56</a>
</li>
<li>
<span class="authors">Thijs Laarhoven</span>
<span class="title">Graph-Based Time-Space Trade-Offs for Approximate Near Neighbors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.57">10.4230/LIPIcs.SoCG.2018.57</a>
</li>
<li>
<span class="authors">Chih-Hung Liu</span>
<span class="title">A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram of Points in a Simple Polygon</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.58">10.4230/LIPIcs.SoCG.2018.58</a>
</li>
<li>
<span class="authors">Leonardo Martínez-Sandoval, Edgardo Roldán-Pensado, and Natan Rubin</span>
<span class="title">Further Consequences of the Colorful Helly Hypothesis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.59">10.4230/LIPIcs.SoCG.2018.59</a>
</li>
<li>
<span class="authors">Malte Milatz</span>
<span class="title">Random Walks on Polytopes of Constant Corank</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.60">10.4230/LIPIcs.SoCG.2018.60</a>
</li>
<li>
<span class="authors">Victor Milenkovic, Elisha Sacks, and Nabeel Butt</span>
<span class="title">Table Based Detection of Degenerate Predicates in Free Space Construction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.61">10.4230/LIPIcs.SoCG.2018.61</a>
</li>
<li>
<span class="authors">Eunjin Oh and Hee-Kap Ahn</span>
<span class="title">Approximate Range Queries for Clustering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.62">10.4230/LIPIcs.SoCG.2018.62</a>
</li>
<li>
<span class="authors">Eunjin Oh and Hee-Kap Ahn</span>
<span class="title">Point Location in Dynamic Planar Subdivisions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.63">10.4230/LIPIcs.SoCG.2018.63</a>
</li>
<li>
<span class="authors">Joseph O'Rourke</span>
<span class="title">Edge-Unfolding Nearly Flat Convex Caps</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.64">10.4230/LIPIcs.SoCG.2018.64</a>
</li>
<li>
<span class="authors">János Pach and Géza Tóth</span>
<span class="title">A Crossing Lemma for Multigraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.65">10.4230/LIPIcs.SoCG.2018.65</a>
</li>
<li>
<span class="authors">Jeff M. Phillips and Wai Ming Tai</span>
<span class="title">Near-Optimal Coresets of Kernel Density Estimates</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.66">10.4230/LIPIcs.SoCG.2018.66</a>
</li>
<li>
<span class="authors">Sharath Raghvendra</span>
<span class="title">Optimal Analysis of an Online Algorithm for the Bipartite Matching Problem on a Line</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.67">10.4230/LIPIcs.SoCG.2018.67</a>
</li>
<li>
<span class="authors">János Pach, Bruce Reed, and Yelena Yuditsky</span>
<span class="title">Almost All String Graphs are Intersection Graphs of Plane Convex Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.68">10.4230/LIPIcs.SoCG.2018.68</a>
</li>
<li>
<span class="authors">Oliver Roche-Newton</span>
<span class="title">An Improved Bound for the Size of the Set A/A+A</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.69">10.4230/LIPIcs.SoCG.2018.69</a>
</li>
<li>
<span class="authors">Anastasios Sidiropoulos, Kritika Singhal, and Vijay Sridhar</span>
<span class="title">Fractal Dimension and Lower Bounds for Geometric Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.70">10.4230/LIPIcs.SoCG.2018.70</a>
</li>
<li>
<span class="authors">Jonathan Spreer and Stephan Tillmann</span>
<span class="title">The Trisection Genus of Standard Simply Connected PL 4-Manifolds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.71">10.4230/LIPIcs.SoCG.2018.71</a>
</li>
<li>
<span class="authors">Haitao Wang and Jingru Zhang</span>
<span class="title">An O(n log n)-Time Algorithm for the k-Center Problem in Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.72">10.4230/LIPIcs.SoCG.2018.72</a>
</li>
<li>
<span class="authors">Jie Xue, Yuan Li, Saladi Rahul, and Ravi Janardan</span>
<span class="title">New Bounds for Range Closest-Pair Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.73">10.4230/LIPIcs.SoCG.2018.73</a>
</li>
<li>
<span class="authors">Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Matthias Konitzny, Lillian Lin, and Christian Scheffer</span>
<span class="title">Coordinated Motion Planning: The Video (Multimedia Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.74">10.4230/LIPIcs.SoCG.2018.74</a>
</li>
<li>
<span class="authors">Satyan L. Devadoss, Daniel D. Johnson, Justin Lee, and Jackson Warley</span>
<span class="title">Geometric Realizations of the 3D Associahedron (Multimedia Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.75">10.4230/LIPIcs.SoCG.2018.75</a>
</li>
<li>
<span class="authors">Dani Demas, Satyan L. Devadoss, and Yu Xuan Hong</span>
<span class="title">Star Unfolding of Boxes (Multimedia Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.76">10.4230/LIPIcs.SoCG.2018.76</a>
</li>
<li>
<span class="authors">Ahmed Abdelkader, Chandrajit L. Bajaj, Mohamed S. Ebeida, Ahmed H. Mahmoud, Scott A. Mitchell, John D. Owens, and Ahmad A. Rushdi</span>
<span class="title">VoroCrust Illustrated: Theory and Challenges (Multimedia Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2018.77">10.4230/LIPIcs.SoCG.2018.77</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