24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@Proceedings{sankowski_et_al:LIPIcs.ESA.2016, title = {{LIPIcs, Volume 57, ESA'16, Complete Volume}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016}, URN = {urn:nbn:de:0030-drops-65854}, doi = {10.4230/LIPIcs.ESA.2016}, annote = {Keywords: Data Structures, Nonnumerical Algorithms and Problems, Optimization, Discrete Mathematics, Mathematical Software, Algorithms, Problem Solving, Control Methods and Search, Computational Geometry and Object Modeling} }
24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 0:i-0:xxiv, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{sankowski_et_al:LIPIcs.ESA.2016.0, author = {Sankowski, Piotr and Zaroliagis, Christos}, title = {{Front Matter, Table of Contents, Preface, Programm Commitee, External Reviewers}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {0:i--0:xxiv}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.0}, URN = {urn:nbn:de:0030-drops-63429}, doi = {10.4230/LIPIcs.ESA.2016.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Programm Commitee, External Reviewers} }
Loukas Georgiadis, Giuseppe F. Italiano, and Nikos Parotsidis. 2-Connectivity in Directed Graphs (Invited Talk). In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 1:1-1:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{georgiadis_et_al:LIPIcs.ESA.2016.1, author = {Georgiadis, Loukas and Italiano, Giuseppe F. and Parotsidis, Nikos}, title = {{2-Connectivity in Directed Graphs}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {1:1--1:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.1}, URN = {urn:nbn:de:0030-drops-63451}, doi = {10.4230/LIPIcs.ESA.2016.1}, annote = {Keywords: 2-edge and 2-vertex connectivity on directed graphs, graph algorithms, dominator trees} }
Ola Svensson. Algorithms with Provable Guarantees for Clustering (Invited Talk). In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, p. 2:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{svensson:LIPIcs.ESA.2016.2, author = {Svensson, Ola}, title = {{Algorithms with Provable Guarantees for Clustering}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {2:1--2:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.2}, URN = {urn:nbn:de:0030-drops-63435}, doi = {10.4230/LIPIcs.ESA.2016.2}, annote = {Keywords: Approximation algorithms, clustering} }
Melika Abolhassani, T.-H. Hubert Chan, Fei Chen, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Mahini Hamid, and Xiaowei Wu. Beating Ratio 0.5 for Weighted Oblivious Matching Problems. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 3:1-3:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{abolhassani_et_al:LIPIcs.ESA.2016.3, author = {Abolhassani, Melika and Chan, T.-H. Hubert and Chen, Fei and Esfandiari, Hossein and Hajiaghayi, MohammadTaghi and Hamid, Mahini and Wu, Xiaowei}, title = {{Beating Ratio 0.5 for Weighted Oblivious Matching Problems}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {3:1--3:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.3}, URN = {urn:nbn:de:0030-drops-63443}, doi = {10.4230/LIPIcs.ESA.2016.3}, annote = {Keywords: Weighted matching, oblivious algorithms, Ranking, linear programming} }
Mikkel Abrahamsen and Bartosz Walczak. Outer Common Tangents and Nesting of Convex Hulls in Linear Time and Constant Workspace. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 4:1-4:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{abrahamsen_et_al:LIPIcs.ESA.2016.4, author = {Abrahamsen, Mikkel and Walczak, Bartosz}, title = {{Outer Common Tangents and Nesting of Convex Hulls in Linear Time and Constant Workspace}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {4:1--4:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.4}, URN = {urn:nbn:de:0030-drops-63465}, doi = {10.4230/LIPIcs.ESA.2016.4}, annote = {Keywords: simple polygon, common tangent, optimal algorithm, constant workspace} }
Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen, and Ely Porat. Sublinear Distance Labeling. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 5:1-5:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{alstrup_et_al:LIPIcs.ESA.2016.5, author = {Alstrup, Stephen and Dahlgaard, S{\o}ren and Knudsen, Mathias B{\ae}k Tejs and Porat, Ely}, title = {{Sublinear Distance Labeling}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {5:1--5:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.5}, URN = {urn:nbn:de:0030-drops-63479}, doi = {10.4230/LIPIcs.ESA.2016.5}, annote = {Keywords: Graph labeling schemes, Distance labeling, Graph theory, Sparse graphs} }
Tobias Arndt, Danijar Hafner, Thomas Kellermeier, Simon Krogmann, Armin Razmjou, Martin S. Krejca, Ralf Rothenberger, and Tobias Friedrich. Probabilistic Routing for On-Street Parking Search. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 6:1-6:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{arndt_et_al:LIPIcs.ESA.2016.6, author = {Arndt, Tobias and Hafner, Danijar and Kellermeier, Thomas and Krogmann, Simon and Razmjou, Armin and Krejca, Martin S. and Rothenberger, Ralf and Friedrich, Tobias}, title = {{Probabilistic Routing for On-Street Parking Search}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {6:1--6:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.6}, URN = {urn:nbn:de:0030-drops-63489}, doi = {10.4230/LIPIcs.ESA.2016.6}, annote = {Keywords: parking search, on-street parking, probabilistic routing, constrained optimization, dataset} }
Moritz Baum, Thomas Bläsius, Andreas Gemsa, Ignaz Rutter, and Franziska Wegner. Scalable Exact Visualization of Isocontours in Road Networks via Minimum-Link Paths. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 7:1-7:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{baum_et_al:LIPIcs.ESA.2016.7, author = {Baum, Moritz and Bl\"{a}sius, Thomas and Gemsa, Andreas and Rutter, Ignaz and Wegner, Franziska}, title = {{Scalable Exact Visualization of Isocontours in Road Networks via Minimum-Link Paths}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {7:1--7:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.7}, URN = {urn:nbn:de:0030-drops-63498}, doi = {10.4230/LIPIcs.ESA.2016.7}, annote = {Keywords: isocontours, separating polygons, minimum-link paths} }
Xiaohui Bei, Jugal Garg, Martin Hoefer, and Kurt Mehlhorn. Computing Equilibria in Markets with Budget-Additive Utilities. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 8:1-8:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{bei_et_al:LIPIcs.ESA.2016.8, author = {Bei, Xiaohui and Garg, Jugal and Hoefer, Martin and Mehlhorn, Kurt}, title = {{Computing Equilibria in Markets with Budget-Additive Utilities}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {8:1--8:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.8}, URN = {urn:nbn:de:0030-drops-63504}, doi = {10.4230/LIPIcs.ESA.2016.8}, annote = {Keywords: Budget-Additive Utility, Market Equilibrium, Equilibrium Computation} }
Huck Bennett, Daniel Dadush, and Noah Stephens-Davidowitz. On the Lattice Distortion Problem. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 9:1-9:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{bennett_et_al:LIPIcs.ESA.2016.9, author = {Bennett, Huck and Dadush, Daniel and Stephens-Davidowitz, Noah}, title = {{On the Lattice Distortion Problem}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {9:1--9:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.9}, URN = {urn:nbn:de:0030-drops-63519}, doi = {10.4230/LIPIcs.ESA.2016.9}, annote = {Keywords: lattices, lattice distortion, lattice isomoprhism, geometry of numbers, basis reduction} }
Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, and Chris Wastell. Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load Balancing. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 10:1-10:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{berenbrink_et_al:LIPIcs.ESA.2016.10, author = {Berenbrink, Petra and Friedetzky, Tom and Kling, Peter and Mallmann-Trenn, Frederik and Wastell, Chris}, title = {{Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load Balancing}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {10:1--10:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.10}, URN = {urn:nbn:de:0030-drops-63610}, doi = {10.4230/LIPIcs.ESA.2016.10}, annote = {Keywords: Plurality Consensus, Distributed Computing, Load Balancing} }
Arnab Bhattacharyya, Ameet Gadekar, Suprovat Ghoshal, and Rishi Saket. On the Hardness of Learning Sparse Parities. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 11:1-11:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{bhattacharyya_et_al:LIPIcs.ESA.2016.11, author = {Bhattacharyya, Arnab and Gadekar, Ameet and Ghoshal, Suprovat and Saket, Rishi}, title = {{On the Hardness of Learning Sparse Parities}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {11:1--11:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.11}, URN = {urn:nbn:de:0030-drops-63628}, doi = {10.4230/LIPIcs.ESA.2016.11}, annote = {Keywords: Fixed Parameter Tractable, Juntas, Minimum Distance of Code, Psuedorandom Generators} }
Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukas Folwarczny, Lukasz Jez, Jiri Sgall, Nguyen Kim Thang, and Pavel Vesely. Online Algorithms for Multi-Level Aggregation. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 12:1-12:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{bienkowski_et_al:LIPIcs.ESA.2016.12, author = {Bienkowski, Marcin and B\"{o}hm, Martin and Byrka, Jaroslaw and Chrobak, Marek and D\"{u}rr, Christoph and Folwarczny, Lukas and Jez, Lukasz and Sgall, Jiri and Kim Thang, Nguyen and Vesely, Pavel}, title = {{Online Algorithms for Multi-Level Aggregation}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {12:1--12:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.12}, URN = {urn:nbn:de:0030-drops-63637}, doi = {10.4230/LIPIcs.ESA.2016.12}, annote = {Keywords: algorithmic aspects of networks, online algorithms, scheduling and resource allocation} }
Davide Bilo, Luciano Guala, Stefano Leucci, and Guido Proietti. Compact and Fast Sensitivity Oracles for Single-Source Distances. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 13:1-13:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{bilo_et_al:LIPIcs.ESA.2016.13, author = {Bilo, Davide and Guala, Luciano and Leucci, Stefano and Proietti, Guido}, title = {{Compact and Fast Sensitivity Oracles for Single-Source Distances}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {13:1--13:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.13}, URN = {urn:nbn:de:0030-drops-63640}, doi = {10.4230/LIPIcs.ESA.2016.13}, annote = {Keywords: fault-tolerant shortest-path tree, approximate distance, distance sensitivity oracle} }
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, and Julian Shun. Efficient Algorithms with Asymmetric Read and Write Costs. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 14:1-14:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{blelloch_et_al:LIPIcs.ESA.2016.14, author = {Blelloch, Guy E. and Fineman, Jeremy T. and Gibbons, Phillip B. and Gu, Yan and Shun, Julian}, title = {{Efficient Algorithms with Asymmetric Read and Write Costs}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {14:1--14:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.14}, URN = {urn:nbn:de:0030-drops-63656}, doi = {10.4230/LIPIcs.ESA.2016.14}, annote = {Keywords: Computational Model, Lower Bounds, Shortest-paths, Non-Volatile Memory, Sorting Networks, Fast Fourier Transform, Diamond DAG, Minimum Spanning Tree} }
Thomas Bläsius, Tobias Friedrich, and Anton Krohmer. Hyperbolic Random Graphs: Separators and Treewidth. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 15:1-15:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{blasius_et_al:LIPIcs.ESA.2016.15, author = {Bl\"{a}sius, Thomas and Friedrich, Tobias and Krohmer, Anton}, title = {{Hyperbolic Random Graphs: Separators and Treewidth}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {15:1--15:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.15}, URN = {urn:nbn:de:0030-drops-63667}, doi = {10.4230/LIPIcs.ESA.2016.15}, annote = {Keywords: hyperbolic random graphs, scale-free networks, power-law graphs, separators, treewidth} }
Thomas Bläsius, Tobias Friedrich, Anton Krohmer, and Sören Laue. Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 16:1-16:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{blasius_et_al:LIPIcs.ESA.2016.16, author = {Bl\"{a}sius, Thomas and Friedrich, Tobias and Krohmer, Anton and Laue, S\"{o}ren}, title = {{Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {16:1--16:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.16}, URN = {urn:nbn:de:0030-drops-63670}, doi = {10.4230/LIPIcs.ESA.2016.16}, annote = {Keywords: hyperbolic random graphs, embedding, power-law graphs, hyperbolic plane} }
Greg Bodwin and Sebastian Krinninger. Fully Dynamic Spanners with Worst-Case Update Time. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 17:1-17:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{bodwin_et_al:LIPIcs.ESA.2016.17, author = {Bodwin, Greg and Krinninger, Sebastian}, title = {{Fully Dynamic Spanners with Worst-Case Update Time}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {17:1--17:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.17}, URN = {urn:nbn:de:0030-drops-63688}, doi = {10.4230/LIPIcs.ESA.2016.17}, annote = {Keywords: Dynamic graph algorithms, spanners} }
Édouard Bonnet, László Egri, and Dániel Marx. Fixed-Parameter Approximability of Boolean MinCSPs. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 18:1-18:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{bonnet_et_al:LIPIcs.ESA.2016.18, author = {Bonnet, \'{E}douard and Egri, L\'{a}szl\'{o} and Marx, D\'{a}niel}, title = {{Fixed-Parameter Approximability of Boolean MinCSPs}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {18:1--18:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.18}, URN = {urn:nbn:de:0030-drops-63694}, doi = {10.4230/LIPIcs.ESA.2016.18}, annote = {Keywords: constraint satisfaction problems, approximability, fixed-parameter tractability} }
Édouard Bonnet and Tillmann Miltzow. Parameterized Hardness of Art Gallery Problems. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 19:1-19:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{bonnet_et_al:LIPIcs.ESA.2016.19, author = {Bonnet, \'{E}douard and Miltzow, Tillmann}, title = {{Parameterized Hardness of Art Gallery Problems}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {19:1--19:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.19}, URN = {urn:nbn:de:0030-drops-63700}, doi = {10.4230/LIPIcs.ESA.2016.19}, annote = {Keywords: art gallery problem, computational geometry, parameterized complexity, ETH-based lower bound, geometric set cover/hitting set} }
Michele Borassi and Emanuele Natale. KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 20:1-20:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{borassi_et_al:LIPIcs.ESA.2016.20, author = {Borassi, Michele and Natale, Emanuele}, title = {{KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {20:1--20:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.20}, URN = {urn:nbn:de:0030-drops-63712}, doi = {10.4230/LIPIcs.ESA.2016.20}, annote = {Keywords: Betweenness centrality, shortest path algorithm, graph mining, sampling, network analysis} }
Ralf Borndörfer, Heide Hoppmann, and Marika Karbstein. Separation of Cycle Inequalities for the Periodic Timetabling Problem. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 21:1-21:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{borndorfer_et_al:LIPIcs.ESA.2016.21, author = {Bornd\"{o}rfer, Ralf and Hoppmann, Heide and Karbstein, Marika}, title = {{Separation of Cycle Inequalities for the Periodic Timetabling Problem}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {21:1--21:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.21}, URN = {urn:nbn:de:0030-drops-63722}, doi = {10.4230/LIPIcs.ESA.2016.21}, annote = {Keywords: periodic timetabling, cycle inequalities, separation algorithm} }
Quirijn W. Bouts, Irina Irina Kostitsyna, Marc van Kreveld, Wouter Meulemans, Willem Sonke, and Kevin Verbeek. Mapping Polygons to the Grid with Small Hausdorff and Fréchet Distance. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 22:1-22:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{bouts_et_al:LIPIcs.ESA.2016.22, author = {Bouts, Quirijn W. and Irina Kostitsyna, Irina and van Kreveld, Marc and Meulemans, Wouter and Sonke, Willem and Verbeek, Kevin}, title = {{Mapping Polygons to the Grid with Small Hausdorff and Fr\'{e}chet Distance}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {22:1--22:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.22}, URN = {urn:nbn:de:0030-drops-63738}, doi = {10.4230/LIPIcs.ESA.2016.22}, annote = {Keywords: grid mapping, Hausdorff distance, Fr\'{e}chet distance, digital geometry} }
Karl Bringmann, László Kozma, Shay Moran, and N. S. Narayanaswamy. Hitting Set for Hypergraphs of Low VC-dimension. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 23:1-23:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{bringmann_et_al:LIPIcs.ESA.2016.23, author = {Bringmann, Karl and Kozma, L\'{a}szl\'{o} and Moran, Shay and Narayanaswamy, N. S.}, title = {{Hitting Set for Hypergraphs of Low VC-dimension}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {23:1--23:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.23}, URN = {urn:nbn:de:0030-drops-63749}, doi = {10.4230/LIPIcs.ESA.2016.23}, annote = {Keywords: hitting set, VC-dimension} }
Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, and Pan Xu. New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 24:1-24:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{brubach_et_al:LIPIcs.ESA.2016.24, author = {Brubach, Brian and Sankararaman, Karthik Abinav and Srinivasan, Aravind and Xu, Pan}, title = {{New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {24:1--24:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.24}, URN = {urn:nbn:de:0030-drops-63753}, doi = {10.4230/LIPIcs.ESA.2016.24}, annote = {Keywords: Ad-Allocation, Online Matching, Randomized Algorithms} }
Jean Cardinal, John Iacono, and Aurélien Ooms. Solving k-SUM Using Few Linear Queries. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 25:1-25:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{cardinal_et_al:LIPIcs.ESA.2016.25, author = {Cardinal, Jean and Iacono, John and Ooms, Aur\'{e}lien}, title = {{Solving k-SUM Using Few Linear Queries}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {25:1--25:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.25}, URN = {urn:nbn:de:0030-drops-63763}, doi = {10.4230/LIPIcs.ESA.2016.25}, annote = {Keywords: k-SUM problem, linear decision trees, point location, \$varepsilon\$-nets} }
Cameron Chalk, Eric Martinez, Robert Schweller, Luis Vega, Andrew Winslow, and Tim Wylie. Optimal Staged Self-Assembly of General Shapes. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 26:1-26:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{chalk_et_al:LIPIcs.ESA.2016.26, author = {Chalk, Cameron and Martinez, Eric and Schweller, Robert and Vega, Luis and Winslow, Andrew and Wylie, Tim}, title = {{Optimal Staged Self-Assembly of General Shapes}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {26:1--26:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.26}, URN = {urn:nbn:de:0030-drops-63776}, doi = {10.4230/LIPIcs.ESA.2016.26}, annote = {Keywords: Tile self-assembly, 2HAM, aTAM, DNA computing, biocomputing} }
Erin Chambers, Irina Kostitsyna, Maarten Löffler, and Frank Staals. Homotopy Measures for Representative Trajectories. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 27:1-27:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{chambers_et_al:LIPIcs.ESA.2016.27, author = {Chambers, Erin and Kostitsyna, Irina and L\"{o}ffler, Maarten and Staals, Frank}, title = {{Homotopy Measures for Representative Trajectories}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {27:1--27:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.27}, URN = {urn:nbn:de:0030-drops-63783}, doi = {10.4230/LIPIcs.ESA.2016.27}, annote = {Keywords: trajectory analysis, representative trajectory, homotopy area} }
Krishnendu Chatterjee, Rasmus Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 28:1-28:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{chatterjee_et_al:LIPIcs.ESA.2016.28, author = {Chatterjee, Krishnendu and Rasmus Ibsen-Jensen, Rasmus and Pavlogiannis, Andreas}, title = {{Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {28:1--28:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.28}, URN = {urn:nbn:de:0030-drops-63797}, doi = {10.4230/LIPIcs.ESA.2016.28}, annote = {Keywords: Graph algorithms, Constant-treewidth graphs, Reachability queries, Distance queries} }
Markus Chimani and Tilo Wiedera. An ILP-based Proof System for the Crossing Number Problem. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 29:1-29:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{chimani_et_al:LIPIcs.ESA.2016.29, author = {Chimani, Markus and Wiedera, Tilo}, title = {{An ILP-based Proof System for the Crossing Number Problem}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {29:1--29:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.29}, URN = {urn:nbn:de:0030-drops-63803}, doi = {10.4230/LIPIcs.ESA.2016.29}, annote = {Keywords: automatic formal proof, crossing number, integer linear programming} }
George Christodoulou, Martin Gairing, Sotiris Nikoletseas, Christoforos Raptopoulos, and Paul Spirakis. Strategic Contention Resolution with Limited Feedback. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 30:1-30:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{christodoulou_et_al:LIPIcs.ESA.2016.30, author = {Christodoulou, George and Gairing, Martin and Nikoletseas, Sotiris and Raptopoulos, Christoforos and Spirakis, Paul}, title = {{Strategic Contention Resolution with Limited Feedback}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {30:1--30:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.30}, URN = {urn:nbn:de:0030-drops-63813}, doi = {10.4230/LIPIcs.ESA.2016.30}, annote = {Keywords: contention resolution, acknowledgment-based protocols, game theory} }
Raphaël Clifford, Markus Jalsenius, and Benjamin Sach. Cell-Probe Lower Bounds for Bit Stream Computation. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 31:1-31:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{clifford_et_al:LIPIcs.ESA.2016.31, author = {Clifford, Rapha\"{e}l and Jalsenius, Markus and Sach, Benjamin}, title = {{Cell-Probe Lower Bounds for Bit Stream Computation}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {31:1--31:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.31}, URN = {urn:nbn:de:0030-drops-63827}, doi = {10.4230/LIPIcs.ESA.2016.31}, annote = {Keywords: Cell-probe lower bounds, algorithms, data streaming} }
Michael Crouch, Andrew McGregor, Gregory Valiant, and David P. Woodruff. Stochastic Streams: Sample Complexity vs. Space Complexity. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 32:1-32:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{crouch_et_al:LIPIcs.ESA.2016.32, author = {Crouch, Michael and McGregor, Andrew and Valiant, Gregory and Woodruff, David P.}, title = {{Stochastic Streams: Sample Complexity vs. Space Complexity}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {32:1--32:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.32}, URN = {urn:nbn:de:0030-drops-63838}, doi = {10.4230/LIPIcs.ESA.2016.32}, annote = {Keywords: data streams, sample complexity, frequency moments, graph connectivity, subspace approximation} }
Radu Curticapean. Counting Matchings with k Unmatched Vertices in Planar Graphs. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 33:1-33:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{curticapean:LIPIcs.ESA.2016.33, author = {Curticapean, Radu}, title = {{Counting Matchings with k Unmatched Vertices in Planar Graphs}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {33:1--33:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.33}, URN = {urn:nbn:de:0030-drops-63847}, doi = {10.4230/LIPIcs.ESA.2016.33}, annote = {Keywords: counting complexity, parameterized complexity, matchings, planar graphs} }
Jean-Lou De Carufel, Matthew J. Katz, Matias Korman, André van Renssen, Marcel Roeloffzen, and Shakhar Smorodinsky. On Interference Among Moving Sensors and Related Problems. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 34:1-34:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{decarufel_et_al:LIPIcs.ESA.2016.34, author = {De Carufel, Jean-Lou and Katz, Matthew J. and Korman, Matias and van Renssen, Andr\'{e} and Roeloffzen, Marcel and Smorodinsky, Shakhar}, title = {{On Interference Among Moving Sensors and Related Problems}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {34:1--34:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.34}, URN = {urn:nbn:de:0030-drops-63850}, doi = {10.4230/LIPIcs.ESA.2016.34}, annote = {Keywords: Range spaces, Voronoi diagrams, moving points, facility location, interference minimization} }
Tamal K. Dey, Dayu Shi, and Yusu Wang. SimBa: An Efficient Tool for Approximating Rips-Filtration Persistence via Simplicial Batch-Collapse. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 35:1-35:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{dey_et_al:LIPIcs.ESA.2016.35, author = {Dey, Tamal K. and Shi, Dayu and Wang, Yusu}, title = {{SimBa: An Efficient Tool for Approximating Rips-Filtration Persistence via Simplicial Batch-Collapse}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {35:1--35:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.35}, URN = {urn:nbn:de:0030-drops-63869}, doi = {10.4230/LIPIcs.ESA.2016.35}, annote = {Keywords: Rips filtration, Homology groups, Persistence, Topological data analysis} }
Andrew Drucker, Jesper Nederlof, and Rahul Santhanam. Exponential Time Paradigms Through the Polynomial Time Lens. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 36:1-36:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{drucker_et_al:LIPIcs.ESA.2016.36, author = {Drucker, Andrew and Nederlof, Jesper and Santhanam, Rahul}, title = {{Exponential Time Paradigms Through the Polynomial Time Lens}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {36:1--36:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.36}, URN = {urn:nbn:de:0030-drops-63871}, doi = {10.4230/LIPIcs.ESA.2016.36}, annote = {Keywords: exponential time paradigms, branching, dynamic programming, lower bounds} }
Christoph Dürr, Christian Konrad, and Marc Renault. On the Power of Advice and Randomization for Online Bipartite Matching. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 37:1-37:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{durr_et_al:LIPIcs.ESA.2016.37, author = {D\"{u}rr, Christoph and Konrad, Christian and Renault, Marc}, title = {{On the Power of Advice and Randomization for Online Bipartite Matching}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {37:1--37:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.37}, URN = {urn:nbn:de:0030-drops-63888}, doi = {10.4230/LIPIcs.ESA.2016.37}, annote = {Keywords: On-line algorithms, Bipartite matching, Randomization} }
Stefan Edelkamp and Armin Weiss. BlockQuicksort: Avoiding Branch Mispredictions in Quicksort. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 38:1-38:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{edelkamp_et_al:LIPIcs.ESA.2016.38, author = {Edelkamp, Stefan and Weiss, Armin}, title = {{BlockQuicksort: Avoiding Branch Mispredictions in Quicksort}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {38:1--38:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.38}, URN = {urn:nbn:de:0030-drops-63890}, doi = {10.4230/LIPIcs.ESA.2016.38}, annote = {Keywords: in-place sorting, Quicksort, branch mispredictions, lean programs} }
Eduard Eiben, Robert Ganian, Kustaa Kangas, and Sebastian Ordyniak. Counting Linear Extensions: Parameterizations by Treewidth. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 39:1-39:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{eiben_et_al:LIPIcs.ESA.2016.39, author = {Eiben, Eduard and Ganian, Robert and Kangas, Kustaa and Ordyniak, Sebastian}, title = {{Counting Linear Extensions: Parameterizations by Treewidth}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {39:1--39:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.39}, URN = {urn:nbn:de:0030-drops-63903}, doi = {10.4230/LIPIcs.ESA.2016.39}, annote = {Keywords: Partially ordered sets, Linear extensions, Parameterized Complexity, Structural parameters, Treewidth} }
Guy Even, Moti Medina, and Adi Rosén. A Constant Approximation Algorithm for Scheduling Packets on Line Networks. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 40:1-40:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{even_et_al:LIPIcs.ESA.2016.40, author = {Even, Guy and Medina, Moti and Ros\'{e}n, Adi}, title = {{A Constant Approximation Algorithm for Scheduling Packets on Line Networks}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {40:1--40:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.40}, URN = {urn:nbn:de:0030-drops-63524}, doi = {10.4230/LIPIcs.ESA.2016.40}, annote = {Keywords: approximation algorithms, linear programming, randomized rounding, packet scheduling, admission control} }
Moran Feldman, Moshe Tennenholtz, and Omri Weinstein. Distributed Signaling Games. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 41:1-41:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{feldman_et_al:LIPIcs.ESA.2016.41, author = {Feldman, Moran and Tennenholtz, Moshe and Weinstein, Omri}, title = {{Distributed Signaling Games}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {41:1--41:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.41}, URN = {urn:nbn:de:0030-drops-63536}, doi = {10.4230/LIPIcs.ESA.2016.41}, annote = {Keywords: Signaling, display advertising, mechanism design, shapley value} }
Krzysztof Fleszar, Matthias Mnich, and Joachim Spoerhase. New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 42:1-42:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{fleszar_et_al:LIPIcs.ESA.2016.42, author = {Fleszar, Krzysztof and Mnich, Matthias and Spoerhase, Joachim}, title = {{New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {42:1--42:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.42}, URN = {urn:nbn:de:0030-drops-63542}, doi = {10.4230/LIPIcs.ESA.2016.42}, annote = {Keywords: disjoint paths, approximation algorithms, feedback vertex set} }
Nathanaël François, Frédéric Magniez, Michel de Rougemont, and Olivier Serre. Streaming Property Testing of Visibly Pushdown Languages. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 43:1-43:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{francois_et_al:LIPIcs.ESA.2016.43, author = {Fran\c{c}ois, Nathana\"{e}l and Magniez, Fr\'{e}d\'{e}ric and de Rougemont, Michel and Serre, Olivier}, title = {{Streaming Property Testing of Visibly Pushdown Languages}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {43:1--43:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.43}, URN = {urn:nbn:de:0030-drops-63559}, doi = {10.4230/LIPIcs.ESA.2016.43}, annote = {Keywords: Streaming Algorithm, Property Testing, Visibly Pushdown Languages} }
Shay Golan, Tsvi Kopelowitz, and Ely Porat. Streaming Pattern Matching with d Wildcards. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 44:1-44:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{golan_et_al:LIPIcs.ESA.2016.44, author = {Golan, Shay and Kopelowitz, Tsvi and Porat, Ely}, title = {{Streaming Pattern Matching with d Wildcards}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {44:1--44:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.44}, URN = {urn:nbn:de:0030-drops-63561}, doi = {10.4230/LIPIcs.ESA.2016.44}, annote = {Keywords: wildcards, don't-cares, streaming pattern matching, fingerprints} }
Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, and Ely Porat. How Hard is it to Find (Honest) Witnesses?. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 45:1-45:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{goldstein_et_al:LIPIcs.ESA.2016.45, author = {Goldstein, Isaac and Kopelowitz, Tsvi and Lewenstein, Moshe and Porat, Ely}, title = {{How Hard is it to Find (Honest) Witnesses?}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {45:1--45:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.45}, URN = {urn:nbn:de:0030-drops-63575}, doi = {10.4230/LIPIcs.ESA.2016.45}, annote = {Keywords: 3SUM, convolutions, matrix multiplication, histogram indexing} }
Gramoz Goranci, Monika Henzinger, and Mikkel Thorup. Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 46:1-46:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{goranci_et_al:LIPIcs.ESA.2016.46, author = {Goranci, Gramoz and Henzinger, Monika and Thorup, Mikkel}, title = {{Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {46:1--46:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.46}, URN = {urn:nbn:de:0030-drops-63584}, doi = {10.4230/LIPIcs.ESA.2016.46}, annote = {Keywords: Dynamic Graph Algorithms, Minimum Cut, Edge Connectivity} }
Sathish Govindarajan, Rajiv Raman, Saurabh Ray, and Aniket Basu Roy. Packing and Covering with Non-Piercing Regions. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 47:1-47:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{govindarajan_et_al:LIPIcs.ESA.2016.47, author = {Govindarajan, Sathish and Raman, Rajiv and Ray, Saurabh and Basu Roy, Aniket}, title = {{Packing and Covering with Non-Piercing Regions}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {47:1--47:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.47}, URN = {urn:nbn:de:0030-drops-63591}, doi = {10.4230/LIPIcs.ESA.2016.47}, annote = {Keywords: Local Search, Set Cover, Dominating Set, Capacitated Packing, Approximation algorithms} }
Monika Henzinger and Stefan Neumann. Incremental and Fully Dynamic Subgraph Connectivity For Emergency Planning. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 48:1-48:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{henzinger_et_al:LIPIcs.ESA.2016.48, author = {Henzinger, Monika and Neumann, Stefan}, title = {{Incremental and Fully Dynamic Subgraph Connectivity For Emergency Planning}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {48:1--48:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.48}, URN = {urn:nbn:de:0030-drops-63607}, doi = {10.4230/LIPIcs.ESA.2016.48}, annote = {Keywords: connectivity, emergency planning, sensitivity} }
Chien-Chung Huang and Sebastian Ott. A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper Edges. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 49:1-49:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{huang_et_al:LIPIcs.ESA.2016.49, author = {Huang, Chien-Chung and Ott, Sebastian}, title = {{A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper Edges}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {49:1--49:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.49}, URN = {urn:nbn:de:0030-drops-63919}, doi = {10.4230/LIPIcs.ESA.2016.49}, annote = {Keywords: Approximation Algorithms, Machine Scheduling, Graph Balancing, Combinatorial Algorithms} }
Lingxiao Huang, Jian Li, Jeff M. Phillips, and Haitao Wang. epsilon-Kernel Coresets for Stochastic Points. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 50:1-50:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{huang_et_al:LIPIcs.ESA.2016.50, author = {Huang, Lingxiao and Li, Jian and Phillips, Jeff M. and Wang, Haitao}, title = {{epsilon-Kernel Coresets for Stochastic Points}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {50:1--50:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.50}, URN = {urn:nbn:de:0030-drops-63921}, doi = {10.4230/LIPIcs.ESA.2016.50}, annote = {Keywords: e-kernel, coreset, stochastic point, shape fitting} }
Hiro Ito. Every Property Is Testable on a Natural Class of Scale-Free Multigraphs. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 51:1-51:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{ito:LIPIcs.ESA.2016.51, author = {Ito, Hiro}, title = {{Every Property Is Testable on a Natural Class of Scale-Free Multigraphs}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {51:1--51:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.51}, URN = {urn:nbn:de:0030-drops-63937}, doi = {10.4230/LIPIcs.ESA.2016.51}, annote = {Keywords: constant-time algorithms, scale-free networks, complex networks, isolated cliques, hyperfinite} }
Matti Karppa, Petteri Kaski, Jukka Kohonen, and Padraig Ó Catháin. Explicit Correlation Amplifiers for Finding Outlier Correlations in Deterministic Subquadratic Time. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 52:1-52:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{karppa_et_al:LIPIcs.ESA.2016.52, author = {Karppa, Matti and Kaski, Petteri and Kohonen, Jukka and \'{O} Cath\'{a}in, Padraig}, title = {{Explicit Correlation Amplifiers for Finding Outlier Correlations in Deterministic Subquadratic Time}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {52:1--52:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.52}, URN = {urn:nbn:de:0030-drops-63944}, doi = {10.4230/LIPIcs.ESA.2016.52}, annote = {Keywords: correlation, derandomization, outlier, similarity search, expander graph} }
Casper Kejlberg-Rasmussen, Tsvi Kopelowitz, Seth Pettie, and Mikkel Thorup. Faster Worst Case Deterministic Dynamic Connectivity. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 53:1-53:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{kejlbergrasmussen_et_al:LIPIcs.ESA.2016.53, author = {Kejlberg-Rasmussen, Casper and Kopelowitz, Tsvi and Pettie, Seth and Thorup, Mikkel}, title = {{Faster Worst Case Deterministic Dynamic Connectivity}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {53:1--53:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.53}, URN = {urn:nbn:de:0030-drops-63953}, doi = {10.4230/LIPIcs.ESA.2016.53}, annote = {Keywords: dynamic graph, spanning tree} }
Thomas Kesselheim and Andreas Tönnis. Think Eternally: Improved Algorithms for the Temp Secretary Problem and Extensions. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 54:1-54:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{kesselheim_et_al:LIPIcs.ESA.2016.54, author = {Kesselheim, Thomas and T\"{o}nnis, Andreas}, title = {{Think Eternally: Improved Algorithms for the Temp Secretary Problem and Extensions}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {54:1--54:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.54}, URN = {urn:nbn:de:0030-drops-63966}, doi = {10.4230/LIPIcs.ESA.2016.54}, annote = {Keywords: Secretary Problem, Online Algorithms, Scheduling Problems} }
Subhash Khot and Rishi Saket. Hardness of Bipartite Expansion. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 55:1-55:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{khot_et_al:LIPIcs.ESA.2016.55, author = {Khot, Subhash and Saket, Rishi}, title = {{Hardness of Bipartite Expansion}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {55:1--55:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.55}, URN = {urn:nbn:de:0030-drops-63971}, doi = {10.4230/LIPIcs.ESA.2016.55}, annote = {Keywords: inapproximability, bipartite expansion, PCP, submodular minimization} }
Lasse Kliemann, Christian Schielke, and Anand Srivastav. A Streaming Algorithm for the Undirected Longest Path Problem. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 56:1-56:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{kliemann_et_al:LIPIcs.ESA.2016.56, author = {Kliemann, Lasse and Schielke, Christian and Srivastav, Anand}, title = {{A Streaming Algorithm for the Undirected Longest Path Problem}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {56:1--56:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.56}, URN = {urn:nbn:de:0030-drops-63980}, doi = {10.4230/LIPIcs.ESA.2016.56}, annote = {Keywords: Streaming Algorithms, Undirected Longest Path Problem, Graph Algorithms, Combinatorial Optimization} }
Pavel Kolev and Kurt Mehlhorn. A Note On Spectral Clustering. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 57:1-57:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{kolev_et_al:LIPIcs.ESA.2016.57, author = {Kolev, Pavel and Mehlhorn, Kurt}, title = {{A Note On Spectral Clustering}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {57:1--57:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.57}, URN = {urn:nbn:de:0030-drops-63994}, doi = {10.4230/LIPIcs.ESA.2016.57}, annote = {Keywords: spectral embedding, k-means clustering, power method, gap assumption} }
Lukasz Kowalik, Juho Lauri, and Arkadiusz Socala. On the Fine-Grained Complexity of Rainbow Coloring. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 58:1-58:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{kowalik_et_al:LIPIcs.ESA.2016.58, author = {Kowalik, Lukasz and Lauri, Juho and Socala, Arkadiusz}, title = {{On the Fine-Grained Complexity of Rainbow Coloring}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {58:1--58:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.58}, URN = {urn:nbn:de:0030-drops-64001}, doi = {10.4230/LIPIcs.ESA.2016.58}, annote = {Keywords: graph coloring, computational complexity, lower bounds, exponential time hypothesis, FPT algorithms} }
Stefan Kratsch. A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 59:1-59:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{kratsch:LIPIcs.ESA.2016.59, author = {Kratsch, Stefan}, title = {{A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {59:1--59:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.59}, URN = {urn:nbn:de:0030-drops-64066}, doi = {10.4230/LIPIcs.ESA.2016.59}, annote = {Keywords: Vertex cover, parameterized complexity, kernelization} }
Adam Kunysz. The Strongly Stable Roommates Problem. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 60:1-60:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{kunysz:LIPIcs.ESA.2016.60, author = {Kunysz, Adam}, title = {{The Strongly Stable Roommates Problem}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {60:1--60:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.60}, URN = {urn:nbn:de:0030-drops-64012}, doi = {10.4230/LIPIcs.ESA.2016.60}, annote = {Keywords: strongly stable matching, stable roommates, rotations, matching theory} }
Juha Kärkkäinen and Dominik Kempa. Faster External Memory LCP Array Construction. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 61:1-61:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{karkkainen_et_al:LIPIcs.ESA.2016.61, author = {K\"{a}rkk\"{a}inen, Juha and Kempa, Dominik}, title = {{Faster External Memory LCP Array Construction}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {61:1--61:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.61}, URN = {urn:nbn:de:0030-drops-64026}, doi = {10.4230/LIPIcs.ESA.2016.61}, annote = {Keywords: LCP array, suffix array, external memory algorithms} }
Jian Li and Wei Zhan. Almost All Even Yao-Yao Graphs Are Spanners. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 62:1-62:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{li_et_al:LIPIcs.ESA.2016.62, author = {Li, Jian and Zhan, Wei}, title = {{Almost All Even Yao-Yao Graphs Are Spanners}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {62:1--62:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.62}, URN = {urn:nbn:de:0030-drops-64033}, doi = {10.4230/LIPIcs.ESA.2016.62}, annote = {Keywords: Yao-Yao graph, geometric spanner, curved trapezoid} }
Giorgio Lucarelli, Nguyen Kim Thang, Abhinav Srivastav, and Denis Trystram. Online Non-Preemptive Scheduling in a Resource Augmentation Model Based on Duality. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 63:1-63:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{lucarelli_et_al:LIPIcs.ESA.2016.63, author = {Lucarelli, Giorgio and Kim Thang, Nguyen and Srivastav, Abhinav and Trystram, Denis}, title = {{Online Non-Preemptive Scheduling in a Resource Augmentation Model Based on Duality}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {63:1--63:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.63}, URN = {urn:nbn:de:0030-drops-64047}, doi = {10.4230/LIPIcs.ESA.2016.63}, annote = {Keywords: Online algorithms, Non-preemptive scheduling, Resource augmentation, Primal-dual} }
Clément Maria and Jonathan Spreer. Admissible Colourings of 3-Manifold Triangulations for Turaev-Viro Type Invariants. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 64:1-64:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{maria_et_al:LIPIcs.ESA.2016.64, author = {Maria, Cl\'{e}ment and Spreer, Jonathan}, title = {{Admissible Colourings of 3-Manifold Triangulations for Turaev-Viro Type Invariants}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {64:1--64:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.64}, URN = {urn:nbn:de:0030-drops-64050}, doi = {10.4230/LIPIcs.ESA.2016.64}, annote = {Keywords: low-dimensional topology, triangulations of 3-manifolds, cohomology theory, Turaev-Viro invariants, combinatorial algorithms} }
Ruta Mehta, Ioannis Panageas, Georgios Piliouras, and Sadra Yazdanbod. The Computational Complexity of Genetic Diversity. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 65:1-65:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{mehta_et_al:LIPIcs.ESA.2016.65, author = {Mehta, Ruta and Panageas, Ioannis and Piliouras, Georgios and Yazdanbod, Sadra}, title = {{The Computational Complexity of Genetic Diversity}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {65:1--65:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.65}, URN = {urn:nbn:de:0030-drops-64073}, doi = {10.4230/LIPIcs.ESA.2016.65}, annote = {Keywords: Dynamical Systems, Stability, Complexity, Optimization, Equilibrium} }
Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Günter Rote, Antonis Thomas, and Takeaki Uno. Approximation and Hardness of Token Swapping. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 66:1-66:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{miltzow_et_al:LIPIcs.ESA.2016.66, author = {Miltzow, Tillmann and Narins, Lothar and Okamoto, Yoshio and Rote, G\"{u}nter and Thomas, Antonis and Uno, Takeaki}, title = {{Approximation and Hardness of Token Swapping}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {66:1--66:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.66}, URN = {urn:nbn:de:0030-drops-64084}, doi = {10.4230/LIPIcs.ESA.2016.66}, annote = {Keywords: token swapping, minimum generator sequence, graph theory, NP-hardness, approximation algorithms} }
Matthias Mnich, Virginia Vassilevska Williams, and László A. Végh. A 7/3-Approximation for Feedback Vertex Sets in Tournaments. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 67:1-67:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{mnich_et_al:LIPIcs.ESA.2016.67, author = {Mnich, Matthias and Vassilevska Williams, Virginia and V\'{e}gh, L\'{a}szl\'{o} A.}, title = {{A 7/3-Approximation for Feedback Vertex Sets in Tournaments}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {67:1--67:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.67}, URN = {urn:nbn:de:0030-drops-64098}, doi = {10.4230/LIPIcs.ESA.2016.67}, annote = {Keywords: Approximation algorithms, feedback vertex sets, tournaments} }
Riley Murray, Megan Chao, and Samir Khuller. Scheduling Distributed Clusters of Parallel Machines: Primal-Dual and LP-based Approximation Algorithms. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 68:1-68:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{murray_et_al:LIPIcs.ESA.2016.68, author = {Murray, Riley and Chao, Megan and Khuller, Samir}, title = {{Scheduling Distributed Clusters of Parallel Machines: Primal-Dual and LP-based Approximation Algorithms}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {68:1--68:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.68}, URN = {urn:nbn:de:0030-drops-64104}, doi = {10.4230/LIPIcs.ESA.2016.68}, annote = {Keywords: approximation algorithms, distributed computing, machine scheduling, LP relaxations, primal-dual algorithms} }
Jesper Nederlof. Finding Large Set Covers Faster via the Representation Method. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 69:1-69:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{nederlof:LIPIcs.ESA.2016.69, author = {Nederlof, Jesper}, title = {{Finding Large Set Covers Faster via the Representation Method}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {69:1--69:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.69}, URN = {urn:nbn:de:0030-drops-64114}, doi = {10.4230/LIPIcs.ESA.2016.69}, annote = {Keywords: Set Cover, Exact Exponential Algorithms, Fine-Grained Complexity} }
Daniel Neuen. Graph Isomorphism for Unit Square Graphs. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 70:1-70:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{neuen:LIPIcs.ESA.2016.70, author = {Neuen, Daniel}, title = {{Graph Isomorphism for Unit Square Graphs}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {70:1--70:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.70}, URN = {urn:nbn:de:0030-drops-64120}, doi = {10.4230/LIPIcs.ESA.2016.70}, annote = {Keywords: graph isomorphism, geometric graphs, unit squares} }
Alantha Newman, Heiko Röglin, and Johanna Seif. The Alternating Stock Size Problem and the Gasoline Puzzle. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 71:1-71:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{newman_et_al:LIPIcs.ESA.2016.71, author = {Newman, Alantha and R\"{o}glin, Heiko and Seif, Johanna}, title = {{The Alternating Stock Size Problem and the Gasoline Puzzle}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {71:1--71:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.71}, URN = {urn:nbn:de:0030-drops-64134}, doi = {10.4230/LIPIcs.ESA.2016.71}, annote = {Keywords: approximation algorithms, stock size problem, scheduling with non-renewable resources} }
Ely Porat, Eduard Shahbazian, and Roei Tov. New Parameterized Algorithms for APSP in Directed Graphs. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 72:1-72:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{porat_et_al:LIPIcs.ESA.2016.72, author = {Porat, Ely and Shahbazian, Eduard and Tov, Roei}, title = {{New Parameterized Algorithms for APSP in Directed Graphs}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {72:1--72:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.72}, URN = {urn:nbn:de:0030-drops-64207}, doi = {10.4230/LIPIcs.ESA.2016.72}, annote = {Keywords: Graphs, distances, APSP, fast matrix multiplication} }
Dror Rawitz and Adi Rosén. Online Budgeted Maximum Coverage. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 73:1-73:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{rawitz_et_al:LIPIcs.ESA.2016.73, author = {Rawitz, Dror and Ros\'{e}n, Adi}, title = {{Online Budgeted Maximum Coverage}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {73:1--73:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.73}, URN = {urn:nbn:de:0030-drops-64146}, doi = {10.4230/LIPIcs.ESA.2016.73}, annote = {Keywords: budgeted coverage, maximum coverage, online algorithms, competitive analysis, removable online knapsack} }
Andreas S. Schulz and José Verschae. Min-Sum Scheduling Under Precedence Constraints. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 74:1-74:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{schulz_et_al:LIPIcs.ESA.2016.74, author = {Schulz, Andreas S. and Verschae, Jos\'{e}}, title = {{Min-Sum Scheduling Under Precedence Constraints}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {74:1--74:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.74}, URN = {urn:nbn:de:0030-drops-64157}, doi = {10.4230/LIPIcs.ESA.2016.74}, annote = {Keywords: scheduling, approximation algorithms, linear programming relaxations, precedence constraints} }
Chris Schwiegelshohn and Uwe Schwiegelshohn. The Power of Migration for Online Slack Scheduling. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 75:1-75:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{schwiegelshohn_et_al:LIPIcs.ESA.2016.75, author = {Schwiegelshohn, Chris and Schwiegelshohn, Uwe}, title = {{The Power of Migration for Online Slack Scheduling}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {75:1--75:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.75}, URN = {urn:nbn:de:0030-drops-64162}, doi = {10.4230/LIPIcs.ESA.2016.75}, annote = {Keywords: Online scheduling, deadlines, preemption with migration, competitive analysis} }
Kiril Solovey and Dan Halperin. Sampling-Based Bottleneck Pathfinding with Applications to Fréchet Matching. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 76:1-76:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{solovey_et_al:LIPIcs.ESA.2016.76, author = {Solovey, Kiril and Halperin, Dan}, title = {{Sampling-Based Bottleneck Pathfinding with Applications to Fr\'{e}chet Matching}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {76:1--76:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.76}, URN = {urn:nbn:de:0030-drops-64179}, doi = {10.4230/LIPIcs.ESA.2016.76}, annote = {Keywords: Computational geometry, Fr\'{e}chet distances, sampling-based algorithms, random geometric graphs, bottleneck pathfinding} }
Haitao Wang. On the Geodesic Centers of Polygonal Domains. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 77:1-77:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{wang:LIPIcs.ESA.2016.77, author = {Wang, Haitao}, title = {{On the Geodesic Centers of Polygonal Domains}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {77:1--77:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.77}, URN = {urn:nbn:de:0030-drops-64189}, doi = {10.4230/LIPIcs.ESA.2016.77}, annote = {Keywords: geodesic centers, shortest paths, polygonal domains} }
Tim Roughgarden and Joshua R. Wang. The Complexity of the k-means Method. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 78:1-78:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{roughgarden_et_al:LIPIcs.ESA.2016.78, author = {Roughgarden, Tim and Wang, Joshua R.}, title = {{The Complexity of the k-means Method}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {78:1--78:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.78}, URN = {urn:nbn:de:0030-drops-64191}, doi = {10.4230/LIPIcs.ESA.2016.78}, annote = {Keywords: k-means, PSPACE-complete} }
Feedback for Dagstuhl Publishing