Published in: LIPIcs, Volume 262, 35th Euromicro Conference on Real-Time Systems (ECRTS 2023)
Aleksandar Matovic, Rafal Graczyk, Federico Lucchetti, and Marcus Völp. Consensual Resilient Control: Stateless Recovery of Stateful Controllers. In 35th Euromicro Conference on Real-Time Systems (ECRTS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 262, pp. 14:1-14:27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{matovic_et_al:LIPIcs.ECRTS.2023.14, author = {Matovic, Aleksandar and Graczyk, Rafal and Lucchetti, Federico and V\"{o}lp, Marcus}, title = {{Consensual Resilient Control: Stateless Recovery of Stateful Controllers}}, booktitle = {35th Euromicro Conference on Real-Time Systems (ECRTS 2023)}, pages = {14:1--14:27}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-280-8}, ISSN = {1868-8969}, year = {2023}, volume = {262}, editor = {Papadopoulos, Alessandro V.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECRTS.2023.14}, URN = {urn:nbn:de:0030-drops-180430}, doi = {10.4230/LIPIcs.ECRTS.2023.14}, annote = {Keywords: resilience, control, replication} }
Published in: LIPIcs, Volume 181, 31st International Symposium on Algorithms and Computation (ISAAC 2020)
Mark de Berg, Aleksandar Markovic, and Seeun William Umboh. The Online Broadcast Range-Assignment Problem. In 31st International Symposium on Algorithms and Computation (ISAAC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 181, pp. 60:1-60:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{deberg_et_al:LIPIcs.ISAAC.2020.60, author = {de Berg, Mark and Markovic, Aleksandar and Umboh, Seeun William}, title = {{The Online Broadcast Range-Assignment Problem}}, booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)}, pages = {60:1--60:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-173-3}, ISSN = {1868-8969}, year = {2020}, volume = {181}, editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.60}, URN = {urn:nbn:de:0030-drops-134042}, doi = {10.4230/LIPIcs.ISAAC.2020.60}, annote = {Keywords: Computational geometry, online algorithms, range assignment, broadcast} }
Published in: LIPIcs, Volume 123, 29th International Symposium on Algorithms and Computation (ISAAC 2018)
Elena Arseneva, Man-Kwun Chiu, Matias Korman, Aleksandar Markovic, Yoshio Okamoto, Aurélien Ooms, André van Renssen, and Marcel Roeloffzen. Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 58:1-58:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{arseneva_et_al:LIPIcs.ISAAC.2018.58, author = {Arseneva, Elena and Chiu, Man-Kwun and Korman, Matias and Markovic, Aleksandar and Okamoto, Yoshio and Ooms, Aur\'{e}lien and van Renssen, Andr\'{e} and Roeloffzen, Marcel}, title = {{Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {58:1--58:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.58}, URN = {urn:nbn:de:0030-drops-100060}, doi = {10.4230/LIPIcs.ISAAC.2018.58}, annote = {Keywords: Rectilinear link distance, polygonal domain, diameter, radius} }
Published in: LIPIcs, Volume 92, 28th International Symposium on Algorithms and Computation (ISAAC 2017)
Mark de Berg, Tim Leijsen, Aleksandar Markovic, André van Renssen, Marcel Roeloffzen, and Gerhard Woeginger. Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 26:1-26:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{deberg_et_al:LIPIcs.ISAAC.2017.26, author = {de Berg, Mark and Leijsen, Tim and Markovic, Aleksandar and van Renssen, Andr\'{e} and Roeloffzen, Marcel and Woeginger, Gerhard}, title = {{Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {26:1--26:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.26}, URN = {urn:nbn:de:0030-drops-82683}, doi = {10.4230/LIPIcs.ISAAC.2017.26}, annote = {Keywords: Conflict-free colorings, Dynamic data structures, Kinetic data structures} }
Published in: LIPIcs, Volume 92, 28th International Symposium on Algorithms and Computation (ISAAC 2017)
Mark de Berg and Aleksandar Markovic. Dynamic Conflict-Free Colorings in the Plane. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 27:1-27:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{deberg_et_al:LIPIcs.ISAAC.2017.27, author = {de Berg, Mark and Markovic, Aleksandar}, title = {{Dynamic Conflict-Free Colorings in the Plane}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {27:1--27:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.27}, URN = {urn:nbn:de:0030-drops-82504}, doi = {10.4230/LIPIcs.ISAAC.2017.27}, annote = {Keywords: Conflict-free colorings, Dynamic data structures} }
Published in: LIPIcs, Volume 77, 33rd International Symposium on Computational Geometry (SoCG 2017)
Kevin Buchin, Jinhee Chun, Maarten Löffler, Aleksandar Markovic, Wouter Meulemans, Yoshio Okamoto, and Taichi Shiitada. Folding Free-Space Diagrams: Computing the Fréchet Distance between 1-Dimensional Curves (Multimedia Contribution). In 33rd International Symposium on Computational Geometry (SoCG 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 77, pp. 64:1-64:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{buchin_et_al:LIPIcs.SoCG.2017.64, author = {Buchin, Kevin and Chun, Jinhee and L\"{o}ffler, Maarten and Markovic, Aleksandar and Meulemans, Wouter and Okamoto, Yoshio and Shiitada, Taichi}, title = {{Folding Free-Space Diagrams: Computing the Fr\'{e}chet Distance between 1-Dimensional Curves}}, booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)}, pages = {64:1--64:5}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-038-5}, ISSN = {1868-8969}, year = {2017}, volume = {77}, editor = {Aronov, Boris and Katz, Matthew J.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.64}, URN = {urn:nbn:de:0030-drops-72417}, doi = {10.4230/LIPIcs.SoCG.2017.64}, annote = {Keywords: Frechet distance, ply, k-packed curves} }
Feedback for Dagstuhl Publishing