LIPIcs, Volume 53, SWAT 2016

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