Published in: LIPIcs, Volume 248, 33rd International Symposium on Algorithms and Computation (ISAAC 2022)
Sándor P. Fekete, Peter Kramer, Christian Rieck, Christian Scheffer, and Arne Schmidt. Efficiently Reconfiguring a Connected Swarm of Labeled Robots. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 17:1-17:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{fekete_et_al:LIPIcs.ISAAC.2022.17, author = {Fekete, S\'{a}ndor P. and Kramer, Peter and Rieck, Christian and Scheffer, Christian and Schmidt, Arne}, title = {{Efficiently Reconfiguring a Connected Swarm of Labeled Robots}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {17:1--17:15}, 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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.17}, URN = {urn:nbn:de:0030-drops-173028}, doi = {10.4230/LIPIcs.ISAAC.2022.17}, annote = {Keywords: Motion planning, parallel motion, bounded stretch, makespan, connectivity, swarm robotics} }
Published in: LIPIcs, Volume 212, 32nd International Symposium on Algorithms and Computation (ISAAC 2021)
Sándor P. Fekete, Phillip Keldenich, Ramin Kosfeld, Christian Rieck, and Christian Scheffer. Connected Coordinated Motion Planning with Bounded Stretch. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 212, pp. 9:1-9:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{fekete_et_al:LIPIcs.ISAAC.2021.9, author = {Fekete, S\'{a}ndor P. and Keldenich, Phillip and Kosfeld, Ramin and Rieck, Christian and Scheffer, Christian}, title = {{Connected Coordinated Motion Planning with Bounded Stretch}}, booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)}, pages = {9:1--9:16}, 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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.9}, URN = {urn:nbn:de:0030-drops-154423}, doi = {10.4230/LIPIcs.ISAAC.2021.9}, annote = {Keywords: Motion planning, parallel motion, bounded stretch, scaled shape, makespan, connectivity, swarm robotics} }
Published in: LIPIcs, Volume 189, 37th International Symposium on Computational Geometry (SoCG 2021)
Aaron T. Becker, Sándor P. Fekete, Matthias Konitzny, Sebastian Morr, and Arne Schmidt. Can You Walk This? Eulerian Tours and IDEA Instructions (Media Exposition). In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 62:1-62:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{becker_et_al:LIPIcs.SoCG.2021.62, author = {Becker, Aaron T. and Fekete, S\'{a}ndor P. and Konitzny, Matthias and Morr, Sebastian and Schmidt, Arne}, title = {{Can You Walk This? Eulerian Tours and IDEA Instructions}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {62:1--62:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.62}, URN = {urn:nbn:de:0030-drops-138616}, doi = {10.4230/LIPIcs.SoCG.2021.62}, annote = {Keywords: Eulerian tours, algorithms, education, IDEA instructions} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Sándor P. Fekete, Utkarsh Gupta, Phillip Keldenich, Christian Scheffer, and Sahil Shah. Worst-Case Optimal Covering of Rectangles by Disks. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 42:1-42:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{fekete_et_al:LIPIcs.SoCG.2020.42, author = {Fekete, S\'{a}ndor P. and Gupta, Utkarsh and Keldenich, Phillip and Scheffer, Christian and Shah, Sahil}, title = {{Worst-Case Optimal Covering of Rectangles by Disks}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {42:1--42:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-143-6}, ISSN = {1868-8969}, year = {2020}, volume = {164}, editor = {Cabello, Sergio and Chen, Danny Z.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.42}, URN = {urn:nbn:de:0030-drops-122003}, doi = {10.4230/LIPIcs.SoCG.2020.42}, annote = {Keywords: Disk covering, critical density, covering coefficient, tight worst-case bound, interval arithmetic, approximation} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Sándor P. Fekete, Linda Kleist, and Dominik Krupke. Minimum Scan Cover with Angular Transition Costs. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 43:1-43:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{fekete_et_al:LIPIcs.SoCG.2020.43, author = {Fekete, S\'{a}ndor P. and Kleist, Linda and Krupke, Dominik}, title = {{Minimum Scan Cover with Angular Transition Costs}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {43:1--43:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-143-6}, ISSN = {1868-8969}, year = {2020}, volume = {164}, editor = {Cabello, Sergio and Chen, Danny Z.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.43}, URN = {urn:nbn:de:0030-drops-122014}, doi = {10.4230/LIPIcs.SoCG.2020.43}, annote = {Keywords: Graph scanning, graph coloring, angular metric, complexity, approximation, scheduling} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Victor M. Baez, Aaron T. Becker, Sándor P. Fekete, and Arne Schmidt. Coordinated Particle Relocation with Global Signals and Local Friction (Media Exposition). In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 72:1-72:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{baez_et_al:LIPIcs.SoCG.2020.72, author = {Baez, Victor M. and Becker, Aaron T. and Fekete, S\'{a}ndor P. and Schmidt, Arne}, title = {{Coordinated Particle Relocation with Global Signals and Local Friction}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {72:1--72:5}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-143-6}, ISSN = {1868-8969}, year = {2020}, volume = {164}, editor = {Cabello, Sergio and Chen, Danny Z.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.72}, URN = {urn:nbn:de:0030-drops-122305}, doi = {10.4230/LIPIcs.SoCG.2020.72}, annote = {Keywords: Global control, reconfiguration, geometric algorithms, friction} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Amira Abdel-Rahman, Aaron T. Becker, Daniel E. Biediger, Kenneth C. Cheung, Sándor P. Fekete, Neil A. Gershenfeld, Sabrina Hugo, Benjamin Jenett, Phillip Keldenich, Eike Niehs, Christian Rieck, Arne Schmidt, Christian Scheffer, and Michael Yannuzzi. Space Ants: Constructing and Reconfiguring Large-Scale Structures with Finite Automata (Media Exposition). In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 73:1-73:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{abdelrahman_et_al:LIPIcs.SoCG.2020.73, author = {Abdel-Rahman, Amira and Becker, Aaron T. and Biediger, Daniel E. and Cheung, Kenneth C. and Fekete, S\'{a}ndor P. and Gershenfeld, Neil A. and Hugo, Sabrina and Jenett, Benjamin and Keldenich, Phillip and Niehs, Eike and Rieck, Christian and Schmidt, Arne and Scheffer, Christian and Yannuzzi, Michael}, title = {{Space Ants: Constructing and Reconfiguring Large-Scale Structures with Finite Automata}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {73:1--73:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-143-6}, ISSN = {1868-8969}, year = {2020}, volume = {164}, editor = {Cabello, Sergio and Chen, Danny Z.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.73}, URN = {urn:nbn:de:0030-drops-122310}, doi = {10.4230/LIPIcs.SoCG.2020.73}, annote = {Keywords: Finite automata, reconfiguration, construction, scaling} }
Published in: LIPIcs, Volume 92, 28th International Symposium on Algorithms and Computation (ISAAC 2017)
Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Christian Rieck, Christian Scheffer, and Arne Schmidt. Tilt Assembly: Algorithms for Micro-Factories that Build Objects with Uniform External Forces. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 11:1-11:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{becker_et_al:LIPIcs.ISAAC.2017.11, author = {Becker, Aaron T. and Fekete, S\'{a}ndor P. and Keldenich, Phillip and Krupke, Dominik and Rieck, Christian and Scheffer, Christian and Schmidt, Arne}, title = {{Tilt Assembly: Algorithms for Micro-Factories that Build Objects with Uniform External Forces}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {11:1--11: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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.11}, URN = {urn:nbn:de:0030-drops-82214}, doi = {10.4230/LIPIcs.ISAAC.2017.11}, annote = {Keywords: Programmable matter, micro-factories, tile assembly, tilt, approximation, hardness} }
Feedback for Dagstuhl Publishing