15th Scandinavian Symposium and Workshops on Algorithm Theory : SWAT 2016, June 22-24, 2016, Reykjavik, Iceland (English)
Free access
- New search for: Scandinavian Symposium and Workshops on Algorithm Theory
- New search for: Pagh, Rasmus
- New search for: Scandinavian Symposium and Workshops on Algorithm Theory
2016
-
ISBN:
- Conference Proceedings / Electronic Resource
-
Title:15th Scandinavian Symposium and Workshops on Algorithm Theory : SWAT 2016, June 22-24, 2016, Reykjavik, Iceland
-
Additional title:SWAT 2016
-
Contributors:Pagh, Rasmus ( editor ) / Scandinavian Symposium and Workshops on Algorithm Theory ( author )
-
Conference:Scandinavian Symposium and Workshops on Algorithm Theory ; 15 ; 2016 ; Reykjavik
SWAT ; 15 ; 2016 ; Reykjavik -
Published in:
-
Publisher:
-
Place of publication:Saarbrücken/Wadern, Germany
-
Publication date:2016
-
Size:1 Online-Ressource (425 Seiten in verschiedenen Seitenzählungen)
-
Remarks:Illustrationen
Literaturangaben
Digital preservation by Technische Informationsbibliothek (TIB) / Leibniz-Informationszentrum Technik und Naturwissenschaften und Universitätsbibliothek -
ISBN:
-
DOI:
-
Type of media:Conference Proceedings
-
Type of material:Electronic Resource
-
Language:English
- New search for: 00B25 / 68Wxx / *68-06
- Further information on Mathematics Subject Classification
- New search for: 54.10 / 31.12
- Further information on Basic classification
-
Keywords:
-
Classification:
-
Licence:
-
Source:
Table of contents conference proceedings
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Approximating Connected Facility Location with Lower and Upper Bounds via LP RoundingFriggstad, Zachary / Rezapour, Mohsen / Salavatipour, Mohammad R. et al. | 2016
- 2
-
Approximation Algorithms for Node-Weighted Prize-Collecting Steiner Tree Problems on Planar GraphsByrka, Jaroslaw / Lewandowski, Mateusz / Moldenhauer, Carsten et al. | 2016
- 3
-
A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite GraphsFriggstad, Zachary / Könemann, Jochen / Shadravan, Mohammad et al. | 2016
- 4
-
A Linear Kernel for Finding Square Roots of Almost Planar GraphsGolovach, Petr A. / Kratsch, Dieter / Paulusma, Daniël / Stewart, Anthony et al. | 2016
- 5
-
Linear-Time Recognition of Map Graphs with Outerplanar WitnessMnich, Matthias / Rutter, Ignaz / Schmidt, Jens M. et al. | 2016
- 6
-
The p-Center Problem in Tree Networks RevisitedBanik, Aritra / Bhattacharya, Binay / Das, Sandip / Kameda, Tsunehiko / Song, Zhao et al. | 2016
- 7
-
A Simple Mergeable DictionaryKarczmarz, Adam et al. | 2016
- 8
-
Cuckoo Filter: Simplification and AnalysisEppstein, David et al. | 2016
- 9
-
Randomized Algorithms for Finding a Majority ElementGawrychowski, Pawel / Suomela, Jukka / Uznanski, Przemyslaw et al. | 2016
- 10
-
A Framework for Dynamic Parameterized Dictionary MatchingGanguly, Arnab / Hon, Wing-Kai / Shah, Rahul et al. | 2016
- 11
-
Efficient Summing over Sliding WindowsBen Basat, Ran / Einziger, Gil / Friedman, Roy / Kassner, Yaron et al. | 2016
- 12
-
Lower Bounds for Approximation Schemes for Closest StringCygan, Marek / Lokshtanov, Daniel / Pilipczuk, Marcin / Pilipczuk, Michal / Saurabh, Saket et al. | 2016
- 13
-
Coloring Graphs Having Few Colorings Over Path DecompositionsBjörklund, Andreas et al. | 2016
- 14
-
Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable GraphsKanj, Iyad / Komusiewicz, Christian / Sorge, Manuel / Jan van Leeuwen, Erik et al. | 2016
- 15
-
On Routing Disjoint Paths in Bounded Treewidth GraphsEne, Alina / Mnich, Matthias / Pilipczuk, Marcin / Risteski, Andrej et al. | 2016
- 16
-
Colouring Diamond-free GraphsDabrowski, Konrad K. / Dross, François / Paulusma, Daniël et al. | 2016
- 17
-
Below All Subsets for Some Permutational Counting ProblemsBjörklund, Andreas et al. | 2016
- 18
-
Extension Complexity, MSO Logic, and TreewidthKolman, Petr / Koutecký, Martin / Tiwary, Hans Raj et al. | 2016
- 19
-
Optimal Online Escape Path Against a CertificateLangetepe, Elmar / Kübel, David et al. | 2016
- 20
-
Lagrangian Duality based Algorithms in Online Energy-Efficient SchedulingKim Thang, Nguyen et al. | 2016
- 21
-
Online Dominating SetBoyar, Joan / Eidenbenz, Stephan J. / Favrholdt, Lene M. / Kotrbcik, Michal / Larsen, Kim S. et al. | 2016
- 22
-
Sorting Under Forbidden ComparisonsBanerjee, Indranil / Richards, Dana et al. | 2016
- 23
-
Total Stability in Stable Matching GamesGupta, Sushmita / Iwama, Kazuo / Miyazaki, Shuichi et al. | 2016
- 24
-
Estimating The Makespan of The Two-Valued Restricted Assignment ProblemJansen, Klaus / Land, Kati / Maack, Marten et al. | 2016
- 25
-
A Plane 1.88-Spanner for Points in Convex PositionAmani, Mahdi / Biniaz, Ahmad / Bose, Prosenjit / De Carufel, Jean-Lou / Maheshwari, Anil / Smid, Michiel et al. | 2016
- 26
-
Approximating the Integral Fréchet DistanceMaheshwari, Anil / Sack, Jörg-Rüdiger / Scheffer, Christian et al. | 2016
- 27
-
Minimizing the Continuous Diameter when Augmenting Paths and Cycles with ShortcutsDe Carufel, Jean-Lou / Grimm, Carsten / Maheshwari, Anil / Smid, Michiel et al. | 2016
- 28
-
A Clustering-Based Approach to Kinetic Closest PairChan, Timothy M. / Rahmati, Zahed et al. | 2016
- 29
-
Constrained Geodesic Centers of a Simple PolygonOh, Eunjin / Son, Wanbin / Ahn, Hee-Kap et al. | 2016
- 30
-
Time-Space Trade-offs for Triangulating a Simple PolygonAronov, Boris / Korman, Matias / Pratt, Simon / van Renssen, André / Roeloffzen, Marcel et al. | 2016
- 31
-
Excluded Grid Theorem: Improved and Simplified (Invited Talk)Chuzhoy, Julia et al. | 2016
- 32
-
The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems (Invited Talk)Marx, Dániel et al. | 2016
- 33
-
Computation as a Scientific Weltanschauung (Invited Talk)Papadimitriou, Christos H. et al. | 2016