LIPIcs, Volume 132
ICALP 2019, July 9-12, 2019, Patras, Greece
Editors: Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, and Stefano Leonardi
Published in: LIPIcs, Volume 265, 21st International Symposium on Experimental Algorithms (SEA 2023)
Ruben Becker, Pierluigi Crescenzi, Antonio Cruciani, and Bojana Kodric. Proxying Betweenness Centrality Rankings in Temporal Networks. In 21st International Symposium on Experimental Algorithms (SEA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 265, pp. 6:1-6:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{becker_et_al:LIPIcs.SEA.2023.6, author = {Becker, Ruben and Crescenzi, Pierluigi and Cruciani, Antonio and Kodric, Bojana}, title = {{Proxying Betweenness Centrality Rankings in Temporal Networks}}, booktitle = {21st International Symposium on Experimental Algorithms (SEA 2023)}, pages = {6:1--6:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-279-2}, ISSN = {1868-8969}, year = {2023}, volume = {265}, editor = {Georgiadis, Loukas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2023.6}, URN = {urn:nbn:de:0030-drops-183568}, doi = {10.4230/LIPIcs.SEA.2023.6}, annote = {Keywords: node centrality, betweenness, temporal graphs, graph mining} }
Published in: LIPIcs, Volume 253, 26th International Conference on Principles of Distributed Systems (OPODIS 2022)
Jannik Castenow, Jonas Harbig, Daniel Jung, Peter Kling, Till Knollmann, and Friedhelm Meyer auf der Heide. A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility. In 26th International Conference on Principles of Distributed Systems (OPODIS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 253, pp. 15:1-15:25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{castenow_et_al:LIPIcs.OPODIS.2022.15, author = {Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Kling, Peter and Knollmann, Till and Meyer auf der Heide, Friedhelm}, title = {{A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility}}, booktitle = {26th International Conference on Principles of Distributed Systems (OPODIS 2022)}, pages = {15:1--15:25}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-265-5}, ISSN = {1868-8969}, year = {2023}, volume = {253}, editor = {Hillel, Eshcar and Palmieri, Roberto and Rivi\`{e}re, Etienne}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2022.15}, URN = {urn:nbn:de:0030-drops-176350}, doi = {10.4230/LIPIcs.OPODIS.2022.15}, annote = {Keywords: mobile robots, gathering, limited visibility, runtime, collision avoidance, near-gathering} }
Published in: LITES, Volume 8, Issue 2 (2022): Special Issue on Distributed Hybrid Systems. Leibniz Transactions on Embedded Systems, Volume 8, Issue 2
Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil, and Xavier Urbain. Swarms of Mobile Robots: Towards Versatility with Safety. In LITES, Volume 8, Issue 2 (2022): Special Issue on Distributed Hybrid Systems. Leibniz Transactions on Embedded Systems, Volume 8, Issue 2, pp. 02:1-02:36, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@Article{courtieu_et_al:LITES.8.2.2, author = {Courtieu, Pierre and Rieg, Lionel and Tixeuil, S\'{e}bastien and Urbain, Xavier}, title = {{Swarms of Mobile Robots: Towards Versatility with Safety}}, journal = {Leibniz Transactions on Embedded Systems}, pages = {02:1--02:36}, ISSN = {2199-2002}, year = {2022}, volume = {8}, number = {2}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LITES.8.2.2}, doi = {10.4230/LITES.8.2.2}, annote = {Keywords: distributed algorithm, mobile autonomous robots, formal proof} }
Published in: LIPIcs, Volume 209, 35th International Symposium on Distributed Computing (DISC 2021)
Joshua J. Daymude, Andréa W. Richa, and Christian Scheideler. The Canonical Amoebot Model: Algorithms and Concurrency Control. In 35th International Symposium on Distributed Computing (DISC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 209, pp. 20:1-20:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{daymude_et_al:LIPIcs.DISC.2021.20, author = {Daymude, Joshua J. and Richa, Andr\'{e}a W. and Scheideler, Christian}, title = {{The Canonical Amoebot Model: Algorithms and Concurrency Control}}, booktitle = {35th International Symposium on Distributed Computing (DISC 2021)}, pages = {20:1--20:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-210-5}, ISSN = {1868-8969}, year = {2021}, volume = {209}, editor = {Gilbert, Seth}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.20}, URN = {urn:nbn:de:0030-drops-148227}, doi = {10.4230/LIPIcs.DISC.2021.20}, annote = {Keywords: Programmable matter, self-organization, distributed algorithms, concurrency} }
Published in: LIPIcs, Volume 153, 23rd International Conference on Principles of Distributed Systems (OPODIS 2019)
Tsuyoshi Gotoh, Paola Flocchini, Toshimitsu Masuzawa, and Nicola Santoro. Tight Bounds on Distributed Exploration of Temporal Graphs. In 23rd International Conference on Principles of Distributed Systems (OPODIS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 153, pp. 22:1-22:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{gotoh_et_al:LIPIcs.OPODIS.2019.22, author = {Gotoh, Tsuyoshi and Flocchini, Paola and Masuzawa, Toshimitsu and Santoro, Nicola}, title = {{Tight Bounds on Distributed Exploration of Temporal Graphs}}, booktitle = {23rd International Conference on Principles of Distributed Systems (OPODIS 2019)}, pages = {22:1--22:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-133-7}, ISSN = {1868-8969}, year = {2020}, volume = {153}, editor = {Felber, Pascal and Friedman, Roy and Gilbert, Seth and Miller, Avery}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2019.22}, URN = {urn:nbn:de:0030-drops-118082}, doi = {10.4230/LIPIcs.OPODIS.2019.22}, annote = {Keywords: Distributed algorithm, Mobile agents, Exploration of dynamic networks, Arbitrary footprint} }
Published in: LIPIcs, Volume 153, 23rd International Conference on Principles of Distributed Systems (OPODIS 2019)
Shantanu Das, Giuseppe A. Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, and Masafumi Yamashita. Oblivious Permutations on the Plane. In 23rd International Conference on Principles of Distributed Systems (OPODIS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 153, pp. 24:1-24:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{das_et_al:LIPIcs.OPODIS.2019.24, author = {Das, Shantanu and Di Luna, Giuseppe A. and Flocchini, Paola and Santoro, Nicola and Viglietta, Giovanni and Yamashita, Masafumi}, title = {{Oblivious Permutations on the Plane}}, booktitle = {23rd International Conference on Principles of Distributed Systems (OPODIS 2019)}, pages = {24:1--24:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-133-7}, ISSN = {1868-8969}, year = {2020}, volume = {153}, editor = {Felber, Pascal and Friedman, Roy and Gilbert, Seth and Miller, Avery}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2019.24}, URN = {urn:nbn:de:0030-drops-118103}, doi = {10.4230/LIPIcs.OPODIS.2019.24}, annote = {Keywords: Distributed Algorithms, Mobile Robots, Fully synchronous, Oblivious, Permutations, Chirality, Sequence of configurations} }
Published in: LIPIcs, Volume 153, 23rd International Conference on Principles of Distributed Systems (OPODIS 2019)
Paola Flocchini, Nicola Santoro, and Koichi Wada. On Memory, Communication, and Synchronous Schedulers When Moving and Computing. In 23rd International Conference on Principles of Distributed Systems (OPODIS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 153, pp. 25:1-25:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{flocchini_et_al:LIPIcs.OPODIS.2019.25, author = {Flocchini, Paola and Santoro, Nicola and Wada, Koichi}, title = {{On Memory, Communication, and Synchronous Schedulers When Moving and Computing}}, booktitle = {23rd International Conference on Principles of Distributed Systems (OPODIS 2019)}, pages = {25:1--25:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-133-7}, ISSN = {1868-8969}, year = {2020}, volume = {153}, editor = {Felber, Pascal and Friedman, Roy and Gilbert, Seth and Miller, Avery}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2019.25}, URN = {urn:nbn:de:0030-drops-118114}, doi = {10.4230/LIPIcs.OPODIS.2019.25}, annote = {Keywords: Look-Compute-Move, Oblivious mobile robots, Robots with lights, Memory versus Communication, Moving and Computing} }
Published in: LIPIcs, Volume 149, 30th International Symposium on Algorithms and Computation (ISAAC 2019)
Paola Flocchini, Ryan Killick, Evangelos Kranakis, Nicola Santoro, and Masafumi Yamashita. Gathering and Election by Mobile Robots in a Continuous Cycle. In 30th International Symposium on Algorithms and Computation (ISAAC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 149, pp. 8:1-8:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{flocchini_et_al:LIPIcs.ISAAC.2019.8, author = {Flocchini, Paola and Killick, Ryan and Kranakis, Evangelos and Santoro, Nicola and Yamashita, Masafumi}, title = {{Gathering and Election by Mobile Robots in a Continuous Cycle}}, booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)}, pages = {8:1--8:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-130-6}, ISSN = {1868-8969}, year = {2019}, volume = {149}, editor = {Lu, Pinyan and Zhang, Guochuan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.8}, URN = {urn:nbn:de:0030-drops-115044}, doi = {10.4230/LIPIcs.ISAAC.2019.8}, annote = {Keywords: Cycle, Election, Gathering, Las Vegas, Monte Carlo, Randomized Algorithm} }
Published in: LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, and Stefano Leonardi. LIPIcs, Volume 132, ICALP'19, Complete Volume. In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@Proceedings{baier_et_al:LIPIcs.ICALP.2019, title = {{LIPIcs, Volume 132, ICALP'19, Complete Volume}}, booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)}, 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}, URN = {urn:nbn:de:0030-drops-108644}, doi = {10.4230/LIPIcs.ICALP.2019}, annote = {Keywords: Theory of computation} }
Published in: LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, and Stefano Leonardi. Front Matter, Table of Contents, Preface, Conference Organization. In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, pp. 0:i-0:xxxviii, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{baier_et_al:LIPIcs.ICALP.2019.0, author = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)}, pages = {0:i--0:xxxviii}, 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.0}, URN = {urn:nbn:de:0030-drops-105765}, doi = {10.4230/LIPIcs.ICALP.2019.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Published in: LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Michal Feldman. Auction Design under Interdependent Values (Invited Talk). In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, p. 1:1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{feldman:LIPIcs.ICALP.2019.1, author = {Feldman, Michal}, title = {{Auction Design under Interdependent Values}}, booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)}, pages = {1:1--1:1}, 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.1}, URN = {urn:nbn:de:0030-drops-105778}, doi = {10.4230/LIPIcs.ICALP.2019.1}, annote = {Keywords: Combinatorial auctions, Interdependent values, Welfare approximation} }
Published in: LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Martin Grohe. Symmetry and Similarity (Invited Talk). In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, p. 2:1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{grohe:LIPIcs.ICALP.2019.2, author = {Grohe, Martin}, title = {{Symmetry and Similarity}}, booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)}, pages = {2:1--2:1}, 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.2}, URN = {urn:nbn:de:0030-drops-105787}, doi = {10.4230/LIPIcs.ICALP.2019.2}, annote = {Keywords: Graph Isomorphism, Graph Similarity, Graph Matching} }
Published in: LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Ola Svensson. Approximately Good and Modern Matchings (Invited Talk). In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, p. 3:1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{svensson:LIPIcs.ICALP.2019.3, author = {Svensson, Ola}, title = {{Approximately Good and Modern Matchings}}, booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)}, pages = {3:1--3:1}, 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.3}, URN = {urn:nbn:de:0030-drops-105797}, doi = {10.4230/LIPIcs.ICALP.2019.3}, annote = {Keywords: Algorithms, Matchings, Computational Complexity} }
Published in: LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Frits Vaandrager. Automata Learning and Galois Connections (Invited Talk). In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, p. 4:1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{vaandrager:LIPIcs.ICALP.2019.4, author = {Vaandrager, Frits}, title = {{Automata Learning and Galois Connections}}, booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)}, pages = {4:1--4:1}, 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.4}, URN = {urn:nbn:de:0030-drops-105800}, doi = {10.4230/LIPIcs.ICALP.2019.4}, annote = {Keywords: Automaton Learning, Model Learning, Protocol Verification, Applications of Automata Learning, Galois Connections} }
Feedback for Dagstuhl Publishing