<h2>LIPIcs, Volume 53, SWAT 2016</h2>
<ul>
<li>
<span class="authors">Rasmus Pagh</span>
<span class="title">LIPIcs, Volume 53, SWAT'16, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016">10.4230/LIPIcs.SWAT.2016</a>
</li>
<li>
<span class="authors">Rasmus Pagh</span>
<span class="title">Front Matter, Table of Contents, Preface, Program Committee, Subreviewers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.0">10.4230/LIPIcs.SWAT.2016.0</a>
</li>
<li>
<span class="authors">Zachary Friggstad, Mohsen Rezapour, and Mohammad R. Salavatipour</span>
<span class="title">Approximating Connected Facility Location with Lower and Upper Bounds via LP Rounding</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.1">10.4230/LIPIcs.SWAT.2016.1</a>
</li>
<li>
<span class="authors">Jaroslaw Byrka, Mateusz Lewandowski, and Carsten Moldenhauer</span>
<span class="title">Approximation Algorithms for Node-Weighted Prize-Collecting Steiner Tree Problems on Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.2">10.4230/LIPIcs.SWAT.2016.2</a>
</li>
<li>
<span class="authors">Zachary Friggstad, Jochen Könemann, and Mohammad Shadravan</span>
<span class="title">A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.3">10.4230/LIPIcs.SWAT.2016.3</a>
</li>
<li>
<span class="authors">Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, and Anthony Stewart</span>
<span class="title">A Linear Kernel for Finding Square Roots of Almost Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.4">10.4230/LIPIcs.SWAT.2016.4</a>
</li>
<li>
<span class="authors">Matthias Mnich, Ignaz Rutter, and Jens M. Schmidt</span>
<span class="title">Linear-Time Recognition of Map Graphs with Outerplanar Witness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.5">10.4230/LIPIcs.SWAT.2016.5</a>
</li>
<li>
<span class="authors">Aritra Banik, Binay Bhattacharya, Sandip Das, Tsunehiko Kameda, and Zhao Song</span>
<span class="title">The p-Center Problem in Tree Networks Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.6">10.4230/LIPIcs.SWAT.2016.6</a>
</li>
<li>
<span class="authors">Adam Karczmarz</span>
<span class="title">A Simple Mergeable Dictionary</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.7">10.4230/LIPIcs.SWAT.2016.7</a>
</li>
<li>
<span class="authors">David Eppstein</span>
<span class="title">Cuckoo Filter: Simplification and Analysis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.8">10.4230/LIPIcs.SWAT.2016.8</a>
</li>
<li>
<span class="authors">Pawel Gawrychowski, Jukka Suomela, and Przemyslaw Uznanski</span>
<span class="title">Randomized Algorithms for Finding a Majority Element</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.9">10.4230/LIPIcs.SWAT.2016.9</a>
</li>
<li>
<span class="authors">Arnab Ganguly, Wing-Kai Hon, and Rahul Shah</span>
<span class="title">A Framework for Dynamic Parameterized Dictionary Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.10">10.4230/LIPIcs.SWAT.2016.10</a>
</li>
<li>
<span class="authors">Ran Ben Basat, Gil Einziger, Roy Friedman, and Yaron Kassner</span>
<span class="title">Efficient Summing over Sliding Windows</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.11">10.4230/LIPIcs.SWAT.2016.11</a>
</li>
<li>
<span class="authors">Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh</span>
<span class="title">Lower Bounds for Approximation Schemes for Closest String</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.12">10.4230/LIPIcs.SWAT.2016.12</a>
</li>
<li>
<span class="authors">Andreas Björklund</span>
<span class="title">Coloring Graphs Having Few Colorings Over Path Decompositions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.13">10.4230/LIPIcs.SWAT.2016.13</a>
</li>
<li>
<span class="authors">Iyad Kanj, Christian Komusiewicz, Manuel Sorge, and Erik Jan van Leeuwen</span>
<span class="title">Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.14">10.4230/LIPIcs.SWAT.2016.14</a>
</li>
<li>
<span class="authors">Alina Ene, Matthias Mnich, Marcin Pilipczuk, and Andrej Risteski</span>
<span class="title">On Routing Disjoint Paths in Bounded Treewidth Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.15">10.4230/LIPIcs.SWAT.2016.15</a>
</li>
<li>
<span class="authors">Konrad K. Dabrowski, François Dross, and Daniël Paulusma</span>
<span class="title">Colouring Diamond-free Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.16">10.4230/LIPIcs.SWAT.2016.16</a>
</li>
<li>
<span class="authors">Andreas Björklund</span>
<span class="title">Below All Subsets for Some Permutational Counting Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.17">10.4230/LIPIcs.SWAT.2016.17</a>
</li>
<li>
<span class="authors">Petr Kolman, Martin Koutecký, and Hans Raj Tiwary</span>
<span class="title">Extension Complexity, MSO Logic, and Treewidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.18">10.4230/LIPIcs.SWAT.2016.18</a>
</li>
<li>
<span class="authors">Elmar Langetepe and David Kübel</span>
<span class="title">Optimal Online Escape Path Against a Certificate</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.19">10.4230/LIPIcs.SWAT.2016.19</a>
</li>
<li>
<span class="authors">Nguyen Kim Thang</span>
<span class="title">Lagrangian Duality based Algorithms in Online Energy-Efficient Scheduling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.20">10.4230/LIPIcs.SWAT.2016.20</a>
</li>
<li>
<span class="authors">Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcik, and Kim S. Larsen</span>
<span class="title">Online Dominating Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.21">10.4230/LIPIcs.SWAT.2016.21</a>
</li>
<li>
<span class="authors">Indranil Banerjee and Dana Richards</span>
<span class="title">Sorting Under Forbidden Comparisons</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.22">10.4230/LIPIcs.SWAT.2016.22</a>
</li>
<li>
<span class="authors">Sushmita Gupta, Kazuo Iwama, and Shuichi Miyazaki</span>
<span class="title">Total Stability in Stable Matching Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.23">10.4230/LIPIcs.SWAT.2016.23</a>
</li>
<li>
<span class="authors">Klaus Jansen, Kati Land, and Marten Maack</span>
<span class="title">Estimating The Makespan of The Two-Valued Restricted Assignment Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.24">10.4230/LIPIcs.SWAT.2016.24</a>
</li>
<li>
<span class="authors">Mahdi Amani, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, and Michiel Smid</span>
<span class="title">A Plane 1.88-Spanner for Points in Convex Position</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.25">10.4230/LIPIcs.SWAT.2016.25</a>
</li>
<li>
<span class="authors">Anil Maheshwari, Jörg-Rüdiger Sack, and Christian Scheffer</span>
<span class="title">Approximating the Integral Fréchet Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.26">10.4230/LIPIcs.SWAT.2016.26</a>
</li>
<li>
<span class="authors">Timothy M. Chan and Zahed Rahmati</span>
<span class="title">A Clustering-Based Approach to Kinetic Closest Pair</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.28">10.4230/LIPIcs.SWAT.2016.28</a>
</li>
<li>
<span class="authors">Eunjin Oh, Wanbin Son, and Hee-Kap Ahn</span>
<span class="title">Constrained Geodesic Centers of a Simple Polygon</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.29">10.4230/LIPIcs.SWAT.2016.29</a>
</li>
<li>
<span class="authors">Boris Aronov, Matias Korman, Simon Pratt, André van Renssen, and Marcel Roeloffzen</span>
<span class="title">Time-Space Trade-offs for Triangulating a Simple Polygon</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.30">10.4230/LIPIcs.SWAT.2016.30</a>
</li>
<li>
<span class="authors">Julia Chuzhoy</span>
<span class="title">Excluded Grid Theorem: Improved and Simplified (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.31">10.4230/LIPIcs.SWAT.2016.31</a>
</li>
<li>
<span class="authors">Dániel Marx</span>
<span class="title">The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.32">10.4230/LIPIcs.SWAT.2016.32</a>
</li>
<li>
<span class="authors">Christos H. Papadimitriou</span>
<span class="title">Computation as a Scientific Weltanschauung (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.33">10.4230/LIPIcs.SWAT.2016.33</a>
</li>
<li>
<span class="authors">Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, and Michiel Smid</span>
<span class="title">Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2016.27">10.4230/LIPIcs.SWAT.2016.27</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