@Proceedings{azar_et_al:LIPIcs.ESA.2018,
title = {{LIPIcs, Volume 112, ESA'18, Complete Volume}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018},
URN = {urn:nbn:de:0030-drops-97239},
doi = {10.4230/LIPIcs.ESA.2018},
annote = {Keywords: Computer systems organization, Single instruction, multiple data, Computing methodologies, Graphics processors, Robotic planning, Hardware}
}
@InProceedings{azar_et_al:LIPIcs.ESA.2018.0,
author = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {0:i--0:xx},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.0},
URN = {urn:nbn:de:0030-drops-94631},
doi = {10.4230/LIPIcs.ESA.2018.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{ahmadian_et_al:LIPIcs.ESA.2018.1,
author = {Ahmadian, Sara and Bhaskar, Umang and Sanit\`{a}, Laura and Swamy, Chaitanya},
title = {{Algorithms for Inverse Optimization Problems}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {1:1--1:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.1},
URN = {urn:nbn:de:0030-drops-94646},
doi = {10.4230/LIPIcs.ESA.2018.1},
annote = {Keywords: Inverse optimization, Shortest paths, Approximation algorithms, Linear programming, Polyhedral theory, Combinatorial optimization}
}
@InProceedings{amir_et_al:LIPIcs.ESA.2018.2,
author = {Amir, Amihood and Landau, Gad M. and Marcus, Shoshana and Sokol, Dina},
title = {{Two-Dimensional Maximal Repetitions}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {2:1--2:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.2},
URN = {urn:nbn:de:0030-drops-94652},
doi = {10.4230/LIPIcs.ESA.2018.2},
annote = {Keywords: pattern matching algorithms, repetitions, periodicity, two-dimensional}
}
@InProceedings{arya_et_al:LIPIcs.ESA.2018.3,
author = {Arya, Sunil and da Fonseca, Guilherme D. and Mount, David M.},
title = {{Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {3:1--3:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.3},
URN = {urn:nbn:de:0030-drops-94664},
doi = {10.4230/LIPIcs.ESA.2018.3},
annote = {Keywords: Minkowski sum, convex intersection, width, approximation}
}
@InProceedings{auger_et_al:LIPIcs.ESA.2018.4,
author = {Auger, Nicolas and Jug\'{e}, Vincent and Nicaud, Cyril and Pivoteau, Carine},
title = {{On the Worst-Case Complexity of TimSort}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {4:1--4:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.4},
URN = {urn:nbn:de:0030-drops-94678},
doi = {10.4230/LIPIcs.ESA.2018.4},
annote = {Keywords: Sorting algorithms, Merge sorting algorithms, TimSort, Analysis of algorithms}
}
@InProceedings{balogh_et_al:LIPIcs.ESA.2018.5,
author = {Balogh, J\'{a}nos and B\'{e}k\'{e}si, J\'{o}zsef and D\'{o}sa, Gy\"{o}rgy and Epstein, Leah and Levin, Asaf},
title = {{A New and Improved Algorithm for Online Bin Packing}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {5:1--5:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.5},
URN = {urn:nbn:de:0030-drops-94686},
doi = {10.4230/LIPIcs.ESA.2018.5},
annote = {Keywords: Bin packing, online algorithms, competitive analysis}
}
@InProceedings{bannach_et_al:LIPIcs.ESA.2018.6,
author = {Bannach, Max and Berndt, Sebastian},
title = {{Practical Access to Dynamic Programming on Tree Decompositions}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {6:1--6:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.6},
URN = {urn:nbn:de:0030-drops-94692},
doi = {10.4230/LIPIcs.ESA.2018.6},
annote = {Keywords: fixed-parameter tractability, treewidth, model-checking}
}
@InProceedings{becchetti_et_al:LIPIcs.ESA.2018.7,
author = {Becchetti, Luca and Clementi, Andrea and Manurangsi, Pasin and Natale, Emanuele and Pasquale, Francesco and Raghavendra, Prasad and Trevisan, Luca},
title = {{Average Whenever You Meet: Opportunistic Protocols for Community Detection}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {7:1--7:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.7},
URN = {urn:nbn:de:0030-drops-94705},
doi = {10.4230/LIPIcs.ESA.2018.7},
annote = {Keywords: Community Detection, Random Processes, Spectral Analysis}
}
@InProceedings{becker_et_al:LIPIcs.ESA.2018.8,
author = {Becker, Amariah and Klein, Philip N. and Saulpic, David},
title = {{Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {8:1--8:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.8},
URN = {urn:nbn:de:0030-drops-94710},
doi = {10.4230/LIPIcs.ESA.2018.8},
annote = {Keywords: Highway Dimension, Capacitated Vehicle Routing, Graph Embeddings}
}
@InProceedings{brandt_et_al:LIPIcs.ESA.2018.9,
author = {Brandt, Sebastian and Pettie, Seth and Uitto, Jara},
title = {{Fine-grained Lower Bounds on Cops and Robbers}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {9:1--9:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.9},
URN = {urn:nbn:de:0030-drops-94725},
doi = {10.4230/LIPIcs.ESA.2018.9},
annote = {Keywords: Cops and Robbers}
}
@InProceedings{cao_et_al:LIPIcs.ESA.2018.10,
author = {Cao, Yixin and Rai, Ashutosh and Sandeep, R. B. and Ye, Junjie},
title = {{A Polynomial Kernel for Diamond-Free Editing}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {10:1--10:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.10},
URN = {urn:nbn:de:0030-drops-94732},
doi = {10.4230/LIPIcs.ESA.2018.10},
annote = {Keywords: Kernelization, Diamond-free, H-free editing, Graph modification problem}
}
@InProceedings{carstens_et_al:LIPIcs.ESA.2018.11,
author = {Carstens, Corrie Jacobien and Hamann, Michael and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung and Wagner, Dorothea},
title = {{Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {11:1--11:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.11},
URN = {urn:nbn:de:0030-drops-94745},
doi = {10.4230/LIPIcs.ESA.2018.11},
annote = {Keywords: Graph randomisation, Curveball, I/O-efficiency, Parallelism}
}
@InProceedings{chakraborty_et_al:LIPIcs.ESA.2018.12,
author = {Chakraborty, Diptarka and Das, Debarati and Kouck\'{y}, Michal and Saurabh, Nitin},
title = {{Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {12:1--12:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.12},
URN = {urn:nbn:de:0030-drops-94750},
doi = {10.4230/LIPIcs.ESA.2018.12},
annote = {Keywords: Gray code, Space-optimal counter, Decision assignment tree, Cell probe model}
}
@InProceedings{chakraborty_et_al:LIPIcs.ESA.2018.13,
author = {Chakraborty, Sankardeep and Mukherjee, Anish and Raman, Venkatesh and Satti, Srinivasa Rao},
title = {{A Framework for In-place Graph Algorithms}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {13:1--13:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.13},
URN = {urn:nbn:de:0030-drops-94760},
doi = {10.4230/LIPIcs.ESA.2018.13},
annote = {Keywords: DFS, BFS, in-place algorithm, space-efficient graph algorithms, logspace}
}
@InProceedings{chalk_et_al:LIPIcs.ESA.2018.14,
author = {Chalk, Cameron and Luchsinger, Austin and Schweller, Robert and Wylie, Tim},
title = {{Self-Assembly of Any Shape with Constant Tile Types using High Temperature}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {14:1--14:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.14},
URN = {urn:nbn:de:0030-drops-94773},
doi = {10.4230/LIPIcs.ESA.2018.14},
annote = {Keywords: self-assembly, molecular computing, tiling, tile, shapes}
}
@InProceedings{chan_et_al:LIPIcs.ESA.2018.15,
author = {Chan, T-H. Hubert and Jiang, Haotian and Jiang, Shaofeng H.-C.},
title = {{A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {15:1--15:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.15},
URN = {urn:nbn:de:0030-drops-94781},
doi = {10.4230/LIPIcs.ESA.2018.15},
annote = {Keywords: Doubling Dimension, Traveling Salesman Problem, Polynomial Time Approximation Scheme, Steiner Tree Problem, Prize Collecting}
}
@InProceedings{chang_et_al:LIPIcs.ESA.2018.16,
author = {Chang, Hsien-Chih and Gawrychowski, Pawel and Mozes, Shay and Weimann, Oren},
title = {{Near-Optimal Distance Emulator for Planar Graphs}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {16:1--16:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.16},
URN = {urn:nbn:de:0030-drops-94796},
doi = {10.4230/LIPIcs.ESA.2018.16},
annote = {Keywords: planar graphs, shortest paths, metric compression, distance preservers, distance emulators, distance oracles}
}
@InProceedings{chaplick_et_al:LIPIcs.ESA.2018.17,
author = {Chaplick, Steven and De, Minati and Ravsky, Alexander and Spoerhase, Joachim},
title = {{Approximation Schemes for Geometric Coverage Problems}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {17:1--17:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.17},
URN = {urn:nbn:de:0030-drops-94809},
doi = {10.4230/LIPIcs.ESA.2018.17},
annote = {Keywords: balanced separators, maximum coverage, local search, approximation scheme, geometric approximation algorithms}
}
@InProceedings{cheung_et_al:LIPIcs.ESA.2018.18,
author = {Cheung, Yun Kuen and Cole, Richard},
title = {{Amortized Analysis of Asynchronous Price Dynamics}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {18:1--18:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.18},
URN = {urn:nbn:de:0030-drops-94812},
doi = {10.4230/LIPIcs.ESA.2018.18},
annote = {Keywords: Asynchronous Tatonnement, Fisher Market, Market Equilibrium, Amortized Analysis}
}
@InProceedings{chimani_et_al:LIPIcs.ESA.2018.19,
author = {Chimani, Markus and Wiedera, Tilo},
title = {{Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {19:1--19:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.19},
URN = {urn:nbn:de:0030-drops-94829},
doi = {10.4230/LIPIcs.ESA.2018.19},
annote = {Keywords: algorithm engineering, graph algorithms, integer linear programming, maximum planar subgraph}
}
@InProceedings{chitnis_et_al:LIPIcs.ESA.2018.20,
author = {Chitnis, Rajesh and Feldmann, Andreas Emil and Manurangsi, Pasin},
title = {{Parameterized Approximation Algorithms for Bidirected Steiner Network Problems}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {20:1--20:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.20},
URN = {urn:nbn:de:0030-drops-94833},
doi = {10.4230/LIPIcs.ESA.2018.20},
annote = {Keywords: Directed Steiner Network, Strongly Connected Steiner Subgraph, Parameterized Approximations, Bidirected Graphs, Planar Graphs}
}
@InProceedings{cygan_et_al:LIPIcs.ESA.2018.21,
author = {Cygan, Marek and Czumaj, Artur and Mucha, Marcin and Sankowski, Piotr},
title = {{Online Facility Location with Deletions}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {21:1--21:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.21},
URN = {urn:nbn:de:0030-drops-94843},
doi = {10.4230/LIPIcs.ESA.2018.21},
annote = {Keywords: online algorithms, facility location, fully-dynamic online algorithms}
}
@InProceedings{bonichon_et_al:LIPIcs.ESA.2018.22,
author = {Bonichon, Nicolas and Bose, Prosenjit and De Carufel, Jean-Lou and Despr\'{e}, Vincent and Hill, Darryl and Smid, Michiel},
title = {{Improved Routing on the Delaunay Triangulation}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {22:1--22:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.22},
URN = {urn:nbn:de:0030-drops-94857},
doi = {10.4230/LIPIcs.ESA.2018.22},
annote = {Keywords: Delaunay, local routing, geometric, graph}
}
@InProceedings{ding_et_al:LIPIcs.ESA.2018.23,
author = {Ding, Hu and Liu, Manni},
title = {{On Geometric Prototype and Applications}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {23:1--23:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.23},
URN = {urn:nbn:de:0030-drops-94867},
doi = {10.4230/LIPIcs.ESA.2018.23},
annote = {Keywords: prototype, core-set, Wasserstein barycenter, ensemble clustering}
}
@InProceedings{dorfman_et_al:LIPIcs.ESA.2018.24,
author = {Dorfman, Dani and Kaplan, Haim and Kozma, L\'{a}szl\'{o} and Pettie, Seth and Zwick, Uri},
title = {{Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {24:1--24:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.24},
URN = {urn:nbn:de:0030-drops-94879},
doi = {10.4230/LIPIcs.ESA.2018.24},
annote = {Keywords: data structure, priority queue, pairing heap, binary search tree}
}
@InProceedings{elzein_et_al:LIPIcs.ESA.2018.25,
author = {El-Zein, Hicham and He, Meng and Munro, J. Ian and Sandlund, Bryce},
title = {{Improved Time and Space Bounds for Dynamic Range Mode}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {25:1--25:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.25},
URN = {urn:nbn:de:0030-drops-94886},
doi = {10.4230/LIPIcs.ESA.2018.25},
annote = {Keywords: dynamic data structures, range query, range mode, range least frequent, range k-frequency}
}
@InProceedings{englert_et_al:LIPIcs.ESA.2018.26,
author = {Englert, Matthias and Mezlaf, David and Westermann, Matthias},
title = {{Online Makespan Scheduling with Job Migration on Uniform Machines}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {26:1--26:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.26},
URN = {urn:nbn:de:0030-drops-94890},
doi = {10.4230/LIPIcs.ESA.2018.26},
annote = {Keywords: online algorithms, competitive analysis, minimum makespan scheduling, job migration}
}
@InProceedings{eden_et_al:LIPIcs.ESA.2018.27,
author = {Eden, Alon and Feldman, Michal and Fiat, Amos and Taub, Tzahi},
title = {{Truthful Prompt Scheduling for Minimizing Sum of Completion Times}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {27:1--27:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.27},
URN = {urn:nbn:de:0030-drops-94905},
doi = {10.4230/LIPIcs.ESA.2018.27},
annote = {Keywords: Scheduling, Mechanism design, Online algorithms}
}
@InProceedings{fichte_et_al:LIPIcs.ESA.2018.28,
author = {Fichte, Johannes K. and Hecher, Markus and Woltran, Stefan and Zisser, Markus},
title = {{Weighted Model Counting on the GPU by Exploiting Small Treewidth}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {28:1--28:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.28},
URN = {urn:nbn:de:0030-drops-94915},
doi = {10.4230/LIPIcs.ESA.2018.28},
annote = {Keywords: Parameterized Algorithms, Weighted Model Counting, General Purpose Computing on Graphics Processing Units, Dynamic Programming, Tree Decompositions, Treewidth}
}
@InProceedings{filtser_et_al:LIPIcs.ESA.2018.29,
author = {Filtser, Arnold and Neiman, Ofer},
title = {{Light Spanners for High Dimensional Norms via Stochastic Decompositions}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {29:1--29:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.29},
URN = {urn:nbn:de:0030-drops-94922},
doi = {10.4230/LIPIcs.ESA.2018.29},
annote = {Keywords: Spanners, Stochastic Decompositions, High Dimensional Euclidean Space, Doubling Dimension, Genus Graphs}
}
@InProceedings{fomin_et_al:LIPIcs.ESA.2018.30,
author = {Fomin, Fedor V. and Golovach, Petr A. and Raymond, Jean-Florent},
title = {{On the Tractability of Optimization Problems on H-Graphs}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {30:1--30:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.30},
URN = {urn:nbn:de:0030-drops-94930},
doi = {10.4230/LIPIcs.ESA.2018.30},
annote = {Keywords: H-topological intersection graphs, parameterized complexity, minimal separators, boolean-width, mim-width}
}
@InProceedings{fomin_et_al:LIPIcs.ESA.2018.31,
author = {Fomin, Fedor V. and Panolan, Fahad and Ramanujan, M. S. and Saurabh, Saket},
title = {{On the Optimality of Pseudo-polynomial Algorithms for Integer Programming}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {31:1--31:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.31},
URN = {urn:nbn:de:0030-drops-94949},
doi = {10.4230/LIPIcs.ESA.2018.31},
annote = {Keywords: Integer Programming, Strong Exponential Time Hypothesis, Branch-width of a matrix, Fine-grained Complexity}
}
@InProceedings{galvez_et_al:LIPIcs.ESA.2018.32,
author = {G\'{a}lvez, Waldo and Soto, Jos\'{e} A. and Verschae, Jos\'{e}},
title = {{Symmetry Exploitation for Online Machine Covering with Bounded Migration}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {32:1--32:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.32},
URN = {urn:nbn:de:0030-drops-94959},
doi = {10.4230/LIPIcs.ESA.2018.32},
annote = {Keywords: Machine Covering, Bounded Migration, Online, Scheduling, LPT}
}
@InProceedings{ganczorz_et_al:LIPIcs.ESA.2018.33,
author = {Ganczorz, Michal and Gawrychowski, Pawel and Jez, Artur and Kociumaka, Tomasz},
title = {{Edit Distance with Block Operations}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {33:1--33:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.33},
URN = {urn:nbn:de:0030-drops-94963},
doi = {10.4230/LIPIcs.ESA.2018.33},
annote = {Keywords: Edit distance, Block operations, Common string partition}
}
@InProceedings{garg_et_al:LIPIcs.ESA.2018.34,
author = {Garg, Shilpa and M\"{o}mke, Tobias},
title = {{A QPTAS for Gapless MEC}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {34:1--34:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.34},
URN = {urn:nbn:de:0030-drops-94978},
doi = {10.4230/LIPIcs.ESA.2018.34},
annote = {Keywords: approximation algorithms, QPTAS, minimum error correction, segmentation, computational biology}
}
@InProceedings{ghosh_et_al:LIPIcs.ESA.2018.35,
author = {Ghosh, Arijit and Kolay, Sudeshna and Mishra, Gopinath},
title = {{FPT Algorithms for Embedding into Low Complexity Graphic Metrics}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {35:1--35:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.35},
URN = {urn:nbn:de:0030-drops-94988},
doi = {10.4230/LIPIcs.ESA.2018.35},
annote = {Keywords: Metric spaces, metric embedding, FPT, dynamic programming}
}
@InProceedings{gkenosis_et_al:LIPIcs.ESA.2018.36,
author = {Gkenosis, Dimitrios and Grammel, Nathaniel and Hellerstein, Lisa and Kletenik, Devorah},
title = {{The Stochastic Score Classification Problem}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {36:1--36:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.36},
URN = {urn:nbn:de:0030-drops-94990},
doi = {10.4230/LIPIcs.ESA.2018.36},
annote = {Keywords: approximation algorithms, symmetric Boolean functions, stochastic probing, sequential testing, adaptivity}
}
@InProceedings{goldstein_et_al:LIPIcs.ESA.2018.37,
author = {Goldstein, Isaac and Lewenstein, Moshe and Porat, Ely},
title = {{Improved Space-Time Tradeoffs for kSUM}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {37:1--37:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.37},
URN = {urn:nbn:de:0030-drops-95000},
doi = {10.4230/LIPIcs.ESA.2018.37},
annote = {Keywords: kSUM, space-time tradeoff, self-reduction}
}
@InProceedings{golin_et_al:LIPIcs.ESA.2018.38,
author = {Golin, Mordecai and Iacono, John and Langerman, Stefan and Munro, J. Ian and Nekrich, Yakov},
title = {{Dynamic Trees with Almost-Optimal Access Cost}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {38:1--38:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.38},
URN = {urn:nbn:de:0030-drops-95017},
doi = {10.4230/LIPIcs.ESA.2018.38},
annote = {Keywords: Data Structures, Binary Search Trees, Adaptive Alphabetic Coding}
}
@InProceedings{goranci_et_al:LIPIcs.ESA.2018.39,
author = {Goranci, Gramoz and Henzinger, Monika and Leniowski, Dariusz},
title = {{A Tree Structure For Dynamic Facility Location}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {39:1--39:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.39},
URN = {urn:nbn:de:0030-drops-95026},
doi = {10.4230/LIPIcs.ESA.2018.39},
annote = {Keywords: facility location, dynamic algorithm, approximation, doubling dimension}
}
@InProceedings{goranci_et_al:LIPIcs.ESA.2018.40,
author = {Goranci, Gramoz and Henzinger, Monika and Peng, Pan},
title = {{Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {40:1--40:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.40},
URN = {urn:nbn:de:0030-drops-95036},
doi = {10.4230/LIPIcs.ESA.2018.40},
annote = {Keywords: Dynamic graph algorithms, effective resistance, separable graphs, Schur complement, conditional lower bounds}
}
@InProceedings{goswami_et_al:LIPIcs.ESA.2018.41,
author = {Goswami, Mayank and Medjedovic, Dzejla and Mekic, Emina and Pandey, Prashant},
title = {{Buffered Count-Min Sketch on SSD: Theory and Experiments}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {41:1--41:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.41},
URN = {urn:nbn:de:0030-drops-95042},
doi = {10.4230/LIPIcs.ESA.2018.41},
annote = {Keywords: Streaming model, Count-min sketch, Counting, Frequency, External memory, I/O efficiency, Bloom filter, Counting filter, Quotient filter}
}
@InProceedings{vandergrinten_et_al:LIPIcs.ESA.2018.42,
author = {van der Grinten, Alexander and Bergamini, Elisabetta and Green, Oded and Bader, David A. and Meyerhenke, Henning},
title = {{Scalable Katz Ranking Computation in Large Static and Dynamic Graphs}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {42:1--42:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.42},
URN = {urn:nbn:de:0030-drops-95055},
doi = {10.4230/LIPIcs.ESA.2018.42},
annote = {Keywords: network analysis, Katz centrality, top-k ranking, dynamic graphs, parallel algorithms}
}
@InProceedings{grossi_et_al:LIPIcs.ESA.2018.43,
author = {Grossi, Roberto and Versari, Luca},
title = {{Round-Hashing for Data Storage: Distributed Servers and External-Memory Tables}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {43:1--43:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.43},
URN = {urn:nbn:de:0030-drops-95062},
doi = {10.4230/LIPIcs.ESA.2018.43},
annote = {Keywords: consistent hashing, external memory, hash tables}
}
@InProceedings{gu_et_al:LIPIcs.ESA.2018.44,
author = {Gu, Yan and Sun, Yihan and Blelloch, Guy E.},
title = {{Algorithmic Building Blocks for Asymmetric Memories}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {44:1--44:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.44},
URN = {urn:nbn:de:0030-drops-95070},
doi = {10.4230/LIPIcs.ESA.2018.44},
annote = {Keywords: Asymmetric Memory, I/O Cost, Write-Efficient Algorithms, Hash Tables, Graph-Traversal Algorithms}
}
@InProceedings{he_et_al:LIPIcs.ESA.2018.45,
author = {He, Xiaoyu and Huang, Neng and Sun, Xiaoming},
title = {{On the Decision Tree Complexity of String Matching}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {45:1--45:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.45},
URN = {urn:nbn:de:0030-drops-95082},
doi = {10.4230/LIPIcs.ESA.2018.45},
annote = {Keywords: String Matching, Decision Tree Complexity, Boolean Function, Algebraic Method}
}
@InProceedings{holm_et_al:LIPIcs.ESA.2018.46,
author = {Holm, Jacob and Italiano, Giuseppe F. and Karczmarz, Adam and Lacki, Jakub and Rotenberg, Eva},
title = {{Decremental SPQR-trees for Planar Graphs}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {46:1--46:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.46},
URN = {urn:nbn:de:0030-drops-95091},
doi = {10.4230/LIPIcs.ESA.2018.46},
annote = {Keywords: Graph embeddings, data structures, graph algorithms, planar graphs, SPQR-trees, triconnectivity}
}
@InProceedings{jansen_et_al:LIPIcs.ESA.2018.47,
author = {Jansen, Bart M. P. and Nederlof, Jesper},
title = {{Computing the Chromatic Number Using Graph Decompositions via Matrix Rank}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {47:1--47:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.47},
URN = {urn:nbn:de:0030-drops-95104},
doi = {10.4230/LIPIcs.ESA.2018.47},
annote = {Keywords: Parameterized Complexity, Chromatic Number, Graph Decompositions}
}
@InProceedings{jansen_et_al:LIPIcs.ESA.2018.48,
author = {Jansen, Bart M. P. and Pieterse, Astrid},
title = {{Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {48:1--48:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.48},
URN = {urn:nbn:de:0030-drops-95119},
doi = {10.4230/LIPIcs.ESA.2018.48},
annote = {Keywords: Kernelization, F-minor free deletion, Treedepth modulator, Structural parameterization}
}
@InProceedings{jarret_et_al:LIPIcs.ESA.2018.49,
author = {Jarret, Michael and Jeffery, Stacey and Kimmel, Shelby and Piedrafita, Alvaro},
title = {{Quantum Algorithms for Connectivity and Related Problems}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {49:1--49:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.49},
URN = {urn:nbn:de:0030-drops-95121},
doi = {10.4230/LIPIcs.ESA.2018.49},
annote = {Keywords: Electrical networks, Quantum algorithms, Span programs, Connectivity, Graph theory}
}
@InProceedings{jelinek_et_al:LIPIcs.ESA.2018.50,
author = {Jel{\'\i}nek, V{\'\i}t and Opler, Michal and Valtr, Pavel},
title = {{Generalized Coloring of Permutations}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {50:1--50:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.50},
URN = {urn:nbn:de:0030-drops-95137},
doi = {10.4230/LIPIcs.ESA.2018.50},
annote = {Keywords: Permutations, merge, generalized coloring}
}
@InProceedings{kanj_et_al:LIPIcs.ESA.2018.51,
author = {Kanj, Iyad and Komusiewicz, Christian and Sorge, Manuel and van Leeuwen, Erik Jan},
title = {{Solving Partition Problems Almost Always Requires Pushing Many Vertices Around}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {51:1--51:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.51},
URN = {urn:nbn:de:0030-drops-95140},
doi = {10.4230/LIPIcs.ESA.2018.51},
annote = {Keywords: Fixed-parameter algorithms, Kernelization, Vertex-partition problems, Reduction rules, Cross-composition}
}
@InProceedings{kempa_et_al:LIPIcs.ESA.2018.52,
author = {Kempa, Dominik and Policriti, Alberto and Prezza, Nicola and Rotenberg, Eva},
title = {{String Attractors: Verification and Optimization}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {52:1--52:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.52},
URN = {urn:nbn:de:0030-drops-95153},
doi = {10.4230/LIPIcs.ESA.2018.52},
annote = {Keywords: Dictionary compression, String attractors, Set cover}
}
@InProceedings{korenwein_et_al:LIPIcs.ESA.2018.53,
author = {Korenwein, Viatcheslav and Nichterlein, Andr\'{e} and Niedermeier, Rolf and Zschoche, Philipp},
title = {{Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {53:1--53:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.53},
URN = {urn:nbn:de:0030-drops-95169},
doi = {10.4230/LIPIcs.ESA.2018.53},
annote = {Keywords: Maximum-cardinality matching, maximum-weight matching, linear-time algorithms, preprocessing, kernelization, parameterized complexity analysis}
}
@InProceedings{boczkowski_et_al:LIPIcs.ESA.2018.54,
author = {Boczkowski, Lucas and Korman, Amos and Rodeh, Yoav},
title = {{Searching a Tree with Permanently Noisy Advice}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {54:1--54:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.54},
URN = {urn:nbn:de:0030-drops-95176},
doi = {10.4230/LIPIcs.ESA.2018.54},
annote = {Keywords: Data structures, Graph search, Average Case Analysis}
}
@InProceedings{kratsch_et_al:LIPIcs.ESA.2018.55,
author = {Kratsch, Stefan and Nelles, Florian},
title = {{Efficient and Adaptive Parameterized Algorithms on Modular Decompositions}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {55:1--55:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.55},
URN = {urn:nbn:de:0030-drops-95187},
doi = {10.4230/LIPIcs.ESA.2018.55},
annote = {Keywords: efficient parameterized algorithms, modular-width, adaptive algorithms}
}
@InProceedings{kunnemann:LIPIcs.ESA.2018.56,
author = {K\"{u}nnemann, Marvin},
title = {{On Nondeterministic Derandomization of Freivalds' Algorithm: Consequences, Avenues and Algorithmic Progress}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {56:1--56:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.56},
URN = {urn:nbn:de:0030-drops-95195},
doi = {10.4230/LIPIcs.ESA.2018.56},
annote = {Keywords: matrix product verification, certifying computation, fine-grained complexity and algorithms}
}
@InProceedings{lee_et_al:LIPIcs.ESA.2018.57,
author = {Lee, Euiwoong and Singla, Sahil},
title = {{Optimal Online Contention Resolution Schemes via Ex-Ante Prophet Inequalities}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {57:1--57:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.57},
URN = {urn:nbn:de:0030-drops-95208},
doi = {10.4230/LIPIcs.ESA.2018.57},
annote = {Keywords: Prophets, Contention Resolution, Stochastic Optimization, Matroids}
}
@InProceedings{bhaskar_et_al:LIPIcs.ESA.2018.58,
author = {Bhaskar, Umang and Lolakapuri, Phani Raj},
title = {{Equilibrium Computation in Atomic Splittable Routing Games}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {58:1--58:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.58},
URN = {urn:nbn:de:0030-drops-95211},
doi = {10.4230/LIPIcs.ESA.2018.58},
annote = {Keywords: Routing Games, Equilibrium Computation, Convex costs, Splittable flows}
}
@InProceedings{lucarelli_et_al:LIPIcs.ESA.2018.59,
author = {Lucarelli, Giorgio and Moseley, Benjamin and Thang, Nguyen Kim and Srivastav, Abhinav and Trystram, Denis},
title = {{Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {59:1--59:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.59},
URN = {urn:nbn:de:0030-drops-95226},
doi = {10.4230/LIPIcs.ESA.2018.59},
annote = {Keywords: Online Algorithms, Scheduling, Resource Augmentation}
}
@InProceedings{mai_et_al:LIPIcs.ESA.2018.60,
author = {Mai, Tung and Vazirani, Vijay V.},
title = {{Finding Stable Matchings That Are Robust to Errors in the Input}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {60:1--60:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.60},
URN = {urn:nbn:de:0030-drops-95238},
doi = {10.4230/LIPIcs.ESA.2018.60},
annote = {Keywords: Stable Matching, Robust}
}
@InProceedings{martin_et_al:LIPIcs.ESA.2018.61,
author = {Martin, Barnaby and Paulusma, Dani\"{e}l and van Leeuwen, Erik Jan},
title = {{Disconnected Cuts in Claw-free Graphs}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {61:1--61:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.61},
URN = {urn:nbn:de:0030-drops-95249},
doi = {10.4230/LIPIcs.ESA.2018.61},
annote = {Keywords: disconnected cut, surjective homomorphism, biclique cover, claw-freeness}
}
@InProceedings{matheny_et_al:LIPIcs.ESA.2018.62,
author = {Matheny, Michael and Phillips, Jeff M.},
title = {{Practical Low-Dimensional Halfspace Range Space Sampling}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {62:1--62:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.62},
URN = {urn:nbn:de:0030-drops-95250},
doi = {10.4230/LIPIcs.ESA.2018.62},
annote = {Keywords: Partitions, Range Spaces, Sampling, Halfspaces}
}
@InProceedings{munro_et_al:LIPIcs.ESA.2018.63,
author = {Munro, J. Ian and Wild, Sebastian},
title = {{Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {63:1--63:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.63},
URN = {urn:nbn:de:0030-drops-95265},
doi = {10.4230/LIPIcs.ESA.2018.63},
annote = {Keywords: adaptive sorting, nearly-optimal binary search trees, Timsort}
}
@InProceedings{mustafa_et_al:LIPIcs.ESA.2018.64,
author = {Mustafa, Nabil H. and Ray, Saurabh},
title = {{On a Problem of Danzer}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {64:1--64:8},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.64},
URN = {urn:nbn:de:0030-drops-95271},
doi = {10.4230/LIPIcs.ESA.2018.64},
annote = {Keywords: Convex polytopes, Hadwiger-Debrunner numbers, Epsilon-nets, Balls}
}
@InProceedings{pilipczuk_et_al:LIPIcs.ESA.2018.65,
author = {Pilipczuk, Michal and van Leeuwen, Erik Jan and Wiese, Andreas},
title = {{Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {65:1--65:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.65},
URN = {urn:nbn:de:0030-drops-95282},
doi = {10.4230/LIPIcs.ESA.2018.65},
annote = {Keywords: QPTAS, planar graphs, Voronoi diagram}
}
@InProceedings{ivanyos_et_al:LIPIcs.ESA.2018.66,
author = {Ivanyos, G\'{a}bor and Prakash, Anupam and Santha, Miklos},
title = {{On Learning Linear Functions from Subset and Its Applications in Quantum Computing}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {66:1--66:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.66},
URN = {urn:nbn:de:0030-drops-95299},
doi = {10.4230/LIPIcs.ESA.2018.66},
annote = {Keywords: Learning from subset, hidden shift problem, quantum algorithms, linearization}
}
@InProceedings{boissonnat_et_al:LIPIcs.ESA.2018.67,
author = {Boissonnat, Jean-Daniel and Pritam, Siddharth and Pareek, Divyansh},
title = {{Strong Collapse for Persistence}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {67:1--67:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.67},
URN = {urn:nbn:de:0030-drops-95302},
doi = {10.4230/LIPIcs.ESA.2018.67},
annote = {Keywords: Computational Topology, Topological Data Analysis, Strong Collapse, Persistent homology}
}
@InProceedings{probst:LIPIcs.ESA.2018.68,
author = {Probst, Maximilian},
title = {{On the Complexity of the (Approximate) Nearest Colored Node Problem}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {68:1--68:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.68},
URN = {urn:nbn:de:0030-drops-95313},
doi = {10.4230/LIPIcs.ESA.2018.68},
annote = {Keywords: Nearest Colored Node, Distance Oracles, Cell-probe lower bounds}
}
@InProceedings{raman_et_al:LIPIcs.ESA.2018.69,
author = {Raman, Rajiv and Ray, Saurabh},
title = {{Planar Support for Non-piercing Regions and Applications}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {69:1--69:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.69},
URN = {urn:nbn:de:0030-drops-95320},
doi = {10.4230/LIPIcs.ESA.2018.69},
annote = {Keywords: Geometric optimization, packing and covering, non-piercing regions}
}
@InProceedings{schmidt_et_al:LIPIcs.ESA.2018.70,
author = {Schmidt, Daniel R. and Zey, Bernd and Margot, Fran\c{c}ois},
title = {{An Exact Algorithm for the Steiner Forest Problem}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {70:1--70:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.70},
URN = {urn:nbn:de:0030-drops-95339},
doi = {10.4230/LIPIcs.ESA.2018.70},
annote = {Keywords: branch-and-bound algorithms, Steiner network problems}
}
@InProceedings{dinitz_et_al:LIPIcs.ESA.2018.71,
author = {Dinitz, Michael and Schapira, Michael and Shahaf, Gal},
title = {{Large Low-Diameter Graphs are Good Expanders}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {71:1--71:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.71},
URN = {urn:nbn:de:0030-drops-95348},
doi = {10.4230/LIPIcs.ESA.2018.71},
annote = {Keywords: Network design, Expander graphs, Spectral graph theory}
}
@InProceedings{solomon_et_al:LIPIcs.ESA.2018.72,
author = {Solomon, Shay and Wein, Nicole},
title = {{Improved Dynamic Graph Coloring}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {72:1--72:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.72},
URN = {urn:nbn:de:0030-drops-95357},
doi = {10.4230/LIPIcs.ESA.2018.72},
annote = {Keywords: coloring, dynamic graph algorithms, graph arboricity, edge orientations}
}
@InProceedings{zhou_et_al:LIPIcs.ESA.2018.73,
author = {Zhou, Bo and Chiang, Yi-Jen and Yap, Chee},
title = {{Soft Subdivision Motion Planning for Complex Planar Robots}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {73:1--73:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.73},
URN = {urn:nbn:de:0030-drops-95361},
doi = {10.4230/LIPIcs.ESA.2018.73},
annote = {Keywords: Computational Geometry, Algorithmic Motion Planning, Resolution-Exact Algorithms, Soft Predicates, Planar Robots with Complex Geometry}
}
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