LIPIcs, Volume 112
ESA 2018, August 20-22, 2018, Helsinki, Finland
Editors: Yossi Azar, Hannah Bast, and Grzegorz Herman
Published in: LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
Yossi Azar and Danny Vainstein. Multi Layer Peeling for Linear Arrangement and Hierarchical Clustering. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 13:1-13:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{azar_et_al:LIPIcs.ICALP.2023.13, author = {Azar, Yossi and Vainstein, Danny}, title = {{Multi Layer Peeling for Linear Arrangement and Hierarchical Clustering}}, booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)}, pages = {13:1--13:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-278-5}, ISSN = {1868-8969}, year = {2023}, volume = {261}, editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.13}, URN = {urn:nbn:de:0030-drops-180656}, doi = {10.4230/LIPIcs.ICALP.2023.13}, annote = {Keywords: Hierarchical clustering, Linear arrangements, Metric embeddings} }
Published in: LIPIcs, Volume 248, 33rd International Symposium on Algorithms and Computation (ISAAC 2022)
Yossi Azar, Eldad Peretz, and Noam Touitou. Distortion-Oblivious Algorithms for Scheduling on Multiple Machines. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 16:1-16:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{azar_et_al:LIPIcs.ISAAC.2022.16, author = {Azar, Yossi and Peretz, Eldad and Touitou, Noam}, title = {{Distortion-Oblivious Algorithms for Scheduling on Multiple Machines}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {16:1--16:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.16}, URN = {urn:nbn:de:0030-drops-173010}, doi = {10.4230/LIPIcs.ISAAC.2022.16}, annote = {Keywords: Online, Scheduling, Predictions, Stretch, Flow Time} }
Published in: LIPIcs, Volume 229, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)
Yossi Azar, Chay Machluf, Boaz Patt-Shamir, and Noam Touitou. Competitive Vertex Recoloring. In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 229, pp. 13:1-13:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{azar_et_al:LIPIcs.ICALP.2022.13, author = {Azar, Yossi and Machluf, Chay and Patt-Shamir, Boaz and Touitou, Noam}, title = {{Competitive Vertex Recoloring}}, booktitle = {49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)}, pages = {13:1--13:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-235-8}, ISSN = {1868-8969}, year = {2022}, volume = {229}, editor = {Boja\'{n}czyk, Miko{\l}aj and Merelli, Emanuela and Woodruff, David P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.13}, URN = {urn:nbn:de:0030-drops-163542}, doi = {10.4230/LIPIcs.ICALP.2022.13}, annote = {Keywords: coloring with recourse, anti-affinity constraints} }
Published in: LIPIcs, Volume 173, 28th Annual European Symposium on Algorithms (ESA 2020)
Yossi Azar, Ashish Chiplunkar, Shay Kutten, and Noam Touitou. Set Cover with Delay - Clairvoyance Is Not Required. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 8:1-8:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{azar_et_al:LIPIcs.ESA.2020.8, author = {Azar, Yossi and Chiplunkar, Ashish and Kutten, Shay and Touitou, Noam}, title = {{Set Cover with Delay - Clairvoyance Is Not Required}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {8:1--8:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.8}, URN = {urn:nbn:de:0030-drops-128749}, doi = {10.4230/LIPIcs.ESA.2020.8}, annote = {Keywords: Set Cover, Delay, Clairvoyant} }
Published in: LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Aris Anagnostopoulos, Ilan R. Cohen, Stefano Leonardi, and Jakub Łącki. Stochastic Graph Exploration. In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, pp. 136:1-136:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{anagnostopoulos_et_al:LIPIcs.ICALP.2019.136, author = {Anagnostopoulos, Aris and Cohen, Ilan R. and Leonardi, Stefano and {\L}\k{a}cki, Jakub}, title = {{Stochastic Graph Exploration}}, booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)}, pages = {136:1--136:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-109-2}, ISSN = {1868-8969}, year = {2019}, volume = {132}, editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.136}, URN = {urn:nbn:de:0030-drops-107122}, doi = {10.4230/LIPIcs.ICALP.2019.136}, annote = {Keywords: stochastic optimization, graph exploration, approximation algorithms} }
Published in: LIPIcs, Volume 112, 26th Annual European Symposium on Algorithms (ESA 2018)
Yossi Azar, Hannah Bast, and Grzegorz Herman. LIPIcs, Volume 112, ESA'18, Complete Volume. In 26th Annual European Symposium on Algorithms (ESA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 112, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@Proceedings{azar_et_al:LIPIcs.ESA.2018, title = {{LIPIcs, Volume 112, ESA'18, Complete Volume}}, booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-081-1}, ISSN = {1868-8969}, year = {2018}, volume = {112}, editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018}, URN = {urn:nbn:de:0030-drops-97239}, doi = {10.4230/LIPIcs.ESA.2018}, annote = {Keywords: Computer systems organization, Single instruction, multiple data, Computing methodologies, Graphics processors, Robotic planning, Hardware} }
Published in: LIPIcs, Volume 112, 26th Annual European Symposium on Algorithms (ESA 2018)
Yossi Azar, Hannah Bast, and Grzegorz Herman. Front Matter, Table of Contents, Preface, Conference Organization. In 26th Annual European Symposium on Algorithms (ESA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 112, pp. 0:i-0:xx, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{azar_et_al:LIPIcs.ESA.2018.0, author = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)}, pages = {0:i--0:xx}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-081-1}, ISSN = {1868-8969}, year = {2018}, volume = {112}, editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.0}, URN = {urn:nbn:de:0030-drops-94631}, doi = {10.4230/LIPIcs.ESA.2018.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Published in: LIPIcs, Volume 112, 26th Annual European Symposium on Algorithms (ESA 2018)
Sara Ahmadian, Umang Bhaskar, Laura Sanità, and Chaitanya Swamy. Algorithms for Inverse Optimization Problems. In 26th Annual European Symposium on Algorithms (ESA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 112, pp. 1:1-1:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{ahmadian_et_al:LIPIcs.ESA.2018.1, author = {Ahmadian, Sara and Bhaskar, Umang and Sanit\`{a}, Laura and Swamy, Chaitanya}, title = {{Algorithms for Inverse Optimization Problems}}, booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)}, pages = {1:1--1:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-081-1}, ISSN = {1868-8969}, year = {2018}, volume = {112}, editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.1}, URN = {urn:nbn:de:0030-drops-94646}, doi = {10.4230/LIPIcs.ESA.2018.1}, annote = {Keywords: Inverse optimization, Shortest paths, Approximation algorithms, Linear programming, Polyhedral theory, Combinatorial optimization} }
Published in: LIPIcs, Volume 112, 26th Annual European Symposium on Algorithms (ESA 2018)
Amihood Amir, Gad M. Landau, Shoshana Marcus, and Dina Sokol. Two-Dimensional Maximal Repetitions. In 26th Annual European Symposium on Algorithms (ESA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 112, pp. 2:1-2:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{amir_et_al:LIPIcs.ESA.2018.2, author = {Amir, Amihood and Landau, Gad M. and Marcus, Shoshana and Sokol, Dina}, title = {{Two-Dimensional Maximal Repetitions}}, booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)}, pages = {2:1--2:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-081-1}, ISSN = {1868-8969}, year = {2018}, volume = {112}, editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.2}, URN = {urn:nbn:de:0030-drops-94652}, doi = {10.4230/LIPIcs.ESA.2018.2}, annote = {Keywords: pattern matching algorithms, repetitions, periodicity, two-dimensional} }
Published in: LIPIcs, Volume 112, 26th Annual European Symposium on Algorithms (ESA 2018)
Sunil Arya, Guilherme D. da Fonseca, and David M. Mount. Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums. In 26th Annual European Symposium on Algorithms (ESA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 112, pp. 3:1-3:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{arya_et_al:LIPIcs.ESA.2018.3, author = {Arya, Sunil and da Fonseca, Guilherme D. and Mount, David M.}, title = {{Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums}}, booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)}, pages = {3:1--3:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-081-1}, ISSN = {1868-8969}, year = {2018}, volume = {112}, editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.3}, URN = {urn:nbn:de:0030-drops-94664}, doi = {10.4230/LIPIcs.ESA.2018.3}, annote = {Keywords: Minkowski sum, convex intersection, width, approximation} }
Published in: LIPIcs, Volume 112, 26th Annual European Symposium on Algorithms (ESA 2018)
Nicolas Auger, Vincent Jugé, Cyril Nicaud, and Carine Pivoteau. On the Worst-Case Complexity of TimSort. In 26th Annual European Symposium on Algorithms (ESA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 112, pp. 4:1-4:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{auger_et_al:LIPIcs.ESA.2018.4, author = {Auger, Nicolas and Jug\'{e}, Vincent and Nicaud, Cyril and Pivoteau, Carine}, title = {{On the Worst-Case Complexity of TimSort}}, booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)}, pages = {4:1--4:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-081-1}, ISSN = {1868-8969}, year = {2018}, volume = {112}, editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.4}, URN = {urn:nbn:de:0030-drops-94678}, doi = {10.4230/LIPIcs.ESA.2018.4}, annote = {Keywords: Sorting algorithms, Merge sorting algorithms, TimSort, Analysis of algorithms} }
Published in: LIPIcs, Volume 112, 26th Annual European Symposium on Algorithms (ESA 2018)
János Balogh, József Békési, György Dósa, Leah Epstein, and Asaf Levin. A New and Improved Algorithm for Online Bin Packing. In 26th Annual European Symposium on Algorithms (ESA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 112, pp. 5:1-5:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{balogh_et_al:LIPIcs.ESA.2018.5, author = {Balogh, J\'{a}nos and B\'{e}k\'{e}si, J\'{o}zsef and D\'{o}sa, Gy\"{o}rgy and Epstein, Leah and Levin, Asaf}, title = {{A New and Improved Algorithm for Online Bin Packing}}, booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)}, pages = {5:1--5:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-081-1}, ISSN = {1868-8969}, year = {2018}, volume = {112}, editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.5}, URN = {urn:nbn:de:0030-drops-94686}, doi = {10.4230/LIPIcs.ESA.2018.5}, annote = {Keywords: Bin packing, online algorithms, competitive analysis} }
Published in: LIPIcs, Volume 112, 26th Annual European Symposium on Algorithms (ESA 2018)
Max Bannach and Sebastian Berndt. Practical Access to Dynamic Programming on Tree Decompositions. In 26th Annual European Symposium on Algorithms (ESA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 112, pp. 6:1-6:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{bannach_et_al:LIPIcs.ESA.2018.6, author = {Bannach, Max and Berndt, Sebastian}, title = {{Practical Access to Dynamic Programming on Tree Decompositions}}, booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)}, pages = {6:1--6:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-081-1}, ISSN = {1868-8969}, year = {2018}, volume = {112}, editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.6}, URN = {urn:nbn:de:0030-drops-94692}, doi = {10.4230/LIPIcs.ESA.2018.6}, annote = {Keywords: fixed-parameter tractability, treewidth, model-checking} }
Published in: LIPIcs, Volume 112, 26th Annual European Symposium on Algorithms (ESA 2018)
Luca Becchetti, Andrea Clementi, Pasin Manurangsi, Emanuele Natale, Francesco Pasquale, Prasad Raghavendra, and Luca Trevisan. Average Whenever You Meet: Opportunistic Protocols for Community Detection. In 26th Annual European Symposium on Algorithms (ESA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 112, pp. 7:1-7:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{becchetti_et_al:LIPIcs.ESA.2018.7, author = {Becchetti, Luca and Clementi, Andrea and Manurangsi, Pasin and Natale, Emanuele and Pasquale, Francesco and Raghavendra, Prasad and Trevisan, Luca}, title = {{Average Whenever You Meet: Opportunistic Protocols for Community Detection}}, booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)}, pages = {7:1--7:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-081-1}, ISSN = {1868-8969}, year = {2018}, volume = {112}, editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.7}, URN = {urn:nbn:de:0030-drops-94705}, doi = {10.4230/LIPIcs.ESA.2018.7}, annote = {Keywords: Community Detection, Random Processes, Spectral Analysis} }
Feedback for Dagstuhl Publishing