LIPIcs, Volume 162, SWAT 2020

• Susanne Albers LIPIcs, Volume 162, SWAT 2020, Complete Volume 10.4230/LIPIcs.SWAT.2020
• Susanne Albers Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.SWAT.2020.0
• Fedor V. Fomin, Petr A. Golovach, and Kirill Simonov Parameterized Complexity of PCA (Invited Talk) 10.4230/LIPIcs.SWAT.2020.1
• Jukka Suomela Landscape of Locality (Invited Talk) 10.4230/LIPIcs.SWAT.2020.2
• Mohammad Ali Abam, Mark de Berg, Sina Farahzad, Mir Omid Haji Mirsadeghi, and Morteza Saghafian Preclustering Algorithms for Imprecise Points 10.4230/LIPIcs.SWAT.2020.3
• Akanksha Agrawal, Sudeshna Kolay, and Meirav Zehavi Parameter Analysis for Guarding Terrains 10.4230/LIPIcs.SWAT.2020.4
• Hassene Aissi, Da Qi Chen, and R. Ravi Vertex Downgrading to Minimize Connectivity 10.4230/LIPIcs.SWAT.2020.5
• Lars Arge, Mathias Rav, Morten Revsbæk, Yujin Shin, and Jungwoo Yang Sea-Rise Flooding on Massive Dynamic Terrains 10.4230/LIPIcs.SWAT.2020.6
• Esther M. Arkin, Faryad Darabi Sahneh, Alon Efrat, Fabian Frank, Radoslav Fulek, Stephen Kobourov, and Joseph S. B. Mitchell Computing β-Stretch Paths in Drawings of Graphs 10.4230/LIPIcs.SWAT.2020.7
• Arturs Backurs and Sariel Har-Peled Submodular Clustering in Low Dimensions 10.4230/LIPIcs.SWAT.2020.8
• Max Bannach, Malte Skambath, and Till Tantau Kernelizing the Hitting Set Problem in Linear Sequential and Constant Parallel Time 10.4230/LIPIcs.SWAT.2020.9
• Amotz Bar-Noy, Keerti Choudhary, David Peleg, and Dror Rawitz Graph Realizations: Maximum Degree in Vertex Neighborhoods 10.4230/LIPIcs.SWAT.2020.10
• Ioana O. Bercea and Guy Even A Dynamic Space-Efficient Filter with Constant Time Operations 10.4230/LIPIcs.SWAT.2020.11
• Nalin Bhardwaj, Antonio J. Molina Lovett, and Bryce Sandlund A Simple Algorithm for Minimum Cuts in Near-Linear Time 10.4230/LIPIcs.SWAT.2020.12
• Sujoy Bhore, Paz Carmi, Sudeshna Kolay, and Meirav Zehavi Parameterized Study of Steiner Tree on Unit Disk Graphs 10.4230/LIPIcs.SWAT.2020.13
• Ahmad Biniaz, Prosenjit Bose, Anna Lubiw, and Anil Maheshwari Bounded-Angle Minimum Spanning Trees 10.4230/LIPIcs.SWAT.2020.14
• Glencora Borradaile, Erin Wolf Chambers, David Eppstein, William Maxwell, and Amir Nayyeri Low-Stretch Spanning Trees of Graphs with Bounded Width 10.4230/LIPIcs.SWAT.2020.15
• Prosenjit Bose, Saeed Mehrabi, and Debajyoti Mondal Parameterized Complexity of Two-Interval Pattern Problem 10.4230/LIPIcs.SWAT.2020.16
• Bartłomiej Bosek, Yann Disser, Andreas Emil Feldmann, Jakub Pawlewicz, and Anna Zych-Pawlewicz Recoloring Interval Graphs with Limited Recourse Budget 10.4230/LIPIcs.SWAT.2020.17
• Nader H. Bshouty, Catherine A. Haddad-Zaknoon, Raghd Boulos, Foad Moalem, Jalal Nada, Elias Noufi, and Yara Zaknoon Optimal Randomized Group Testing Algorithm to Determine the Number of Defectives 10.4230/LIPIcs.SWAT.2020.18
• Kevin Buchin, Anne Driemel, and Martijn Struijs On the Hardness of Computing an Average Curve 10.4230/LIPIcs.SWAT.2020.19
• Jean Cardinal and Aurélien Ooms Sparse Regression via Range Counting 10.4230/LIPIcs.SWAT.2020.20
• Steven Chaplick, Henry Förster, Myroslav Kryven, and Alexander Wolff Drawing Graphs with Circular Arcs and Right-Angle Crossings 10.4230/LIPIcs.SWAT.2020.21
• Stephane Durocher and Md Yeakub Hassan Clustering Moving Entities in Euclidean Space 10.4230/LIPIcs.SWAT.2020.22
• Patrick Eades, Ivor van der Hoog, Maarten Löffler, and Frank Staals Trajectory Visibility 10.4230/LIPIcs.SWAT.2020.23
• David Eppstein, Daniel Frishberg, and Elham Havvaei Simplifying Activity-On-Edge Graphs 10.4230/LIPIcs.SWAT.2020.24
• Chenglin Fan, Anna C. Gilbert, Benjamin Raichel, Rishi Sonthalia, and Gregory Van Buskirk Generalized Metric Repair on Graphs 10.4230/LIPIcs.SWAT.2020.25
• Niels Grüttemeier, Christian Komusiewicz, and Nils Morawietz Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs 10.4230/LIPIcs.SWAT.2020.26
• Bart M. P. Jansen and Jari J. H. de Kroon Preprocessing Vertex-Deletion Problems: Characterizing Graph Properties by Low-Rank Adjacencies 10.4230/LIPIcs.SWAT.2020.27
• Haim Kaplan and Jay Tenenbaum Locality Sensitive Hashing for Set-Queries, Motivated by Group Recommendations 10.4230/LIPIcs.SWAT.2020.28
• Mikko Koivisto and Antti Röyskö Fast Multi-Subset Transform and Weighted Sums over Acyclic Digraphs 10.4230/LIPIcs.SWAT.2020.29
• László Kozma Exact Exponential Algorithms for Two Poset Problems 10.4230/LIPIcs.SWAT.2020.30
• J. Ian Munro, Bryce Sandlund, and Corwin Sinnamon Space-Efficient Data Structures for Lattices 10.4230/LIPIcs.SWAT.2020.31
• Ilan Newman and Yuri Rabinovich Online Embedding of Metrics 10.4230/LIPIcs.SWAT.2020.32
• S. Rathinam, R. Ravi, J. Bae, and K. Sundar Primal-Dual 2-Approximation Algorithm for the Monotonic Multiple Depot Heterogeneous Traveling Salesman Problem 10.4230/LIPIcs.SWAT.2020.33
• Saket Saurabh, Uéverton dos Santos Souza, and Prafullkumar Tale On the Parameterized Complexity of Grid Contraction 10.4230/LIPIcs.SWAT.2020.34
• Joachim Spoerhase, Sabine Storandt, and Johannes Zink Simplification of Polyline Bundles 10.4230/LIPIcs.SWAT.2020.35
• Seiichiro Tani Quantum Algorithm for Finding the Optimal Variable Ordering for Binary Decision Diagrams 10.4230/LIPIcs.SWAT.2020.36