@Proceedings{casteigts_et_al:LIPIcs.SAND.2024,
title = {{LIPIcs, Volume 292, SAND 2024, Complete Volume}},
booktitle = {3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)},
pages = {1--374},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-315-7},
ISSN = {1868-8969},
year = {2024},
volume = {292},
editor = {Casteigts, Arnaud and Kuhn, Fabian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024},
URN = {urn:nbn:de:0030-drops-198779},
doi = {10.4230/LIPIcs.SAND.2024},
annote = {Keywords: LIPIcs, Volume 292, SAND 2024, Complete Volume}
}
@InProceedings{casteigts_et_al:LIPIcs.SAND.2024.0,
author = {Casteigts, Arnaud and Kuhn, Fabian},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)},
pages = {0:i--0:xii},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-315-7},
ISSN = {1868-8969},
year = {2024},
volume = {292},
editor = {Casteigts, Arnaud and Kuhn, Fabian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.0},
URN = {urn:nbn:de:0030-drops-198783},
doi = {10.4230/LIPIcs.SAND.2024.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{erlebach:LIPIcs.SAND.2024.1,
author = {Erlebach, Thomas},
title = {{Exploration and Rendezvous in Temporal Graphs}},
booktitle = {3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)},
pages = {1:1--1:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-315-7},
ISSN = {1868-8969},
year = {2024},
volume = {292},
editor = {Casteigts, Arnaud and Kuhn, Fabian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.1},
URN = {urn:nbn:de:0030-drops-198797},
doi = {10.4230/LIPIcs.SAND.2024.1},
annote = {Keywords: Dynamic graphs, parameterized algorithms, orbit number}
}
@InProceedings{nowak:LIPIcs.SAND.2024.2,
author = {Nowak, Thomas},
title = {{Distributed Computation with Bacteria}},
booktitle = {3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)},
pages = {2:1--2:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-315-7},
ISSN = {1868-8969},
year = {2024},
volume = {292},
editor = {Casteigts, Arnaud and Kuhn, Fabian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.2},
URN = {urn:nbn:de:0030-drops-198807},
doi = {10.4230/LIPIcs.SAND.2024.2},
annote = {Keywords: Microbiological circuits, chemical reaction networks, birth-death processes}
}
@InProceedings{richa:LIPIcs.SAND.2024.3,
author = {Richa, Andr\'{e}a Werneck},
title = {{Algorithmic Programmable Matter: From Local Markov Chains to "Dumb" Robots}},
booktitle = {3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)},
pages = {3:1--3:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-315-7},
ISSN = {1868-8969},
year = {2024},
volume = {292},
editor = {Casteigts, Arnaud and Kuhn, Fabian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.3},
URN = {urn:nbn:de:0030-drops-198811},
doi = {10.4230/LIPIcs.SAND.2024.3},
annote = {Keywords: Programmable matter, Self-organizing particle systems, Biologically-inspired distributed algorithms, Local Markov chains, Emergent collective behavior}
}
@InProceedings{adamson:LIPIcs.SAND.2024.4,
author = {Adamson, Duncan},
title = {{Harmonious Colourings of Temporal Matchings}},
booktitle = {3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)},
pages = {4:1--4:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-315-7},
ISSN = {1868-8969},
year = {2024},
volume = {292},
editor = {Casteigts, Arnaud and Kuhn, Fabian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.4},
URN = {urn:nbn:de:0030-drops-198823},
doi = {10.4230/LIPIcs.SAND.2024.4},
annote = {Keywords: Temporal Graphs, Harmonious Colouring, NP-Completeness}
}
@InProceedings{beestermoller_et_al:LIPIcs.SAND.2024.5,
author = {Beesterm\"{o}ller, Judith and Busch, Costas and Wattenhofer, Roger},
title = {{Fault-Tolerant Distributed Directories}},
booktitle = {3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)},
pages = {5:1--5:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-315-7},
ISSN = {1868-8969},
year = {2024},
volume = {292},
editor = {Casteigts, Arnaud and Kuhn, Fabian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.5},
URN = {urn:nbn:de:0030-drops-198833},
doi = {10.4230/LIPIcs.SAND.2024.5},
annote = {Keywords: distributed directory, sparse partition, fault tolerance, message complexity, path dilation}
}
@InProceedings{bhattacharya_et_al:LIPIcs.SAND.2024.6,
author = {Bhattacharya, Adri and Italiano, Giuseppe F. and Mandal, Partha Sarathi},
title = {{Black Hole Search in Dynamic Tori}},
booktitle = {3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)},
pages = {6:1--6:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-315-7},
ISSN = {1868-8969},
year = {2024},
volume = {292},
editor = {Casteigts, Arnaud and Kuhn, Fabian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.6},
URN = {urn:nbn:de:0030-drops-198840},
doi = {10.4230/LIPIcs.SAND.2024.6},
annote = {Keywords: Black Hole Search, Time Varying Graphs, Dynamic Torus, Distributed Algorithms, Mobile Agents}
}
@InProceedings{bramas_et_al:LIPIcs.SAND.2024.7,
author = {Bramas, Quentin and Luttringer, Jean-Romain and Tixeuil, S\'{e}bastien},
title = {{Online Space-Time Travel Planning in Dynamic Graphs}},
booktitle = {3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)},
pages = {7:1--7:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-315-7},
ISSN = {1868-8969},
year = {2024},
volume = {292},
editor = {Casteigts, Arnaud and Kuhn, Fabian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.7},
URN = {urn:nbn:de:0030-drops-198854},
doi = {10.4230/LIPIcs.SAND.2024.7},
annote = {Keywords: Dynamic graphs, online algorithm, space-time travel, treasure hunt}
}
@InProceedings{christiann_et_al:LIPIcs.SAND.2024.8,
author = {Christiann, Esteban and Sanlaville, Eric and Schoeters, Jason},
title = {{On Inefficiently Connecting Temporal Networks}},
booktitle = {3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)},
pages = {8:1--8:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-315-7},
ISSN = {1868-8969},
year = {2024},
volume = {292},
editor = {Casteigts, Arnaud and Kuhn, Fabian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.8},
URN = {urn:nbn:de:0030-drops-198867},
doi = {10.4230/LIPIcs.SAND.2024.8},
annote = {Keywords: Network design principles, Network dynamics, Paths and connectivity problems, Branch-and-bound}
}
@InProceedings{connor_et_al:LIPIcs.SAND.2024.9,
author = {Connor, Matthew and Michail, Othon and Skretas, George},
title = {{All for One and One for All: An O(1)-Musketeers Universal Transformation for Rotating Robots}},
booktitle = {3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)},
pages = {9:1--9:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-315-7},
ISSN = {1868-8969},
year = {2024},
volume = {292},
editor = {Casteigts, Arnaud and Kuhn, Fabian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.9},
URN = {urn:nbn:de:0030-drops-198874},
doi = {10.4230/LIPIcs.SAND.2024.9},
annote = {Keywords: programmable matter, universal transformation, reconfigurable robotics, shape formation, centralised algorithms}
}
@InProceedings{dondi_et_al:LIPIcs.SAND.2024.10,
author = {Dondi, Riccardo and Lafond, Manuel},
title = {{On the Complexity of Temporal Arborescence Reconfiguration}},
booktitle = {3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)},
pages = {10:1--10:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-315-7},
ISSN = {1868-8969},
year = {2024},
volume = {292},
editor = {Casteigts, Arnaud and Kuhn, Fabian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.10},
URN = {urn:nbn:de:0030-drops-198888},
doi = {10.4230/LIPIcs.SAND.2024.10},
annote = {Keywords: Arborescence, Temporal Graphs, Graph Algorithms, Parameterized Complexity, Approximation Complexity}
}
@InProceedings{dondi_et_al:LIPIcs.SAND.2024.11,
author = {Dondi, Riccardo and Montecchiani, Fabrizio and Ortali, Giacomo and Piselli, Tommaso and Tappini, Alessandra},
title = {{Partial Temporal Vertex Cover with Bounded Activity Intervals}},
booktitle = {3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)},
pages = {11:1--11:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-315-7},
ISSN = {1868-8969},
year = {2024},
volume = {292},
editor = {Casteigts, Arnaud and Kuhn, Fabian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.11},
URN = {urn:nbn:de:0030-drops-198892},
doi = {10.4230/LIPIcs.SAND.2024.11},
annote = {Keywords: Temporal Graphs, Temporal Vertex Cover, Parameterized Complexity, Approximation Algorithms}
}
@InProceedings{erlebach_et_al:LIPIcs.SAND.2024.12,
author = {Erlebach, Thomas and Morawietz, Nils and Wolf, Petra},
title = {{Parameterized Algorithms for Multi-Label Periodic Temporal Graph Realization}},
booktitle = {3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)},
pages = {12:1--12:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-315-7},
ISSN = {1868-8969},
year = {2024},
volume = {292},
editor = {Casteigts, Arnaud and Kuhn, Fabian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.12},
URN = {urn:nbn:de:0030-drops-198909},
doi = {10.4230/LIPIcs.SAND.2024.12},
annote = {Keywords: Fixed-Parameter Tractability, Almost-Clique, Kernelization, Dynamic Network, Temporal Graph}
}
@InProceedings{feletti_et_al:LIPIcs.SAND.2024.13,
author = {Feletti, Caterina and Mambretti, Lucia and Mereghetti, Carlo and Palano, Beatrice},
title = {{Computational Power of Opaque Robots}},
booktitle = {3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)},
pages = {13:1--13:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-315-7},
ISSN = {1868-8969},
year = {2024},
volume = {292},
editor = {Casteigts, Arnaud and Kuhn, Fabian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.13},
URN = {urn:nbn:de:0030-drops-198913},
doi = {10.4230/LIPIcs.SAND.2024.13},
annote = {Keywords: Mobile robots, Look-Compute-Move, Computational complexity, Opaque robots, Distributed computing, Obstructed visibility, Collision intolerance}
}
@InProceedings{hahn_et_al:LIPIcs.SAND.2024.14,
author = {Hahn, Christopher and Harbig, Jonas and Kling, Peter},
title = {{Forming Large Patterns with Local Robots in the OBLOT Model}},
booktitle = {3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)},
pages = {14:1--14:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-315-7},
ISSN = {1868-8969},
year = {2024},
volume = {292},
editor = {Casteigts, Arnaud and Kuhn, Fabian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.14},
URN = {urn:nbn:de:0030-drops-198924},
doi = {10.4230/LIPIcs.SAND.2024.14},
annote = {Keywords: Swarm Algorithm, Swarm Robots, Distributed Algorithm, Pattern Formation, Limited Visibility, Oblivious}
}
@InProceedings{hinnenthal_et_al:LIPIcs.SAND.2024.15,
author = {Hinnenthal, Kristian and Liedtke, David and Scheideler, Christian},
title = {{Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures}},
booktitle = {3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)},
pages = {15:1--15:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-315-7},
ISSN = {1868-8969},
year = {2024},
volume = {292},
editor = {Casteigts, Arnaud and Kuhn, Fabian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.15},
URN = {urn:nbn:de:0030-drops-198930},
doi = {10.4230/LIPIcs.SAND.2024.15},
annote = {Keywords: Programmable Matter, Shape Formation, 3D Model, Finite Automaton}
}
@InProceedings{klobas_et_al:LIPIcs.SAND.2024.16,
author = {Klobas, Nina and Mertzios, George B. and Molter, Hendrik and Spirakis, Paul G.},
title = {{Temporal Graph Realization from Fastest Paths}},
booktitle = {3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)},
pages = {16:1--16:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-315-7},
ISSN = {1868-8969},
year = {2024},
volume = {292},
editor = {Casteigts, Arnaud and Kuhn, Fabian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.16},
URN = {urn:nbn:de:0030-drops-198945},
doi = {10.4230/LIPIcs.SAND.2024.16},
annote = {Keywords: Temporal graph, periodic temporal labeling, fastest temporal path, graph realization, temporal connectivity, parameterized complexity}
}
@InProceedings{kumamoto_et_al:LIPIcs.SAND.2024.17,
author = {Kumamoto, Shuma and Kijima, Shuji and Shirai, Tomoyuki},
title = {{An Analysis of the Recurrence/Transience of Random Walks on Growing Trees and Hypercubes}},
booktitle = {3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)},
pages = {17:1--17:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-315-7},
ISSN = {1868-8969},
year = {2024},
volume = {292},
editor = {Casteigts, Arnaud and Kuhn, Fabian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.17},
URN = {urn:nbn:de:0030-drops-198955},
doi = {10.4230/LIPIcs.SAND.2024.17},
annote = {Keywords: Random walk, dynamic graph, recurrent, transient}
}
@InProceedings{padalkin_et_al:LIPIcs.SAND.2024.18,
author = {Padalkin, Andreas and Kumar, Manish and Scheideler, Christian},
title = {{Reconfiguration and Locomotion with Joint Movements in the Amoebot Model}},
booktitle = {3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)},
pages = {18:1--18:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-315-7},
ISSN = {1868-8969},
year = {2024},
volume = {292},
editor = {Casteigts, Arnaud and Kuhn, Fabian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.18},
URN = {urn:nbn:de:0030-drops-198963},
doi = {10.4230/LIPIcs.SAND.2024.18},
annote = {Keywords: programmable matter, modular robot system, reconfiguration, locomotion}
}
@InProceedings{perrot_et_al:LIPIcs.SAND.2024.19,
author = {Perrot, K\'{e}vin and Sen\'{e}, Sylvain and Tapin, L\'{e}ah},
title = {{Complexity of Boolean Automata Networks Under Block-Parallel Update Modes}},
booktitle = {3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)},
pages = {19:1--19:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-315-7},
ISSN = {1868-8969},
year = {2024},
volume = {292},
editor = {Casteigts, Arnaud and Kuhn, Fabian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.19},
URN = {urn:nbn:de:0030-drops-198973},
doi = {10.4230/LIPIcs.SAND.2024.19},
annote = {Keywords: Boolean networks, finite dynamical systems, block-parallel update schedule}
}
@InProceedings{sharma_et_al:LIPIcs.SAND.2024.20,
author = {Sharma, Avisek and Ghosh, Satakshi and Goswami, Pritam and Sau, Buddhadeb},
title = {{Space and Move-Optimal Arbitrary Pattern Formation on Infinite Rectangular Grid by Oblivious Robot Swarm}},
booktitle = {3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)},
pages = {20:1--20:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-315-7},
ISSN = {1868-8969},
year = {2024},
volume = {292},
editor = {Casteigts, Arnaud and Kuhn, Fabian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.20},
URN = {urn:nbn:de:0030-drops-198989},
doi = {10.4230/LIPIcs.SAND.2024.20},
annote = {Keywords: Distributed algorithms, Oblivious robots, Optimal algorithms, Swarm robotics, Space optimization, and Rectangular grid}
}
@InProceedings{zheng_et_al:LIPIcs.SAND.2024.21,
author = {Zheng, Haozhi and Eguchi, Ryota and Ooshita, Fukuhito and Inoue, Michiko},
title = {{Gathering in Carrier Graphs: Meeting via Public Transportation System}},
booktitle = {3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)},
pages = {21:1--21:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-315-7},
ISSN = {1868-8969},
year = {2024},
volume = {292},
editor = {Casteigts, Arnaud and Kuhn, Fabian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.21},
URN = {urn:nbn:de:0030-drops-198998},
doi = {10.4230/LIPIcs.SAND.2024.21},
annote = {Keywords: Gathering, Carrier Graph, Time-varying Graph, Mobile agent}
}
@InProceedings{adamson_et_al:LIPIcs.SAND.2024.22,
author = {Adamson, Duncan and Flaherty, Nathan and Potapov, Igor and Spirakis, Paul G.},
title = {{Brief Announcement: Collision-Free Robot Scheduling}},
booktitle = {3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)},
pages = {22:1--22:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-315-7},
ISSN = {1868-8969},
year = {2024},
volume = {292},
editor = {Casteigts, Arnaud and Kuhn, Fabian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.22},
URN = {urn:nbn:de:0030-drops-199004},
doi = {10.4230/LIPIcs.SAND.2024.22},
annote = {Keywords: Graph Exploration, Scheduling, NP-Completeness, Approximation Algorithms}
}
@InProceedings{almalki_et_al:LIPIcs.SAND.2024.23,
author = {Almalki, Nada and Gupta, Siddharth and Michail, Othon},
title = {{Brief Announcement: On the Exponential Growth of Geometric Shapes}},
booktitle = {3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)},
pages = {23:1--23:6},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-315-7},
ISSN = {1868-8969},
year = {2024},
volume = {292},
editor = {Casteigts, Arnaud and Kuhn, Fabian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.23},
URN = {urn:nbn:de:0030-drops-199015},
doi = {10.4230/LIPIcs.SAND.2024.23},
annote = {Keywords: centralized algorithm, growth process, collision, programmable matter}
}
@InProceedings{balev_et_al:LIPIcs.SAND.2024.24,
author = {Balev, Stefan and Pign\'{e}, Yoann and Sanlaville, \'{E}ric and Vernet, Mathilde},
title = {{Brief Announcement: The Dynamic Steiner Tree Problem: Definitions, Complexity, Algorithms}},
booktitle = {3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)},
pages = {24:1--24:6},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-315-7},
ISSN = {1868-8969},
year = {2024},
volume = {292},
editor = {Casteigts, Arnaud and Kuhn, Fabian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.24},
URN = {urn:nbn:de:0030-drops-199026},
doi = {10.4230/LIPIcs.SAND.2024.24},
annote = {Keywords: Steiner Tree, Dynamic Graph, Complexity, experimental study}
}
@InProceedings{bramas_et_al:LIPIcs.SAND.2024.25,
author = {Bramas, Quentin and Masuzawa, Toshimitsu and Tixeuil, S\'{e}bastien},
title = {{Brief Announcement: Crash-Tolerant Exploration of Trees by Energy Sharing Mobile Agents}},
booktitle = {3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)},
pages = {25:1--25:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-315-7},
ISSN = {1868-8969},
year = {2024},
volume = {292},
editor = {Casteigts, Arnaud and Kuhn, Fabian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.25},
URN = {urn:nbn:de:0030-drops-199031},
doi = {10.4230/LIPIcs.SAND.2024.25},
annote = {Keywords: Mobile Agents, Distributed Algorithms, Energy sharing}
}
@InProceedings{gupta_et_al:LIPIcs.SAND.2024.26,
author = {Gupta, Siddharth and van Kreveld, Marc and Michail, Othon and Padalkin, Andreas},
title = {{Brief Announcement: Collision Detection for Modular Robots - It Is Easy to Cause Collisions and Hard to Avoid Them}},
booktitle = {3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)},
pages = {26:1--26:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-315-7},
ISSN = {1868-8969},
year = {2024},
volume = {292},
editor = {Casteigts, Arnaud and Kuhn, Fabian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.26},
URN = {urn:nbn:de:0030-drops-199044},
doi = {10.4230/LIPIcs.SAND.2024.26},
annote = {Keywords: Modular robots, Collision detection, Computational Geometry, Complexity}
}
@InProceedings{mertzios_et_al:LIPIcs.SAND.2024.27,
author = {Mertzios, George B. and Nikoletseas, Sotiris and Raptopoulos, Christoforos and Spirakis, Paul G.},
title = {{Brief Announcement: On the Existence of \delta-Temporal Cliques in Random Simple Temporal Graphs}},
booktitle = {3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)},
pages = {27:1--27:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-315-7},
ISSN = {1868-8969},
year = {2024},
volume = {292},
editor = {Casteigts, Arnaud and Kuhn, Fabian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.27},
URN = {urn:nbn:de:0030-drops-199056},
doi = {10.4230/LIPIcs.SAND.2024.27},
annote = {Keywords: Simple random temporal graph, \delta-temporal clique, probabilistic method}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing