Kirk Pruhs and Christian Sohler. LIPIcs, Volume 87, ESA'17, Complete Volume. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@Proceedings{pruhs_et_al:LIPIcs.ESA.2017, title = {{LIPIcs, Volume 87, ESA'17, Complete Volume}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017}, URN = {urn:nbn:de:0030-drops-79096}, doi = {10.4230/LIPIcs.ESA.2017}, annote = {Keywords: Data Structures, Nonnumerical Algorithms and Problems, Optimization, Discrete Mathematics, Mathematical Software, AlgorithmsProblem Solving, Control Methods, and Search, Computational Geometry and Object Modeling} }
Kirk Pruhs and Christian Sohler. Front Matter, Table of Contents, Preface, Programm Commitees, External Reviewers. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 0:i-0:xx, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{pruhs_et_al:LIPIcs.ESA.2017.0, author = {Pruhs, Kirk and Sohler, Christian}, title = {{Front Matter, Table of Contents, Preface, Programm Commitees, External Reviewers}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {0:i--0:xx}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.0}, URN = {urn:nbn:de:0030-drops-78147}, doi = {10.4230/LIPIcs.ESA.2017.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Programm Commitees, External Reviewers} }
David P. Woodruff. Sketching for Geometric Problems (Invited Talk). In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 1:1-1:5, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{woodruff:LIPIcs.ESA.2017.1, author = {Woodruff, David P.}, title = {{Sketching for Geometric Problems}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {1:1--1:5}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.1}, URN = {urn:nbn:de:0030-drops-78848}, doi = {10.4230/LIPIcs.ESA.2017.1}, annote = {Keywords: dimensionality reduction, low rank approximation, projection, regression, sketching} }
Peyman Afshani and Ingo van Duijn. Permuting and Batched Geometric Lower Bounds in the I/O Model. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 2:1-2:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{afshani_et_al:LIPIcs.ESA.2017.2, author = {Afshani, Peyman and van Duijn, Ingo}, title = {{Permuting and Batched Geometric Lower Bounds in the I/O Model}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {2:1--2:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.2}, URN = {urn:nbn:de:0030-drops-78695}, doi = {10.4230/LIPIcs.ESA.2017.2}, annote = {Keywords: I/O Model, Batched Geometric Queries, Lower Bounds, Permuting} }
Peyman Afshani and Zhewei Wei. Independent Range Sampling, Revisited. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 3:1-3:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{afshani_et_al:LIPIcs.ESA.2017.3, author = {Afshani, Peyman and Wei, Zhewei}, title = {{Independent Range Sampling, Revisited}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {3:1--3:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.3}, URN = {urn:nbn:de:0030-drops-78592}, doi = {10.4230/LIPIcs.ESA.2017.3}, annote = {Keywords: data structures, range searching, range sampling, random sampling} }
Pankaj K. Agarwal, Natan Rubin, and Micha Sharir. Approximate Nearest Neighbor Search Amid Higher-Dimensional Flats. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 4:1-4:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{agarwal_et_al:LIPIcs.ESA.2017.4, author = {Agarwal, Pankaj K. and Rubin, Natan and Sharir, Micha}, title = {{Approximate Nearest Neighbor Search Amid Higher-Dimensional Flats}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {4:1--4:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.4}, URN = {urn:nbn:de:0030-drops-78182}, doi = {10.4230/LIPIcs.ESA.2017.4}, annote = {Keywords: Approximate nearest neighbor search, k-flats, Polyhedral distance functions, Linear programming queries} }
Dror Aiger, Haim Kaplan, and Micha Sharir. Output Sensitive Algorithms for Approximate Incidences and Their Applications. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 5:1-5:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{aiger_et_al:LIPIcs.ESA.2017.5, author = {Aiger, Dror and Kaplan, Haim and Sharir, Micha}, title = {{Output Sensitive Algorithms for Approximate Incidences and Their Applications}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {5:1--5:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.5}, URN = {urn:nbn:de:0030-drops-78224}, doi = {10.4230/LIPIcs.ESA.2017.5}, annote = {Keywords: Approximate incidences, near-neighbor reporting, duality, grid-based approximation} }
Hassene Aissi, Ali Ridha Mahjoub, and R. Ravi. Randomized Contractions for Multiobjective Minimum Cuts. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 6:1-6:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{aissi_et_al:LIPIcs.ESA.2017.6, author = {Aissi, Hassene and Mahjoub, Ali Ridha and Ravi, R.}, title = {{Randomized Contractions for Multiobjective Minimum Cuts}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {6:1--6:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.6}, URN = {urn:nbn:de:0030-drops-78686}, doi = {10.4230/LIPIcs.ESA.2017.6}, annote = {Keywords: minimum cut, multiobjective optimization, budget constraints, graph algorithms, randomized algorithms} }
Susanne Albers and Sebastian Schraink. Tight Bounds for Online Coloring of Basic Graph Classes. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 7:1-7:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{albers_et_al:LIPIcs.ESA.2017.7, author = {Albers, Susanne and Schraink, Sebastian}, title = {{Tight Bounds for Online Coloring of Basic Graph Classes}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {7:1--7:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.7}, URN = {urn:nbn:de:0030-drops-78268}, doi = {10.4230/LIPIcs.ESA.2017.7}, annote = {Keywords: graph coloring, online algorithms, lower bounds, randomization} }
Daniel Antunes, Claire Mathieu, and Nabil H. Mustafa. Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 8:1-8:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{antunes_et_al:LIPIcs.ESA.2017.8, author = {Antunes, Daniel and Mathieu, Claire and Mustafa, Nabil H.}, title = {{Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {8:1--8:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.8}, URN = {urn:nbn:de:0030-drops-78293}, doi = {10.4230/LIPIcs.ESA.2017.8}, annote = {Keywords: Planar graphs, Local search, Hall's theorem, Combinatorial optimization, Expansion} }
Michael Axtmann, Sascha Witt, Daniel Ferizovic, and Peter Sanders. In-Place Parallel Super Scalar Samplesort (IPSSSSo). In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 9:1-9:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{axtmann_et_al:LIPIcs.ESA.2017.9, author = {Axtmann, Michael and Witt, Sascha and Ferizovic, Daniel and Sanders, Peter}, title = {{In-Place Parallel Super Scalar Samplesort (IPSSSSo)}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {9:1--9:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.9}, URN = {urn:nbn:de:0030-drops-78542}, doi = {10.4230/LIPIcs.ESA.2017.9}, annote = {Keywords: shared memory, parallel sorting, in-place algorithm, comparison-based sorting, branch prediction} }
Janos Balogh, Jozsef Bekesi, Gyorgy Dosa, Leah Epstein, and Asaf Levin. Online Bin Packing with Cardinality Constraints Resolved. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 10:1-10:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{balogh_et_al:LIPIcs.ESA.2017.10, author = {Balogh, Janos and Bekesi, Jozsef and Dosa, Gyorgy and Epstein, Leah and Levin, Asaf}, title = {{Online Bin Packing with Cardinality Constraints Resolved}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {10:1--10:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.10}, URN = {urn:nbn:de:0030-drops-78514}, doi = {10.4230/LIPIcs.ESA.2017.10}, annote = {Keywords: Online algorithms, bin packing, cardinality constraints, lower bounds} }
Moritz Baum, Julian Dibbelt, Dorothea Wagner, and Tobias Zündorf. Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 11:1-11:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{baum_et_al:LIPIcs.ESA.2017.11, author = {Baum, Moritz and Dibbelt, Julian and Wagner, Dorothea and Z\"{u}ndorf, Tobias}, title = {{Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {11:1--11:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.11}, URN = {urn:nbn:de:0030-drops-78672}, doi = {10.4230/LIPIcs.ESA.2017.11}, annote = {Keywords: electric vehicles, constrained shortest paths, algorithm engineering} }
Amariah Becker, Philip N. Klein, and David Saulpic. A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 12:1-12:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{becker_et_al:LIPIcs.ESA.2017.12, author = {Becker, Amariah and Klein, Philip N. and Saulpic, David}, title = {{A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {12:1--12:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.12}, URN = {urn:nbn:de:0030-drops-78781}, doi = {10.4230/LIPIcs.ESA.2017.12}, annote = {Keywords: Capacitated Vehicle Routing, Approximation Algorithms, Planar Graphs} }
Kristof Berczi and Yusuke Kobayashi. The Directed Disjoint Shortest Paths Problem. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 13:1-13:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{berczi_et_al:LIPIcs.ESA.2017.13, author = {Berczi, Kristof and Kobayashi, Yusuke}, title = {{The Directed Disjoint Shortest Paths Problem}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {13:1--13:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.13}, URN = {urn:nbn:de:0030-drops-78246}, doi = {10.4230/LIPIcs.ESA.2017.13}, annote = {Keywords: Disjoint paths, shortest path, polynomial time algorithm} }
Stéphane Bessy, Marin Bougeret, and Jocelyn Thiebaut. Triangle Packing in (Sparse) Tournaments: Approximation and Kernelization. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 14:1-14:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{bessy_et_al:LIPIcs.ESA.2017.14, author = {Bessy, St\'{e}phane and Bougeret, Marin and Thiebaut, Jocelyn}, title = {{Triangle Packing in (Sparse) Tournaments: Approximation and Kernelization}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {14:1--14:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.14}, URN = {urn:nbn:de:0030-drops-78622}, doi = {10.4230/LIPIcs.ESA.2017.14}, annote = {Keywords: Tournament Triangle packing, Feedback arc set, Approximation algorithms, Parameterized algorithms} }
Sayan Bhattacharya, Manoj Gupta, and Divyarthi Mohan. Improved Algorithm for Dynamic b-Matching. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 15:1-15:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{bhattacharya_et_al:LIPIcs.ESA.2017.15, author = {Bhattacharya, Sayan and Gupta, Manoj and Mohan, Divyarthi}, title = {{Improved Algorithm for Dynamic b-Matching}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {15:1--15:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.15}, URN = {urn:nbn:de:0030-drops-78443}, doi = {10.4230/LIPIcs.ESA.2017.15}, annote = {Keywords: dynamic data structures, graph algorithms} }
Philip Bille, Anders Roy Christiansen, Mikko Berggren Ettienne, and Inge Li Gørtz. Fast Dynamic Arrays. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 16:1-16:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{bille_et_al:LIPIcs.ESA.2017.16, author = {Bille, Philip and Christiansen, Anders Roy and Ettienne, Mikko Berggren and G{\o}rtz, Inge Li}, title = {{Fast Dynamic Arrays}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {16:1--16:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.16}, URN = {urn:nbn:de:0030-drops-78309}, doi = {10.4230/LIPIcs.ESA.2017.16}, annote = {Keywords: Dynamic Arrays, Tiered Vectors} }
Vittorio Bilò and Cosimo Vinci. On the Impact of Singleton Strategies in Congestion Games. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 17:1-17:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{bilo_et_al:LIPIcs.ESA.2017.17, author = {Bil\`{o}, Vittorio and Vinci, Cosimo}, title = {{On the Impact of Singleton Strategies in Congestion Games}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {17:1--17:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.17}, URN = {urn:nbn:de:0030-drops-78576}, doi = {10.4230/LIPIcs.ESA.2017.17}, annote = {Keywords: Congestion games, Nash equilibrium, price of anarchy, online load balancing, greedy algorithms} }
Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, and Marcin Wrochna. Tight Lower Bounds for the Complexity of Multicoloring. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 18:1-18:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{bonamy_et_al:LIPIcs.ESA.2017.18, author = {Bonamy, Marthe and Kowalik, Lukasz and Pilipczuk, Michal and Socala, Arkadiusz and Wrochna, Marcin}, title = {{Tight Lower Bounds for the Complexity of Multicoloring}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {18:1--18:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.18}, URN = {urn:nbn:de:0030-drops-78527}, doi = {10.4230/LIPIcs.ESA.2017.18}, annote = {Keywords: multicoloring, Kneser graph homomorphism, ETH lower bound} }
Thomas Bosman and Neil Olver. Exploring the Tractability of the Capped Hose Model. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 19:1-19:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{bosman_et_al:LIPIcs.ESA.2017.19, author = {Bosman, Thomas and Olver, Neil}, title = {{Exploring the Tractability of the Capped Hose Model}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {19:1--19:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.19}, URN = {urn:nbn:de:0030-drops-78663}, doi = {10.4230/LIPIcs.ESA.2017.19}, annote = {Keywords: robust network design, VPN problem} }
Karl Bringmann, Ralph Keusch, and Johannes Lengler. Sampling Geometric Inhomogeneous Random Graphs in Linear Time. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 20:1-20:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{bringmann_et_al:LIPIcs.ESA.2017.20, author = {Bringmann, Karl and Keusch, Ralph and Lengler, Johannes}, title = {{Sampling Geometric Inhomogeneous Random Graphs in Linear Time}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {20:1--20:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.20}, URN = {urn:nbn:de:0030-drops-78396}, doi = {10.4230/LIPIcs.ESA.2017.20}, annote = {Keywords: real-world networks, random graph models, sampling algorithms, compression algorithms, hyperbolic random graphs} }
Gerth Stølting Brodal and Konstantinos Mampentzidis. Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 21:1-21:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{stoltingbrodal_et_al:LIPIcs.ESA.2017.21, author = {St{\o}lting Brodal, Gerth and Mampentzidis, Konstantinos}, title = {{Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {21:1--21:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.21}, URN = {urn:nbn:de:0030-drops-78820}, doi = {10.4230/LIPIcs.ESA.2017.21}, annote = {Keywords: Phylogenetic tree, tree comparison, triplet distance, cache oblivious algorithm} }
Niv Buchbinder, Danny Segev, and Yevgeny Tkach. Online Algorithms for Maximum Cardinality Matching with Edge Arrivals. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 22:1-22:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{buchbinder_et_al:LIPIcs.ESA.2017.22, author = {Buchbinder, Niv and Segev, Danny and Tkach, Yevgeny}, title = {{Online Algorithms for Maximum Cardinality Matching with Edge Arrivals}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {22:1--22:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.22}, URN = {urn:nbn:de:0030-drops-78206}, doi = {10.4230/LIPIcs.ESA.2017.22}, annote = {Keywords: Maximum matching, online algorithms, competitive analysis, primal-dual method} }
Benjamin Burton, Erin Chambers, Marc van Kreveld, Wouter Meulemans, Tim Ophelders, and Bettina Speckmann. Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 23:1-23:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{burton_et_al:LIPIcs.ESA.2017.23, author = {Burton, Benjamin and Chambers, Erin and van Kreveld, Marc and Meulemans, Wouter and Ophelders, Tim and Speckmann, Bettina}, title = {{Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {23:1--23:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.23}, URN = {urn:nbn:de:0030-drops-78630}, doi = {10.4230/LIPIcs.ESA.2017.23}, annote = {Keywords: Fr\'{e}chet distance, polygonal domain, homotopy, geodesic, obstacle} }
T.-H. Hubert Chan, Shaofeng H.-C. Jiang, Zhihao Gavin Tang, and Xiaowei Wu. Online Submodular Maximization Problem with Vector Packing Constraint. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 24:1-24:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{chan_et_al:LIPIcs.ESA.2017.24, author = {Chan, T.-H. Hubert and Jiang, Shaofeng H.-C. and Tang, Zhihao Gavin and Wu, Xiaowei}, title = {{Online Submodular Maximization Problem with Vector Packing Constraint}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {24:1--24:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.24}, URN = {urn:nbn:de:0030-drops-78190}, doi = {10.4230/LIPIcs.ESA.2017.24}, annote = {Keywords: Submodular Maximization, Free-disposal, Vector Packing} }
Timothy M. Chan and Dimitrios Skrepetos. Faster Approximate Diameter and Distance Oracles in Planar Graphs. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 25:1-25:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{chan_et_al:LIPIcs.ESA.2017.25, author = {Chan, Timothy M. and Skrepetos, Dimitrios}, title = {{Faster Approximate Diameter and Distance Oracles in Planar Graphs}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {25:1--25:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.25}, URN = {urn:nbn:de:0030-drops-78382}, doi = {10.4230/LIPIcs.ESA.2017.25}, annote = {Keywords: planar graphs, diameter, abstract Voronoi diagrams} }
Vaggos Chatziafratis, Tim Roughgarden, and Jan Vondrak. Stability and Recovery for Independence Systems. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 26:1-26:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{chatziafratis_et_al:LIPIcs.ESA.2017.26, author = {Chatziafratis, Vaggos and Roughgarden, Tim and Vondrak, Jan}, title = {{Stability and Recovery for Independence Systems}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {26:1--26:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.26}, URN = {urn:nbn:de:0030-drops-78423}, doi = {10.4230/LIPIcs.ESA.2017.26}, annote = {Keywords: Submodular, approximation, stability, Local Search, Greedy, p-systems} }
Peter Chini, Jonathan Kolberg, Andreas Krebs, Roland Meyer, and Prakash Saivasan. On the Complexity of Bounded Context Switching. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 27:1-27:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{chini_et_al:LIPIcs.ESA.2017.27, author = {Chini, Peter and Kolberg, Jonathan and Krebs, Andreas and Meyer, Roland and Saivasan, Prakash}, title = {{On the Complexity of Bounded Context Switching}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {27:1--27:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.27}, URN = {urn:nbn:de:0030-drops-78730}, doi = {10.4230/LIPIcs.ESA.2017.27}, annote = {Keywords: Shared memory concurrency, safety verification, fixed-parameter tractability, exponential time hypothesis, bounded context switching} }
Aruni Choudhary, Michael Kerber, and Sharath Raghvendra. Improved Approximate Rips Filtrations with Shifted Integer Lattices. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 28:1-28:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{choudhary_et_al:LIPIcs.ESA.2017.28, author = {Choudhary, Aruni and Kerber, Michael and Raghvendra, Sharath}, title = {{Improved Approximate Rips Filtrations with Shifted Integer Lattices}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {28:1--28:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.28}, URN = {urn:nbn:de:0030-drops-78259}, doi = {10.4230/LIPIcs.ESA.2017.28}, annote = {Keywords: Persistent homology, Rips filtrations, Approximation algorithms, Topological Data Analysis} }
Graham Cormode, Hossein Jowhari, Morteza Monemizadeh, and S. Muthukrishnan. The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 29:1-29:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{cormode_et_al:LIPIcs.ESA.2017.29, author = {Cormode, Graham and Jowhari, Hossein and Monemizadeh, Morteza and Muthukrishnan, S.}, title = {{The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {29:1--29:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.29}, URN = {urn:nbn:de:0030-drops-78499}, doi = {10.4230/LIPIcs.ESA.2017.29}, annote = {Keywords: streaming algorithms, matching size} }
Marek Cygan, Lukasz Kowalik, and Arkadiusz Socala. Improving TSP Tours Using Dynamic Programming over Tree Decompositions. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 30:1-30:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{cygan_et_al:LIPIcs.ESA.2017.30, author = {Cygan, Marek and Kowalik, Lukasz and Socala, Arkadiusz}, title = {{Improving TSP Tours Using Dynamic Programming over Tree Decompositions}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {30:1--30:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.30}, URN = {urn:nbn:de:0030-drops-78539}, doi = {10.4230/LIPIcs.ESA.2017.30}, annote = {Keywords: TSP, treewidth, local search, XP algorithm, hardness in P} }
Syamantak Das and Andreas Wiese. On Minimizing the Makespan When Some Jobs Cannot Be Assigned on the Same Machine. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 31:1-31:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{das_et_al:LIPIcs.ESA.2017.31, author = {Das, Syamantak and Wiese, Andreas}, title = {{On Minimizing the Makespan When Some Jobs Cannot Be Assigned on the Same Machine}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {31:1--31:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.31}, URN = {urn:nbn:de:0030-drops-78453}, doi = {10.4230/LIPIcs.ESA.2017.31}, annote = {Keywords: approximation algorithms, scheduling, makespan minimization} }
Constantinos Daskalakis and Yasushi Kawase. Optimal Stopping Rules for Sequential Hypothesis Testing. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 32:1-32:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{daskalakis_et_al:LIPIcs.ESA.2017.32, author = {Daskalakis, Constantinos and Kawase, Yasushi}, title = {{Optimal Stopping Rules for Sequential Hypothesis Testing}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {32:1--32:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.32}, URN = {urn:nbn:de:0030-drops-78237}, doi = {10.4230/LIPIcs.ESA.2017.32}, annote = {Keywords: property testing, sequential hypothesis testing, A/B testing} }
William E. Devanny, Jeremy T. Fineman, Michael T. Goodrich, and Tsvi Kopelowitz. The Online House Numbering Problem: Min-Max Online List Labeling. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 33:1-33:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{devanny_et_al:LIPIcs.ESA.2017.33, author = {Devanny, William E. and Fineman, Jeremy T. and Goodrich, Michael T. and Kopelowitz, Tsvi}, title = {{The Online House Numbering Problem: Min-Max Online List Labeling}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {33:1--33:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.33}, URN = {urn:nbn:de:0030-drops-78831}, doi = {10.4230/LIPIcs.ESA.2017.33}, annote = {Keywords: house numbering, list labeling, file maintenance} }
Tamal K. Dey, Alfred Rossi, and Anastasios Sidiropoulos. Temporal Clustering. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 34:1-34:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{dey_et_al:LIPIcs.ESA.2017.34, author = {Dey, Tamal K. and Rossi, Alfred and Sidiropoulos, Anastasios}, title = {{Temporal Clustering}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {34:1--34:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.34}, URN = {urn:nbn:de:0030-drops-78567}, doi = {10.4230/LIPIcs.ESA.2017.34}, annote = {Keywords: clustering, multi-objective optimization, dynamic metric spaces, moving point sets, approximation algorithms, hardness of approximation} }
Alon Eden, Tomer Ezra, and Michal Feldman. Pricing Social Goods. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 35:1-35:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{eden_et_al:LIPIcs.ESA.2017.35, author = {Eden, Alon and Ezra, Tomer and Feldman, Michal}, title = {{Pricing Social Goods}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {35:1--35:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.35}, URN = {urn:nbn:de:0030-drops-78717}, doi = {10.4230/LIPIcs.ESA.2017.35}, annote = {Keywords: Public Goods, Posted Prices, Revenue Maximization, Externalities} }
Katherine Edwards, Irene Muzi, and Paul Wollan. Half-Integral Linkages in Highly Connected Directed Graphs. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 36:1-36:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{edwards_et_al:LIPIcs.ESA.2017.36, author = {Edwards, Katherine and Muzi, Irene and Wollan, Paul}, title = {{Half-Integral Linkages in Highly Connected Directed Graphs}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {36:1--36:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.36}, URN = {urn:nbn:de:0030-drops-78769}, doi = {10.4230/LIPIcs.ESA.2017.36}, annote = {Keywords: linkage, directed graph, treewidth} }
Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, and Andrew M. Sutton. Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 37:1-37:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{friedrich_et_al:LIPIcs.ESA.2017.37, author = {Friedrich, Tobias and Krohmer, Anton and Rothenberger, Ralf and Sauerwald, Thomas and Sutton, Andrew M.}, title = {{Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {37:1--37:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.37}, URN = {urn:nbn:de:0030-drops-78356}, doi = {10.4230/LIPIcs.ESA.2017.37}, annote = {Keywords: satisfiability, random structures, random SAT, power law distribution, scale-freeness, phase transitions} }
Travis Gagie, Giovanni Manzini, and Rossano Venturini. An Encoding for Order-Preserving Matching. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 38:1-38:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{gagie_et_al:LIPIcs.ESA.2017.38, author = {Gagie, Travis and Manzini, Giovanni and Venturini, Rossano}, title = {{An Encoding for Order-Preserving Matching}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {38:1--38:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.38}, URN = {urn:nbn:de:0030-drops-78726}, doi = {10.4230/LIPIcs.ESA.2017.38}, annote = {Keywords: Compact data structures, encodings, order-preserving matching} }
Kshitij Gajjar and Jaikumar Radhakrishnan. Distance-Preserving Subgraphs of Interval Graphs. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 39:1-39:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{gajjar_et_al:LIPIcs.ESA.2017.39, author = {Gajjar, Kshitij and Radhakrishnan, Jaikumar}, title = {{Distance-Preserving Subgraphs of Interval Graphs}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {39:1--39:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.39}, URN = {urn:nbn:de:0030-drops-78798}, doi = {10.4230/LIPIcs.ESA.2017.39}, annote = {Keywords: interval graphs, shortest path, distance-preserving subgraphs, bit-reversal permutation matrix} }
Pawel Gawrychowski, Nadav Krasnopolsky, Shay Mozes, and Oren Weimann. Dispersion on Trees. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 40:1-40:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{gawrychowski_et_al:LIPIcs.ESA.2017.40, author = {Gawrychowski, Pawel and Krasnopolsky, Nadav and Mozes, Shay and Weimann, Oren}, title = {{Dispersion on Trees}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {40:1--40:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.40}, URN = {urn:nbn:de:0030-drops-78438}, doi = {10.4230/LIPIcs.ESA.2017.40}, annote = {Keywords: parametric search, dispersion, k-center, dynamic programming} }
Shay Golan and Ely Porat. Real-Time Streaming Multi-Pattern Search for Constant Alphabet. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 41:1-41:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{golan_et_al:LIPIcs.ESA.2017.41, author = {Golan, Shay and Porat, Ely}, title = {{Real-Time Streaming Multi-Pattern Search for Constant Alphabet}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {41:1--41:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.41}, URN = {urn:nbn:de:0030-drops-78550}, doi = {10.4230/LIPIcs.ESA.2017.41}, annote = {Keywords: multi-pattern, dictionary, streaming pattern matching, fingerprints} }
Omer Gold and Micha Sharir. Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 42:1-42:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{gold_et_al:LIPIcs.ESA.2017.42, author = {Gold, Omer and Sharir, Micha}, title = {{Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {42:1--42:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.42}, URN = {urn:nbn:de:0030-drops-78364}, doi = {10.4230/LIPIcs.ESA.2017.42}, annote = {Keywords: 3SUM, k-SUM, Linear Degeneracy, Linear Decision Trees, Fractional Cascading} }
Sreenivas Gollapudi, Kostas Kollias, Debmalya Panigrahi, and Venetia Pliatsika. Profit Sharing and Efficiency in Utility Games. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 43:1-43:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{gollapudi_et_al:LIPIcs.ESA.2017.43, author = {Gollapudi, Sreenivas and Kollias, Kostas and Panigrahi, Debmalya and Pliatsika, Venetia}, title = {{Profit Sharing and Efficiency in Utility Games}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {43:1--43:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.43}, URN = {urn:nbn:de:0030-drops-78329}, doi = {10.4230/LIPIcs.ESA.2017.43}, annote = {Keywords: Price of anarchy, submodular maximization, coverage functions} }
Gramoz Goranci, Monika Henzinger, and Pan Peng. Improved Guarantees for Vertex Sparsification in Planar Graphs. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 44:1-44:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{goranci_et_al:LIPIcs.ESA.2017.44, author = {Goranci, Gramoz and Henzinger, Monika and Peng, Pan}, title = {{Improved Guarantees for Vertex Sparsification in Planar Graphs}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {44:1--44:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.44}, URN = {urn:nbn:de:0030-drops-78337}, doi = {10.4230/LIPIcs.ESA.2017.44}, annote = {Keywords: Vertex Sparsification, Graph Sparsification, Planar Graphs, Metric Embedding, Reachability} }
Gramoz Goranci, Monika Henzinger, and Pan Peng. The Power of Vertex Sparsifiers in Dynamic Graph Algorithms. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 45:1-45:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{goranci_et_al:LIPIcs.ESA.2017.45, author = {Goranci, Gramoz and Henzinger, Monika and Peng, Pan}, title = {{The Power of Vertex Sparsifiers in Dynamic Graph Algorithms}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {45:1--45:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.45}, URN = {urn:nbn:de:0030-drops-78460}, doi = {10.4230/LIPIcs.ESA.2017.45}, annote = {Keywords: Dynamic graph algorithms, electrical flow, minor-free graphs, max flow} }
Guru Guruganesh, Jennifer Iglesias, R. Ravi, and Laura Sanita. Single-Sink Fractionally Subadditive Network Design. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 46:1-46:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{guruganesh_et_al:LIPIcs.ESA.2017.46, author = {Guruganesh, Guru and Iglesias, Jennifer and Ravi, R. and Sanita, Laura}, title = {{Single-Sink Fractionally Subadditive Network Design}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {46:1--46:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.46}, URN = {urn:nbn:de:0030-drops-78581}, doi = {10.4230/LIPIcs.ESA.2017.46}, annote = {Keywords: Network design, single-commodity flow, approximation algorithms, Steiner tree} }
Gregory Gutin, M. S. Ramanujan, Felix Reidl, and Magnus Wahlström. Path-Contractions, Edge Deletions and Connectivity Preservation. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 47:1-47:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{gutin_et_al:LIPIcs.ESA.2017.47, author = {Gutin, Gregory and Ramanujan, M. S. and Reidl, Felix and Wahlstr\"{o}m, Magnus}, title = {{Path-Contractions, Edge Deletions and Connectivity Preservation}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {47:1--47:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.47}, URN = {urn:nbn:de:0030-drops-78270}, doi = {10.4230/LIPIcs.ESA.2017.47}, annote = {Keywords: connectivity, strong connectivity, vertex deletion, arc contraction} }
Monika Henzinger, Dariusz Leniowski, and Claire Mathieu. Dynamic Clustering to Minimize the Sum of Radii. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 48:1-48:10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{henzinger_et_al:LIPIcs.ESA.2017.48, author = {Henzinger, Monika and Leniowski, Dariusz and Mathieu, Claire}, title = {{Dynamic Clustering to Minimize the Sum of Radii}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {48:1--48:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.48}, URN = {urn:nbn:de:0030-drops-78749}, doi = {10.4230/LIPIcs.ESA.2017.48}, annote = {Keywords: dynamic algorithm, clustering, approximation, doubling dimension} }
John Hershberger, Neeraj Kumar, and Subhash Suri. Shortest Paths in the Plane with Obstacle Violations. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 49:1-49:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{hershberger_et_al:LIPIcs.ESA.2017.49, author = {Hershberger, John and Kumar, Neeraj and Suri, Subhash}, title = {{Shortest Paths in the Plane with Obstacle Violations}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {49:1--49:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.49}, URN = {urn:nbn:de:0030-drops-78413}, doi = {10.4230/LIPIcs.ESA.2017.49}, annote = {Keywords: Shortest paths, Polygonal obstacles, Continuous Dijkstra, Obstacle crossing, Visibility} }
Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, and Piotr Sankowski. Contracting a Planar Graph Efficiently. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 50:1-50:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{holm_et_al:LIPIcs.ESA.2017.50, author = {Holm, Jacob and Italiano, Giuseppe F. and Karczmarz, Adam and Lacki, Jakub and Rotenberg, Eva and Sankowski, Piotr}, title = {{Contracting a Planar Graph Efficiently}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {50:1--50:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.50}, URN = {urn:nbn:de:0030-drops-78755}, doi = {10.4230/LIPIcs.ESA.2017.50}, annote = {Keywords: planar graphs, algorithms, data structures, connectivity, coloring} }
Sungjin Im, Benjamin Moseley, Kirk Pruhs, and Clifford Stein. Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 51:1-51:10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{im_et_al:LIPIcs.ESA.2017.51, author = {Im, Sungjin and Moseley, Benjamin and Pruhs, Kirk and Stein, Clifford}, title = {{Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {51:1--51:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.51}, URN = {urn:nbn:de:0030-drops-78287}, doi = {10.4230/LIPIcs.ESA.2017.51}, annote = {Keywords: Posted pricing scheme, online scheduling, related machines, maximum flow time, competitiveness analysis} }
Haim Kaplan, Sasanka Roy, and Micha Sharir. Finding Axis-Parallel Rectangles of Fixed Perimeter or Area Containing the Largest Number of Points. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 52:1-52:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{kaplan_et_al:LIPIcs.ESA.2017.52, author = {Kaplan, Haim and Roy, Sasanka and Sharir, Micha}, title = {{Finding Axis-Parallel Rectangles of Fixed Perimeter or Area Containing the Largest Number of Points}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {52:1--52:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.52}, URN = {urn:nbn:de:0030-drops-78608}, doi = {10.4230/LIPIcs.ESA.2017.52}, annote = {Keywords: Computational geometry, geometric optimization, rectangles, perimeter, area} }
Dominik Kempa and Dmitry Kosolobov. LZ-End Parsing in Linear Time. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 53:1-53:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{kempa_et_al:LIPIcs.ESA.2017.53, author = {Kempa, Dominik and Kosolobov, Dmitry}, title = {{LZ-End Parsing in Linear Time}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {53:1--53:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.53}, URN = {urn:nbn:de:0030-drops-78471}, doi = {10.4230/LIPIcs.ESA.2017.53}, annote = {Keywords: LZ-End, LZ77, construction algorithm, linear time} }
Dusan Knop, Martin Koutecky, and Matthias Mnich. Combinatorial n-fold Integer Programming and Applications. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 54:1-54:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{knop_et_al:LIPIcs.ESA.2017.54, author = {Knop, Dusan and Koutecky, Martin and Mnich, Matthias}, title = {{Combinatorial n-fold Integer Programming and Applications}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {54:1--54:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.54}, URN = {urn:nbn:de:0030-drops-78616}, doi = {10.4230/LIPIcs.ESA.2017.54}, annote = {Keywords: integer programming, closest strings, fixed-parameter algorithms} }
Gilad Kutiel and Dror Rawitz. Local Search Algorithms for Maximum Carpool Matching. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 55:1-55:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{kutiel_et_al:LIPIcs.ESA.2017.55, author = {Kutiel, Gilad and Rawitz, Dror}, title = {{Local Search Algorithms for Maximum Carpool Matching}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {55:1--55:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.55}, URN = {urn:nbn:de:0030-drops-78210}, doi = {10.4230/LIPIcs.ESA.2017.55}, annote = {Keywords: approximation algorithms, local search, star packing, submodular maximization} }
Zhijiang Li and Norbert Zeh. Computing Maximum Agreement Forests without Cluster Partitioning is Folly. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 56:1-56:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{li_et_al:LIPIcs.ESA.2017.56, author = {Li, Zhijiang and Zeh, Norbert}, title = {{Computing Maximum Agreement Forests without Cluster Partitioning is Folly}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {56:1--56:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.56}, URN = {urn:nbn:de:0030-drops-78819}, doi = {10.4230/LIPIcs.ESA.2017.56}, annote = {Keywords: fixed-parameter tractability, agreement forests, hybridization, subtree prune-and-regraft} }
Daniel Lokshtanov, M. S. Ramanujan, and Saket Saurabh. A Linear-Time Parameterized Algorithm for Node Unique Label Cover. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 57:1-57:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{lokshtanov_et_al:LIPIcs.ESA.2017.57, author = {Lokshtanov, Daniel and Ramanujan, M. S. and Saurabh, Saket}, title = {{A Linear-Time Parameterized Algorithm for Node Unique Label Cover}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {57:1--57:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.57}, URN = {urn:nbn:de:0030-drops-78152}, doi = {10.4230/LIPIcs.ESA.2017.57}, annote = {Keywords: Algorithms and data structures, Fixed Parameter Tractability, Unique Label Cover, Linear Time FPT Algorithms.} }
Tobias Maier and Peter Sanders. Dynamic Space Efficient Hashing. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 58:1-58:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{maier_et_al:LIPIcs.ESA.2017.58, author = {Maier, Tobias and Sanders, Peter}, title = {{Dynamic Space Efficient Hashing}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {58:1--58:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.58}, URN = {urn:nbn:de:0030-drops-78487}, doi = {10.4230/LIPIcs.ESA.2017.58}, annote = {Keywords: Dynamic data structures, open addressing, closed hashing, cuckoo hashing, space efficiency} }
Dániel Marx and Marcin Pilipczuk. Subexponential Parameterized Algorithms for Graphs of Polynomial Growth. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 59:1-59:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{marx_et_al:LIPIcs.ESA.2017.59, author = {Marx, D\'{a}niel and Pilipczuk, Marcin}, title = {{Subexponential Parameterized Algorithms for Graphs of Polynomial Growth}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {59:1--59:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.59}, URN = {urn:nbn:de:0030-drops-78162}, doi = {10.4230/LIPIcs.ESA.2017.59}, annote = {Keywords: polynomial growth, subexponential algorithm, low treewidth pattern covering} }
Daniel Neuen and Pascal Schweitzer. Benchmark Graphs for Practical Graph Isomorphism. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 60:1-60:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{neuen_et_al:LIPIcs.ESA.2017.60, author = {Neuen, Daniel and Schweitzer, Pascal}, title = {{Benchmark Graphs for Practical Graph Isomorphism}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {60:1--60:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.60}, URN = {urn:nbn:de:0030-drops-78701}, doi = {10.4230/LIPIcs.ESA.2017.60}, annote = {Keywords: graph isomorphism, benchmark instances, practical solvers} }
Zeev Nutov. On the Tree Augmentation Problem. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 61:1-61:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{nutov:LIPIcs.ESA.2017.61, author = {Nutov, Zeev}, title = {{On the Tree Augmentation Problem}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {61:1--61:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.61}, URN = {urn:nbn:de:0030-drops-78345}, doi = {10.4230/LIPIcs.ESA.2017.61}, annote = {Keywords: Tree augmentation, Logarithmic costs, Approximation algorithm, Half-integral extreme points, Integrality gap} }
Alice Paul, Daniel Freund, Aaron Ferber, David B. Shmoys, and David P. Williamson. Prize-Collecting TSP with a Budget Constraint. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 62:1-62:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{paul_et_al:LIPIcs.ESA.2017.62, author = {Paul, Alice and Freund, Daniel and Ferber, Aaron and Shmoys, David B. and Williamson, David P.}, title = {{Prize-Collecting TSP with a Budget Constraint}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {62:1--62:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.62}, URN = {urn:nbn:de:0030-drops-78375}, doi = {10.4230/LIPIcs.ESA.2017.62}, annote = {Keywords: approximation algorithms, traveling salesman problem} }
Marc Roth. Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 63:1-63:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{roth:LIPIcs.ESA.2017.63, author = {Roth, Marc}, title = {{Counting Restricted Homomorphisms via M\"{o}bius Inversion over Matroid Lattices}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {63:1--63:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.63}, URN = {urn:nbn:de:0030-drops-78311}, doi = {10.4230/LIPIcs.ESA.2017.63}, annote = {Keywords: homomorphisms, matroids, counting complexity, parameterized complexity, dichotomy theorems} }
Ori Rottenstreich, Haim Kaplan, and Avinatan Hassidim. Clustering in Hypergraphs to Minimize Average Edge Service Time. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 64:1-64:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{rottenstreich_et_al:LIPIcs.ESA.2017.64, author = {Rottenstreich, Ori and Kaplan, Haim and Hassidim, Avinatan}, title = {{Clustering in Hypergraphs to Minimize Average Edge Service Time}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {64:1--64:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.64}, URN = {urn:nbn:de:0030-drops-78777}, doi = {10.4230/LIPIcs.ESA.2017.64}, annote = {Keywords: Clustering, average cover time, hypergraphs, set cover} }
Thomas Schibler and Subhash Suri. K-Dominance in Multidimensional Data: Theory and Applications. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 65:1-65:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{schibler_et_al:LIPIcs.ESA.2017.65, author = {Schibler, Thomas and Suri, Subhash}, title = {{K-Dominance in Multidimensional Data: Theory and Applications}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {65:1--65:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.65}, URN = {urn:nbn:de:0030-drops-78402}, doi = {10.4230/LIPIcs.ESA.2017.65}, annote = {Keywords: Dominance, skyline, database search, average case analysis, random vectors} }
Martin R. Schuster and Maciej Liskiewicz. New Abilities and Limitations of Spectral Graph Bisection. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 66:1-66:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{schuster_et_al:LIPIcs.ESA.2017.66, author = {Schuster, Martin R. and Liskiewicz, Maciej}, title = {{New Abilities and Limitations of Spectral Graph Bisection}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {66:1--66:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.66}, URN = {urn:nbn:de:0030-drops-78658}, doi = {10.4230/LIPIcs.ESA.2017.66}, annote = {Keywords: Minimum Graph Bisection, Spectral Methods, Convex Programming} }
Yoshimasa Takabatake, Tomohiro I, and Hiroshi Sakamoto. A Space-Optimal Grammar Compression. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 67:1-67:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{takabatake_et_al:LIPIcs.ESA.2017.67, author = {Takabatake, Yoshimasa and I, Tomohiro and Sakamoto, Hiroshi}, title = {{A Space-Optimal Grammar Compression}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {67:1--67:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.67}, URN = {urn:nbn:de:0030-drops-78640}, doi = {10.4230/LIPIcs.ESA.2017.67}, annote = {Keywords: Grammar compression, fully-online algorithm, succinct data structure} }
Hisao Tamaki. Positive-Instance Driven Dynamic Programming for Treewidth. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 68:1-68:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{tamaki:LIPIcs.ESA.2017.68, author = {Tamaki, Hisao}, title = {{Positive-Instance Driven Dynamic Programming for Treewidth}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {68:1--68:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.68}, URN = {urn:nbn:de:0030-drops-78804}, doi = {10.4230/LIPIcs.ESA.2017.68}, annote = {Keywords: treewidth, dynamic programming, minimal separators, potential maximal cliques, positive instances} }
Antonis Thomas. Exponential Lower Bounds for History-Based Simplex Pivot Rules on Abstract Cubes. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 69:1-69:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{thomas:LIPIcs.ESA.2017.69, author = {Thomas, Antonis}, title = {{Exponential Lower Bounds for History-Based Simplex Pivot Rules on Abstract Cubes}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {69:1--69:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.69}, URN = {urn:nbn:de:0030-drops-78505}, doi = {10.4230/LIPIcs.ESA.2017.69}, annote = {Keywords: pivot rule, lower bound, exponential, unique sink orientation, zadeh} }
Michael Wegner, Oskar Taubert, Alexander Schug, and Henning Meyerhenke. Maxent-Stress Optimization of 3D Biomolecular Models. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 70:1-70:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{wegner_et_al:LIPIcs.ESA.2017.70, author = {Wegner, Michael and Taubert, Oskar and Schug, Alexander and Meyerhenke, Henning}, title = {{Maxent-Stress Optimization of 3D Biomolecular Models}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {70:1--70:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.70}, URN = {urn:nbn:de:0030-drops-78175}, doi = {10.4230/LIPIcs.ESA.2017.70}, annote = {Keywords: Distance geometry, protein structure determination, 3D graph drawing, maxent-stress optimization} }
Feedback for Dagstuhl Publishing