Published in: LIPIcs, Volume 253, 26th International Conference on Principles of Distributed Systems (OPODIS 2022)
Jared Coleman, Evangelos Kranakis, Danny Krizanc, and Oscar Morales-Ponce. Line Search for an Oblivious Moving Target. In 26th International Conference on Principles of Distributed Systems (OPODIS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 253, pp. 12:1-12:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{coleman_et_al:LIPIcs.OPODIS.2022.12, author = {Coleman, Jared and Kranakis, Evangelos and Krizanc, Danny and Morales-Ponce, Oscar}, title = {{Line Search for an Oblivious Moving Target}}, booktitle = {26th International Conference on Principles of Distributed Systems (OPODIS 2022)}, pages = {12:1--12:19}, 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.12}, URN = {urn:nbn:de:0030-drops-176325}, doi = {10.4230/LIPIcs.OPODIS.2022.12}, annote = {Keywords: Infinite Line, Knowledge, Oblivious, Robot, Search, Search-Time, Speed, Target} }
Published in: LIPIcs, Volume 212, 32nd International Symposium on Algorithms and Computation (ISAAC 2021)
Jurek Czyzowicz, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov, and Sunil Shende. Group Evacuation on a Line by Agents with Different Communication Abilities. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 212, pp. 57:1-57:24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{czyzowicz_et_al:LIPIcs.ISAAC.2021.57, author = {Czyzowicz, Jurek and Killick, Ryan and Kranakis, Evangelos and Krizanc, Danny and Narayanan, Lata and Opatrny, Jaroslav and Pankratov, Denis and Shende, Sunil}, title = {{Group Evacuation on a Line by Agents with Different Communication Abilities}}, booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)}, pages = {57:1--57:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-214-3}, ISSN = {1868-8969}, year = {2021}, volume = {212}, editor = {Ahn, Hee-Kap and Sadakane, Kunihiko}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.57}, URN = {urn:nbn:de:0030-drops-154903}, doi = {10.4230/LIPIcs.ISAAC.2021.57}, annote = {Keywords: Agent, Communication, Evacuation, Mobile, Receiver, Search, Sender} }
Published in: LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Jessica Enright, Kitty Meeks, George B. Mertzios, and Viktor Zamaraev. Deleting Edges to Restrict the Size of an Epidemic in Temporal Networks. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 57:1-57:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{enright_et_al:LIPIcs.MFCS.2019.57, author = {Enright, Jessica and Meeks, Kitty and Mertzios, George B. and Zamaraev, Viktor}, title = {{Deleting Edges to Restrict the Size of an Epidemic in Temporal Networks}}, booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)}, pages = {57:1--57:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-117-7}, ISSN = {1868-8969}, year = {2019}, volume = {138}, editor = {Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.57}, URN = {urn:nbn:de:0030-drops-110010}, doi = {10.4230/LIPIcs.MFCS.2019.57}, annote = {Keywords: Temporal networks, spreading processes, graph modification, parameterised complexity} }
Published in: LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny, and Sunil Shende. Energy Consumption of Group Search on a Line. In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, pp. 137:1-137:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{czyzowicz_et_al:LIPIcs.ICALP.2019.137, author = {Czyzowicz, Jurek and Georgiou, Konstantinos and Killick, Ryan and Kranakis, Evangelos and Krizanc, Danny and Lafond, Manuel and Narayanan, Lata and Opatrny, Jaroslav and Shende, Sunil}, title = {{Energy Consumption of Group Search on a Line}}, booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)}, pages = {137:1--137:15}, 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.137}, URN = {urn:nbn:de:0030-drops-107138}, doi = {10.4230/LIPIcs.ICALP.2019.137}, annote = {Keywords: Evacuation, Exit, Line, Face-to-face Communication, Robots, Search} }
Published in: LIPIcs, Volume 100, 9th International Conference on Fun with Algorithms (FUN 2018)
Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, and Sunil Shende. God Save the Queen. In 9th International Conference on Fun with Algorithms (FUN 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 100, pp. 16:1-16:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{czyzowicz_et_al:LIPIcs.FUN.2018.16, author = {Czyzowicz, Jurek and Georgiou, Konstantinos and Killick, Ryan and Kranakis, Evangelos and Krizanc, Danny and Narayanan, Lata and Opatrny, Jaroslav and Shende, Sunil}, title = {{God Save the Queen}}, booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)}, pages = {16:1--16:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-067-5}, ISSN = {1868-8969}, year = {2018}, volume = {100}, editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.16}, URN = {urn:nbn:de:0030-drops-88074}, doi = {10.4230/LIPIcs.FUN.2018.16}, annote = {Keywords: Algorithm, Evacuation, Exit, Disk, Wireless Communication, Queen, Priority, Robots, Search, Servants, Trajectory} }
Published in: LIPIcs, Volume 64, 27th International Symposium on Algorithms and Computation (ISAAC 2016)
Jurek Czyzowicz, Konstantinos Georgiou, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, and Sunil Shende. Search on a Line by Byzantine Robots. In 27th International Symposium on Algorithms and Computation (ISAAC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 64, pp. 27:1-27:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{czyzowicz_et_al:LIPIcs.ISAAC.2016.27, author = {Czyzowicz, Jurek and Georgiou, Konstantinos and Kranakis, Evangelos and Krizanc, Danny and Narayanan, Lata and Opatrny, Jaroslav and Shende, Sunil}, title = {{Search on a Line by Byzantine Robots}}, booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)}, pages = {27:1--27:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-026-2}, ISSN = {1868-8969}, year = {2016}, volume = {64}, editor = {Hong, Seok-Hee}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.27}, URN = {urn:nbn:de:0030-drops-67972}, doi = {10.4230/LIPIcs.ISAAC.2016.27}, annote = {Keywords: Cow path problem, Parallel search, Mobile robots, Wireless communication, Byzantine faults} }
Published in: LIPIcs, Volume 34, 31st International Symposium on Computational Geometry (SoCG 2015)
Mohammad Ali Abam, Marjan Adeli, Hamid Homapour, and Pooya Zafar Asadollahpoor. Geometric Spanners for Points Inside a Polygonal Domain. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 186-197, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{abam_et_al:LIPIcs.SOCG.2015.186, author = {Abam, Mohammad Ali and Adeli, Marjan and Homapour, Hamid and Asadollahpoor, Pooya Zafar}, title = {{Geometric Spanners for Points Inside a Polygonal Domain}}, booktitle = {31st International Symposium on Computational Geometry (SoCG 2015)}, pages = {186--197}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-83-5}, ISSN = {1868-8969}, year = {2015}, volume = {34}, editor = {Arge, Lars and Pach, J\'{a}nos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.186}, URN = {urn:nbn:de:0030-drops-51378}, doi = {10.4230/LIPIcs.SOCG.2015.186}, annote = {Keywords: Geometric Spanners, Polygonal Domain, Visibility Graph} }
Published in: LIPIcs, Volume 1, 25th International Symposium on Theoretical Aspects of Computer Science (2008)
Michael Hoffmann, Thomas Erlebach, Danny Krizanc, Matús Mihal'ák, and Rajeev Raman. Computing Minimum Spanning Trees with Uncertainty. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 277-288, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{hoffmann_et_al:LIPIcs.STACS.2008.1358, author = {Hoffmann, Michael and Erlebach, Thomas and Krizanc, Danny and Mihal'\'{a}k, Mat\'{u}s and Raman, Rajeev}, title = {{Computing Minimum Spanning Trees with Uncertainty}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {277--288}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1358}, URN = {urn:nbn:de:0030-drops-13581}, doi = {10.4230/LIPIcs.STACS.2008.1358}, annote = {Keywords: Algorithms and data structures; Current challenges: mobile and net computing} }
Feedback for Dagstuhl Publishing