Table of Contents

• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Online Embedding of MetricsIlan Newman, Yuri Rabinovich. [doi]
• Exact Exponential Algorithms for Two Poset ProblemsLászló Kozma 0002. [doi]
• A Dynamic Space-Efficient Filter with Constant Time OperationsIoana O. Bercea, Guy Even. [doi]
• Parameter Analysis for Guarding TerrainsAkanksha Agrawal, Sudeshna Kolay, Meirav Zehavi. [doi]
• Graph Realizations: Maximum Degree in Vertex NeighborhoodsAmotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz. [doi]
• Preprocessing Vertex-Deletion Problems: Characterizing Graph Properties by Low-Rank AdjacenciesBart M. P. Jansen, Jari J. H. de Kroon. [doi]
• Submodular Clustering in Low DimensionsArturs Backurs, Sariel Har-Peled. [doi]
• Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree GraphsNiels Grüttemeier, Christian Komusiewicz, Nils Morawietz. [doi]
• Preclustering Algorithms for Imprecise PointsMohammad Ali Abam, Mark de Berg, Sina Farahzad, Mir Omid Haji Mirsadeghi, Morteza Saghafian. [doi]
• Primal-Dual 2-Approximation Algorithm for the Monotonic Multiple Depot Heterogeneous Traveling Salesman ProblemSivakumar Rathinam, R. Ravi 0001, J. Bae, Kaarthik Sundar. [doi]
• Clustering Moving Entities in Euclidean SpaceStephane Durocher, Md Yeakub Hassan. [doi]
• Computing β-Stretch Paths in Drawings of GraphsEsther M. Arkin, Faryad Darabi Sahneh, Alon Efrat, Fabian Frank, Radoslav Fulek, Stephen G. Kobourov, Joseph S. B. Mitchell. [doi]
• Low-Stretch Spanning Trees of Graphs with Bounded WidthGlencora Borradaile, Erin Wolf Chambers, David Eppstein, William Maxwell, Amir Nayyeri. [doi]
• A Simple Algorithm for Minimum Cuts in Near-Linear TimeNalin Bhardwaj, Antonio Molina Lovett, Bryce Sandlund. [doi]
• Locality Sensitive Hashing for Set-Queries, Motivated by Group RecommendationsHaim Kaplan, Jay Tenenbaum. [doi]
• Bounded-Angle Minimum Spanning TreesAhmad Biniaz, Prosenjit Bose, Anna Lubiw, Anil Maheshwari. [doi]
• Trajectory VisibilityPatrick Eades, Ivor van der Hoog, Maarten Löffler, Frank Staals. [doi]
• Sea-Rise Flooding on Massive Dynamic TerrainsLars Arge, Mathias Rav, Morten Revsbæk, Yujin Shin, Jungwoo Yang. [doi]
• Parameterized Complexity of PCA (Invited Talk)Fedor V. Fomin, Petr A. Golovach, Kirill Simonov. [doi]
• Optimal Randomized Group Testing Algorithm to Determine the Number of DefectivesNader H. Bshouty, Catherine A. Haddad-Zaknoon, Raghd Boulos, Foad Moalem, Jalal Nada, Elias Noufi, Yara Zaknoon. [doi]
• Quantum Algorithm for Finding the Optimal Variable Ordering for Binary Decision DiagramsSeiichiro Tani. [doi]
• Landscape of Locality (Invited Talk)Jukka Suomela. [doi]
• Parameterized Complexity of Two-Interval Pattern ProblemProsenjit Bose, Saeed Mehrabi 0001, Debajyoti Mondal. [doi]
• Fast Multi-Subset Transform and Weighted Sums over Acyclic DigraphsMikko Koivisto, Antti Röyskö. [doi]
• Parameterized Study of Steiner Tree on Unit Disk GraphsSujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi. [doi]
• Space-Efficient Data Structures for LatticesJ. Ian Munro, Bryce Sandlund, Corwin Sinnamon. [doi]
• Simplification of Polyline BundlesJoachim Spoerhase, Sabine Storandt, Johannes Zink. [doi]
• Recoloring Interval Graphs with Limited Recourse BudgetBartlomiej Bosek, Yann Disser, Andreas Emil Feldmann, Jakub Pawlewicz, Anna Zych-Pawlewicz. [doi]
• On the Parameterized Complexity of Grid ContractionSaket Saurabh 0001, Uéverton dos Santos Souza, Prafullkumar Tale. [doi]
• Sparse Regression via Range CountingJean Cardinal, Aurélien Ooms. [doi]
• On the Hardness of Computing an Average CurveKevin Buchin, Anne Driemel, Martijn Struijs. [doi]
• Vertex Downgrading to Minimize ConnectivityHassene Aissi, Da Qi Chen, R. Ravi 0001. [doi]
• Simplifying Activity-On-Edge GraphsDavid Eppstein, Daniel Frishberg, Elham Havvaei. [doi]
• Kernelizing the Hitting Set Problem in Linear Sequential and Constant Parallel TimeMax Bannach, Malte Skambath, Till Tantau. [doi]
• Drawing Graphs with Circular Arcs and Right-Angle CrossingsSteven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff 0001. [doi]
• Generalized Metric Repair on GraphsChenglin Fan, Anna C. Gilbert, Benjamin Raichel, Rishi Sonthalia, Gregory Van Buskirk. [doi]