Table of Contents

• Consistent Sets of Lines with no Colorful IncidenceBoris Bukh, Xavier Goaoc, Alfredo Hubard, Matthew Trager. [doi]
• Near Isometric Terminal Embeddings for Doubling MetricsMichael Elkin, Ofer Neiman. [doi]
• The Multi-cover Persistence of Euclidean BallsHerbert Edelsbrunner, Georg Osang. [doi]
• Graph Reconstruction by Discrete Morse TheoryTamal K. Dey, Jiayuan Wang, Yusu Wang. [doi]
• Odd Yao-Yao Graphs are Not SpannersYifei Jin, Jian Li 0015, Wei Zhan. [doi]
• Local Criteria for Triangulation of ManifoldsJean-Daniel Boissonnat, Ramsay Dyer, Arijit Ghosh, Mathijs Wintraecken. [doi]
• On Optimal Polyline Simplification Using the Hausdorff and Fréchet DistanceMarc J. van Kreveld, Maarten Löffler, Lionov Wiratma. [doi]
• Sampling Conditions for Conforming Voronoi Meshing by the VoroCrust AlgorithmAhmed Abdelkader, Chandrajit L. Bajaj, Mohamed S. Ebeida, Ahmed H. Mahmoud, Scott A. Mitchell, John D. Owens, Ahmad A. Rushdi. [doi]
• Hanani-Tutte for Approximating Maps of GraphsRadoslav Fulek, Jan Kyncl. [doi]
• Fractal Dimension and Lower Bounds for Geometric ProblemsAnastasios Sidiropoulos, Kritika Singhal, Vijay Sridhar. [doi]
• The Density of Expected Persistence Diagrams and its Kernel Based EstimationFrédéric Chazal, Vincent Divol. [doi]
• On the Treewidth of Triangulated 3-ManifoldsKristóf Huszár, Jonathan Spreer, Uli Wagner 0001. [doi]
• Capacitated Covering Problems in Geometric SpacesSayan Bandyapadhyay, Santanu Bhowmick, Tanmay Inamdar 0002, Kasturi R. Varadarajan. [doi]
• An Improved Bound for the Size of the Set A/A+AOliver Roche-Newton. [doi]
• Deletion in Abstract Voronoi Diagrams in Expected Linear TimeKolja Junginger, Evanthia Papadopoulou. [doi]
• Coordinated Motion Planning: The Video (Multimedia Exposition)Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Matthias Konitzny, Lillian Lin, Christian Scheffer. [doi]
• On Partial Covering For Geometric Set SystemsTanmay Inamdar 0002, Kasturi R. Varadarajan. [doi]
• 3D Snap RoundingOlivier Devillers, Sylvain Lazard, William J. Lenhart. [doi]
• Dynamic Planar Orthogonal Point Location in Sublogarithmic TimeTimothy M. Chan, Konstantinos Tsakalidis. [doi]
• Graph-Based Time-Space Trade-Offs for Approximate Near NeighborsThijs Laarhoven. [doi]
• Front Matter, Table of Contents, Foreword, Conference Organization, Additional Reviewers, Acknowledgement of Support, Invited Talks [doi]
• Practical Volume Computation of Structured Convex Bodies, and an Application to Modeling Portfolio Dependencies and Financial CrisesLudovic Calès, Apostolos Chalkis, Ioannis Z. Emiris, Vissarion Fisikopoulos. [doi]
• Computing Bottleneck Distance for 2-D Interval Decomposable ModulesTamal K. Dey, Cheng Xin. [doi]
• VoroCrust Illustrated: Theory and Challenges (Multimedia Exposition)Ahmed Abdelkader, Chandrajit L. Bajaj, Mohamed S. Ebeida, Ahmed H. Mahmoud, Scott A. Mitchell, John D. Owens, Ahmad A. Rushdi. [doi]
• QPTAS and Subexponential Algorithm for Maximum Clique on Disk GraphsÉdouard Bonnet, Panos Giannopoulos, Eun Jung Kim 0002, Pawel Rzazewski, Florian Sikora. [doi]
• Optimal Analysis of an Online Algorithm for the Bipartite Matching Problem on a LineSharath Raghvendra. [doi]
• The HOMFLY-PT Polynomial is Fixed-Parameter TractableBenjamin A. Burton. [doi]
• Computational Topology and the Unique Games ConjectureJoshua A. Grochow, Jamie Tucker-Foltz. [doi]
• Rainbow Cycles in Flip GraphsStefan Felsner, Linda Kleist, Torsten Mütze, Leon Sering. [doi]
• Fast Approximation and Exact Computation of Negative Curvature Parameters of GraphsJérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe , Abdulhakeem Mohammed, Yann Vaxès. [doi]
• Subquadratic Encodings for Point ConfigurationsJean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms. [doi]
• An O(n log n)-Time Algorithm for the k-Center Problem in TreesHaitao Wang 0001, Jingru Zhang. [doi]
• Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple PolygonPankaj K. Agarwal, Lars Arge, Frank Staals. [doi]
• Products of Euclidean Metrics and Applications to Proximity Questions among CurvesIoannis Z. Emiris, Ioannis Psarros. [doi]
• Star Unfolding of Boxes (Multimedia Exposition)Dani Demas, Satyan L. Devadoss, Yu-xuan Hong. [doi]
• Tree Drawings RevisitedTimothy M. Chan. [doi]
• The Reverse Kakeya ProblemSang Won Bae, Sergio Cabello, Otfried Cheong, Yoonsung Choi, Fabian Stehn, Sang Duk Yoon. [doi]
• Further Consequences of the Colorful Helly HypothesisLeonardo Martínez-Sandoval, Edgardo Roldán-Pensado, Natan Rubin. [doi]
• From a (p, 2)-Theorem to a Tight (p, q)-TheoremChaya Keller, Shakhar Smorodinsky. [doi]
• Approximate Shortest Paths and Distance Oracles in Weighted Unit-Disk GraphsTimothy M. Chan, Dimitrios Skrepetos. [doi]
• Minimizing Crossings in Constrained Two-Sided Circular Graph LayoutsFabian Klute, Martin Nöllenburg. [doi]
• Approximating the Distribution of the Median and other Robust Estimators on Uncertain DataKevin Buchin, Jeff M. Phillips, Pingfan Tang. [doi]
• Table Based Detection of Degenerate Predicates in Free Space ConstructionVictor Milenkovic, Elisha Sacks, Nabeel Butt. [doi]
• Vietoris-Rips and Cech Complexes of Metric GluingsMichal Adamaszek, Henry Adams, Ellen Gasparovic, Maria Gommel, Emilie Purvine, Radmila Sazdanovic, Bei Wang, Yusu Wang, Lori Ziegelmeier. [doi]
• Faster Algorithms for some Optimization Problems on Collinear PointsAhmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid. [doi]
• Solving Large-Scale Minimum-Weight Triangulation Instances to Provable OptimalityAndreas Haas. [doi]
• Approximating Maximum Diameter-Bounded Subgraph in Unit Disk GraphsA. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel H. M. Smid, Shakhar Smorodinsky. [doi]
• New Bounds for Range Closest-Pair ProblemsJie Xue, Yuan Li, Saladi Rahul, Ravi Janardan. [doi]
• An Optimal Algorithm to Compute the Inverse Beacon Attraction RegionIrina Kostitsyna, Bahram Kouhestani, Stefan Langerman, David Rappaport. [doi]
• Computational Complexity of the Interleaving DistanceHåvard Bakke Bjerkevik, Magnus Bakke Botnan. [doi]
• Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional SpacesTimothy Carpenter, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Anastasios Sidiropoulos. [doi]
• The Trisection Genus of Standard Simply Connected PL 4-ManifoldsJonathan Spreer, Stephan Tillmann. [doi]
• Realizations of Indecomposable Persistence Modules of Arbitrarily Large DimensionMickaël Buchet, Emerson G. Escolar. [doi]
• Discrete Stratified Morse Theory: A User's GuideKevin P. Knudson, Bei Wang. [doi]
• Embedding Graphs into Two-Dimensional Simplicial ComplexesÉric Colin de Verdière, Thomas Magnard, Bojan Mohar. [doi]
• Random Walks on Polytopes of Constant CorankMalte Milatz. [doi]
• A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram of Points in a Simple PolygonChih-Hung Liu. [doi]
• Dynamic Smooth Compressed QuadtreesIvor van der Hoog, Elena Khramtcova, Maarten Löffler. [doi]
• Orthogonal Terrain Guarding is NP-completeÉdouard Bonnet, Panos Giannopoulos. [doi]
• Coloring Intersection Hypergraphs of Pseudo-DisksBalázs Keszegh. [doi]
• Near-Optimal Coresets of Kernel Density EstimatesJeff M. Phillips, Wai Ming Tai. [doi]
• Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded StretchErik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Christian Scheffer, Henk Meijer. [doi]
• The Z_2-Genus of Kuratowski MinorsRadoslav Fulek, Jan Kyncl. [doi]
• Optimality of Geometric Local SearchBruno Jartoux, Nabil H. Mustafa. [doi]
• Edge-Unfolding Nearly Flat Convex CapsJoseph O'Rourke. [doi]
• Point Location in Dynamic Planar SubdivisionsEunjin Oh 0001, Hee-Kap Ahn. [doi]
• Optimal Morphs of Planar Orthogonal DrawingsArthur van Goethem, Kevin Verbeek. [doi]
• Smallest Enclosing Spheres and Chernoff Points in BregmanGeometryHerbert Edelsbrunner, Ziga Virk, Hubert Wagner. [doi]
• Shellability is NP-CompleteXavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner 0001. [doi]
• Sheaf-Theoretic Stratification LearningAdam Brown, Bei Wang. [doi]
• Structure and Generation of Crossing-Critical GraphsZdenek Dvorák, Petr Hlinený, Bojan Mohar. [doi]
• O~(n^{1/3})-Space Algorithm for the Grid Graph Reachability ProblemRyo Ashida, Kotaro Nakagawa. [doi]
• Almost All String Graphs are Intersection Graphs of Plane Convex SetsJános Pach, Bruce Reed, Yelena Yuditsky. [doi]
• Geometric Realizations of the 3D Associahedron (Multimedia Exposition)Satyan L. Devadoss, Daniel D. Johnson, Justin Lee, Jackson Warley. [doi]
• Approximate Range Queries for ClusteringEunjin Oh 0001, Hee-Kap Ahn. [doi]
• On the Complexity of Closest Pair via Polar-Pair of Point-SetsRoee David, Karthik C. S., Bundit Laekhanukit. [doi]
• The Reach, Metric Distortion, Geodesic Convexity and the Variation of Tangent SpacesJean-Daniel Boissonnat, André Lieutier, Mathijs Wintraecken. [doi]
• A Crossing Lemma for MultigraphsJános Pach, Géza Tóth. [doi]