default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID15th SWAT 2016: Reykjavik, Iceland
- Rasmus Pagh:
15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, June 22-24, 2016, Reykjavik, Iceland. LIPIcs 53, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-011-8 - Front Matter, Table of Contents, Preface, Program Committee, Subreviewers. 0:i-0:xiv
- Zachary Friggstad, Mohsen Rezapour
, Mohammad R. Salavatipour:
Approximating Connected Facility Location with Lower and Upper Bounds via LP Rounding. 1:1-1:14 - Jaroslaw Byrka, Mateusz Lewandowski, Carsten Moldenhauer:
Approximation Algorithms for Node-Weighted Prize-Collecting Steiner Tree Problems on Planar Graphs. 2:1-2:14 - Zachary Friggstad, Jochen Könemann, Mohammad Shadravan:
A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs . 3:1-3:11 - Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart:
A Linear Kernel for Finding Square Roots of Almost Planar Graphs. 4:1-4:14 - Matthias Mnich, Ignaz Rutter, Jens M. Schmidt:
Linear-Time Recognition of Map Graphs with Outerplanar Witness. 5:1-5:14 - Aritra Banik, Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Zhao Song:
The p-Center Problem in Tree Networks Revisited. 6:1-6:15 - Adam Karczmarz:
A Simple Mergeable Dictionary. 7:1-7:13 - David Eppstein:
Cuckoo Filter: Simplification and Analysis. 8:1-8:12 - Pawel Gawrychowski, Jukka Suomela, Przemyslaw Uznanski:
Randomized Algorithms for Finding a Majority Element. 9:1-9:14 - Arnab Ganguly, Wing-Kai Hon, Rahul Shah:
A Framework for Dynamic Parameterized Dictionary Matching. 10:1-10:14 - Ran Ben-Basat, Gil Einziger, Roy Friedman, Yaron Kassner:
Efficient Summing over Sliding Windows. 11:1-11:14 - Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Lower Bounds for Approximation Schemes for Closest String. 12:1-12:10 - Andreas Björklund:
Coloring Graphs Having Few Colorings Over Path Decompositions. 13:1-13:9 - Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen:
Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs. 14:1-14:14 - Alina Ene, Matthias Mnich, Marcin Pilipczuk, Andrej Risteski:
On Routing Disjoint Paths in Bounded Treewidth Graphs. 15:1-15:15 - Konrad K. Dabrowski, François Dross, Daniël Paulusma:
Colouring Diamond-free Graphs. 16:1-16:14 - Andreas Björklund:
Below All Subsets for Some Permutational Counting Problems . 17:1-17:11 - Petr Kolman, Martin Koutecký, Hans Raj Tiwary:
Extension Complexity, MSO Logic, and Treewidth . 18:1-18:14 - Elmar Langetepe, David Kübel:
Optimal Online Escape Path Against a Certificate. 19:1-19:14 - Kim Thang Nguyen:
Lagrangian Duality based Algorithms in Online Energy-Efficient Scheduling. 20:1-20:14 - Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen:
Online Dominating Set. 21:1-21:15 - Indranil Banerjee, Dana S. Richards:
Sorting Under Forbidden Comparisons. 22:1-22:13 - Sushmita Gupta, Kazuo Iwama, Shuichi Miyazaki:
Total Stability in Stable Matching Games. 23:1-23:12 - Klaus Jansen, Kati Land, Marten Maack:
Estimating The Makespan of The Two-Valued Restricted Assignment Problem. 24:1-24:13 - Mahdi Amani, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid:
A Plane 1.88-Spanner for Points in Convex Position. 25:1-25:14 - Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer:
Approximating the Integral Fréchet Distance. 26:1-26:14 - Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts. 27:1-27:14 - Timothy M. Chan, Zahed Rahmati:
A Clustering-Based Approach to Kinetic Closest Pair. 28:1-28:13 - Eunjin Oh, Wanbin Son, Hee-Kap Ahn:
Constrained Geodesic Centers of a Simple Polygon. 29:1-29:13 - Boris Aronov, Matias Korman, Simon Pratt, André van Renssen, Marcel Roeloffzen:
Time-Space Trade-offs for Triangulating a Simple Polygon. 30:1-30:12 - Julia Chuzhoy:
Excluded Grid Theorem: Improved and Simplified (Invited Talk). 31:1-31:1 - Dániel Marx:
The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems (Invited Talk). 32:1-32:1 - Christos H. Papadimitriou:
Computation as a Scientific Weltanschauung (Invited Talk). 33:1-33:1
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-10-31 01:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
