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