@Proceedings{pagh:LIPIcs.SWAT.2016,
title = {{LIPIcs, Volume 53, SWAT'16, Complete Volume}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016},
URN = {urn:nbn:de:0030-drops-60601},
doi = {10.4230/LIPIcs.SWAT.2016},
annote = {Keywords: Theory of Computation}
}
@InProceedings{pagh:LIPIcs.SWAT.2016.0,
author = {Pagh, Rasmus},
title = {{Front Matter, Table of Contents, Preface, Program Committee, Subreviewers}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {0:i--0:xiv},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.0},
URN = {urn:nbn:de:0030-drops-60229},
doi = {10.4230/LIPIcs.SWAT.2016.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Program Committee, Subreviewers}
}
@InProceedings{friggstad_et_al:LIPIcs.SWAT.2016.1,
author = {Friggstad, Zachary and Rezapour, Mohsen and Salavatipour, Mohammad R.},
title = {{Approximating Connected Facility Location with Lower and Upper Bounds via LP Rounding}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {1:1--1:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.1},
URN = {urn:nbn:de:0030-drops-60302},
doi = {10.4230/LIPIcs.SWAT.2016.1},
annote = {Keywords: Facility Location, Approximation Algorithm, LP Rounding}
}
@InProceedings{byrka_et_al:LIPIcs.SWAT.2016.2,
author = {Byrka, Jaroslaw and Lewandowski, Mateusz and Moldenhauer, Carsten},
title = {{Approximation Algorithms for Node-Weighted Prize-Collecting Steiner Tree Problems on Planar Graphs}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {2:1--2:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.2},
URN = {urn:nbn:de:0030-drops-60313},
doi = {10.4230/LIPIcs.SWAT.2016.2},
annote = {Keywords: approximation algorithms, Node-Weighted Steiner Tree, primal-dual algorithm, LMP, planar graphs}
}
@InProceedings{friggstad_et_al:LIPIcs.SWAT.2016.3,
author = {Friggstad, Zachary and K\"{o}nemann, Jochen and Shadravan, Mohammad},
title = {{A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {3:1--3:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.3},
URN = {urn:nbn:de:0030-drops-60323},
doi = {10.4230/LIPIcs.SWAT.2016.3},
annote = {Keywords: Approximation algorithm, Primal-Dual algorithm, Directed Steiner tree}
}
@InProceedings{golovach_et_al:LIPIcs.SWAT.2016.4,
author = {Golovach, Petr A. and Kratsch, Dieter and Paulusma, Dani\"{e}l and Stewart, Anthony},
title = {{A Linear Kernel for Finding Square Roots of Almost Planar Graphs}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {4:1--4:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.4},
URN = {urn:nbn:de:0030-drops-60333},
doi = {10.4230/LIPIcs.SWAT.2016.4},
annote = {Keywords: planar graphs, square roots, linear kernel}
}
@InProceedings{mnich_et_al:LIPIcs.SWAT.2016.5,
author = {Mnich, Matthias and Rutter, Ignaz and Schmidt, Jens M.},
title = {{Linear-Time Recognition of Map Graphs with Outerplanar Witness}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {5:1--5:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.5},
URN = {urn:nbn:de:0030-drops-60349},
doi = {10.4230/LIPIcs.SWAT.2016.5},
annote = {Keywords: Algorithms and data structures, map graphs, recognition, planar graphs}
}
@InProceedings{banik_et_al:LIPIcs.SWAT.2016.6,
author = {Banik, Aritra and Bhattacharya, Binay and Das, Sandip and Kameda, Tsunehiko and Song, Zhao},
title = {{The p-Center Problem in Tree Networks Revisited}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {6:1--6:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.6},
URN = {urn:nbn:de:0030-drops-60296},
doi = {10.4230/LIPIcs.SWAT.2016.6},
annote = {Keywords: Facility location, p-center, parametric search, tree network, sorting network}
}
@InProceedings{karczmarz:LIPIcs.SWAT.2016.7,
author = {Karczmarz, Adam},
title = {{A Simple Mergeable Dictionary}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {7:1--7:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.7},
URN = {urn:nbn:de:0030-drops-60285},
doi = {10.4230/LIPIcs.SWAT.2016.7},
annote = {Keywords: dictionary, mergeable, data structure, merge, split}
}
@InProceedings{eppstein:LIPIcs.SWAT.2016.8,
author = {Eppstein, David},
title = {{Cuckoo Filter: Simplification and Analysis}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {8:1--8:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.8},
URN = {urn:nbn:de:0030-drops-60264},
doi = {10.4230/LIPIcs.SWAT.2016.8},
annote = {Keywords: approximate set, Bloom filter, cuckoo filter, cuckoo hashing}
}
@InProceedings{gawrychowski_et_al:LIPIcs.SWAT.2016.9,
author = {Gawrychowski, Pawel and Suomela, Jukka and Uznanski, Przemyslaw},
title = {{Randomized Algorithms for Finding a Majority Element}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {9:1--9:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.9},
URN = {urn:nbn:de:0030-drops-60273},
doi = {10.4230/LIPIcs.SWAT.2016.9},
annote = {Keywords: majority, randomized algorithms, lower bounds}
}
@InProceedings{ganguly_et_al:LIPIcs.SWAT.2016.10,
author = {Ganguly, Arnab and Hon, Wing-Kai and Shah, Rahul},
title = {{A Framework for Dynamic Parameterized Dictionary Matching}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {10:1--10:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.10},
URN = {urn:nbn:de:0030-drops-60256},
doi = {10.4230/LIPIcs.SWAT.2016.10},
annote = {Keywords: Parameterized Dictionary Indexing, Generalized Suffix Tree, Succinct Data Structures, Sparsification}
}
@InProceedings{benbasat_et_al:LIPIcs.SWAT.2016.11,
author = {Ben Basat, Ran and Einziger, Gil and Friedman, Roy and Kassner, Yaron},
title = {{Efficient Summing over Sliding Windows}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {11:1--11:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.11},
URN = {urn:nbn:de:0030-drops-60241},
doi = {10.4230/LIPIcs.SWAT.2016.11},
annote = {Keywords: Streaming, Statistics, Lower Bounds}
}
@InProceedings{cygan_et_al:LIPIcs.SWAT.2016.12,
author = {Cygan, Marek and Lokshtanov, Daniel and Pilipczuk, Marcin and Pilipczuk, Michal and Saurabh, Saket},
title = {{Lower Bounds for Approximation Schemes for Closest String}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {12:1--12:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.12},
URN = {urn:nbn:de:0030-drops-60232},
doi = {10.4230/LIPIcs.SWAT.2016.12},
annote = {Keywords: closest string, PTAS, efficient PTAS}
}
@InProceedings{bjorklund:LIPIcs.SWAT.2016.13,
author = {Bj\"{o}rklund, Andreas},
title = {{Coloring Graphs Having Few Colorings Over Path Decompositions}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {13:1--13:9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.13},
URN = {urn:nbn:de:0030-drops-60353},
doi = {10.4230/LIPIcs.SWAT.2016.13},
annote = {Keywords: Graph vertex coloring, path decomposition, Alon-Tarsi theorem}
}
@InProceedings{kanj_et_al:LIPIcs.SWAT.2016.14,
author = {Kanj, Iyad and Komusiewicz, Christian and Sorge, Manuel and Jan van Leeuwen, Erik},
title = {{Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {14:1--14:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.14},
URN = {urn:nbn:de:0030-drops-60360},
doi = {10.4230/LIPIcs.SWAT.2016.14},
annote = {Keywords: vertex-partition problems, monopolar graphs, subcolorings, split graphs, unipolar graphs, fixed-parameter algorithms}
}
@InProceedings{ene_et_al:LIPIcs.SWAT.2016.15,
author = {Ene, Alina and Mnich, Matthias and Pilipczuk, Marcin and Risteski, Andrej},
title = {{On Routing Disjoint Paths in Bounded Treewidth Graphs}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {15:1--15:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.15},
URN = {urn:nbn:de:0030-drops-60378},
doi = {10.4230/LIPIcs.SWAT.2016.15},
annote = {Keywords: Algorithms and data structures, disjoint paths, treewidth}
}
@InProceedings{dabrowski_et_al:LIPIcs.SWAT.2016.16,
author = {Dabrowski, Konrad K. and Dross, Fran\c{c}ois and Paulusma, Dani\"{e}l},
title = {{Colouring Diamond-free Graphs}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {16:1--16:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.16},
URN = {urn:nbn:de:0030-drops-60380},
doi = {10.4230/LIPIcs.SWAT.2016.16},
annote = {Keywords: colouring, clique-width, diamond-free, graph class, hereditary graph class}
}
@InProceedings{bjorklund:LIPIcs.SWAT.2016.17,
author = {Bj\"{o}rklund, Andreas},
title = {{Below All Subsets for Some Permutational Counting Problems}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {17:1--17:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.17},
URN = {urn:nbn:de:0030-drops-60399},
doi = {10.4230/LIPIcs.SWAT.2016.17},
annote = {Keywords: Matrix Permanent, Hamiltonian Cycles, Asymmetric TSP}
}
@InProceedings{kolman_et_al:LIPIcs.SWAT.2016.18,
author = {Kolman, Petr and Kouteck\'{y}, Martin and Tiwary, Hans Raj},
title = {{Extension Complexity, MSO Logic, and Treewidth}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {18:1--18:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.18},
URN = {urn:nbn:de:0030-drops-60405},
doi = {10.4230/LIPIcs.SWAT.2016.18},
annote = {Keywords: Extension Complexity, FPT, Courcelle's Theorem, MSO Logic}
}
@InProceedings{langetepe_et_al:LIPIcs.SWAT.2016.19,
author = {Langetepe, Elmar and K\"{u}bel, David},
title = {{Optimal Online Escape Path Against a Certificate}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {19:1--19:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.19},
URN = {urn:nbn:de:0030-drops-60414},
doi = {10.4230/LIPIcs.SWAT.2016.19},
annote = {Keywords: Search games, online algorithms, escape path, competitive analysis, spiral conjecture}
}
@InProceedings{kimthang:LIPIcs.SWAT.2016.20,
author = {Kim Thang, Nguyen},
title = {{Lagrangian Duality based Algorithms in Online Energy-Efficient Scheduling}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {20:1--20:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.20},
URN = {urn:nbn:de:0030-drops-60427},
doi = {10.4230/LIPIcs.SWAT.2016.20},
annote = {Keywords: Online Scheduling, Energy Minimization, Speed Scaling and Power-down, Lagrangian Duality}
}
@InProceedings{boyar_et_al:LIPIcs.SWAT.2016.21,
author = {Boyar, Joan and Eidenbenz, Stephan J. and Favrholdt, Lene M. and Kotrbcik, Michal and Larsen, Kim S.},
title = {{Online Dominating Set}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {21:1--21:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.21},
URN = {urn:nbn:de:0030-drops-60434},
doi = {10.4230/LIPIcs.SWAT.2016.21},
annote = {Keywords: online algorithms, dominating set, competitive analysis, graph classes, connected graphs}
}
@InProceedings{banerjee_et_al:LIPIcs.SWAT.2016.22,
author = {Banerjee, Indranil and Richards, Dana},
title = {{Sorting Under Forbidden Comparisons}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {22:1--22:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.22},
URN = {urn:nbn:de:0030-drops-60448},
doi = {10.4230/LIPIcs.SWAT.2016.22},
annote = {Keywords: Sorting, Random Graphs, Complexity}
}
@InProceedings{gupta_et_al:LIPIcs.SWAT.2016.23,
author = {Gupta, Sushmita and Iwama, Kazuo and Miyazaki, Shuichi},
title = {{Total Stability in Stable Matching Games}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {23:1--23:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.23},
URN = {urn:nbn:de:0030-drops-60450},
doi = {10.4230/LIPIcs.SWAT.2016.23},
annote = {Keywords: stable matching, Gale-Shapley algorithm, manipulation, stability, Nash equilibrium}
}
@InProceedings{jansen_et_al:LIPIcs.SWAT.2016.24,
author = {Jansen, Klaus and Land, Kati and Maack, Marten},
title = {{Estimating The Makespan of The Two-Valued Restricted Assignment Problem}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {24:1--24:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.24},
URN = {urn:nbn:de:0030-drops-60467},
doi = {10.4230/LIPIcs.SWAT.2016.24},
annote = {Keywords: unrelated scheduling, restricted assignment, configuration LP, integrality gap, estimation algorithm}
}
@InProceedings{amani_et_al:LIPIcs.SWAT.2016.25,
author = {Amani, Mahdi and Biniaz, Ahmad and Bose, Prosenjit and De Carufel, Jean-Lou and Maheshwari, Anil and Smid, Michiel},
title = {{A Plane 1.88-Spanner for Points in Convex Position}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {25:1--25:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.25},
URN = {urn:nbn:de:0030-drops-60474},
doi = {10.4230/LIPIcs.SWAT.2016.25},
annote = {Keywords: points in convex position, plane spanner}
}
@InProceedings{maheshwari_et_al:LIPIcs.SWAT.2016.26,
author = {Maheshwari, Anil and Sack, J\"{o}rg-R\"{u}diger and Scheffer, Christian},
title = {{Approximating the Integral Fr\'{e}chet Distance}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {26:1--26:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.26},
URN = {urn:nbn:de:0030-drops-60485},
doi = {10.4230/LIPIcs.SWAT.2016.26},
annote = {Keywords: Fr\'{e}chet distance, partial Fr\'{e}chet similarity, curve matching}
}
@InProceedings{chan_et_al:LIPIcs.SWAT.2016.28,
author = {Chan, Timothy M. and Rahmati, Zahed},
title = {{A Clustering-Based Approach to Kinetic Closest Pair}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {28:1--28:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.28},
URN = {urn:nbn:de:0030-drops-60508},
doi = {10.4230/LIPIcs.SWAT.2016.28},
annote = {Keywords: Kinetic Data Structure, Clustering, Closest Pair, All Nearest Neighbors}
}
@InProceedings{oh_et_al:LIPIcs.SWAT.2016.29,
author = {Oh, Eunjin and Son, Wanbin and Ahn, Hee-Kap},
title = {{Constrained Geodesic Centers of a Simple Polygon}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {29:1--29:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.29},
URN = {urn:nbn:de:0030-drops-60516},
doi = {10.4230/LIPIcs.SWAT.2016.29},
annote = {Keywords: Geodesic distance, simple polygons, constrained center, facility location, farthest-point Voronoi diagram}
}
@InProceedings{aronov_et_al:LIPIcs.SWAT.2016.30,
author = {Aronov, Boris and Korman, Matias and Pratt, Simon and van Renssen, André and Roeloffzen, Marcel},
title = {{Time-Space Trade-offs for Triangulating a Simple Polygon}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {30:1--30:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.30},
URN = {urn:nbn:de:0030-drops-60522},
doi = {10.4230/LIPIcs.SWAT.2016.30},
annote = {Keywords: simple polygon, triangulation, shortest path, time-space trade-off}
}
@InProceedings{chuzhoy:LIPIcs.SWAT.2016.31,
author = {Chuzhoy, Julia},
title = {{Excluded Grid Theorem: Improved and Simplified}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {31:1--31:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.31},
URN = {urn:nbn:de:0030-drops-60546},
doi = {10.4230/LIPIcs.SWAT.2016.31},
annote = {Keywords: Graph Minor Theory, Excluded Grid Theorem, Graph Routing}
}
@InProceedings{marx:LIPIcs.SWAT.2016.32,
author = {Marx, D\'{a}niel},
title = {{The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {32:1--32:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.32},
URN = {urn:nbn:de:0030-drops-60535},
doi = {10.4230/LIPIcs.SWAT.2016.32},
annote = {Keywords: Directed Steiner Tree, Directed Steiner Network, fixed-parameter tractability, dichotomy}
}
@InProceedings{papadimitriou:LIPIcs.SWAT.2016.33,
author = {Papadimitriou, Christos H.},
title = {{Computation as a Scientific Weltanschauung}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {33:1--33:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.33},
URN = {urn:nbn:de:0030-drops-60558},
doi = {10.4230/LIPIcs.SWAT.2016.33},
annote = {Keywords: Lens of computation, Nash equilibrium, neuroscience}
}
@InProceedings{decarufel_et_al:LIPIcs.SWAT.2016.27,
author = {De Carufel, Jean-Lou and Grimm, Carsten and Maheshwari, Anil and Smid, Michiel},
title = {{Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {27:1--27:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.27},
URN = {urn:nbn:de:0030-drops-60492},
doi = {10.4230/LIPIcs.SWAT.2016.27},
annote = {Keywords: Network Augmentation, Shortcuts, Diameter, Paths, Cycles}
}
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