@Proceedings{doty_et_al:LIPIcs.SAND.2023,
title = {{LIPIcs, Volume 257, SAND 2023, Complete Volume}},
booktitle = {2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023)},
pages = {1--278},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-275-4},
ISSN = {1868-8969},
year = {2023},
volume = {257},
editor = {Doty, David and Spirakis, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2023},
URN = {urn:nbn:de:0030-drops-179357},
doi = {10.4230/LIPIcs.SAND.2023},
annote = {Keywords: LIPIcs, Volume 257, SAND 2023, Complete Volume}
}
@InProceedings{doty_et_al:LIPIcs.SAND.2023.0,
author = {Doty, David and Spirakis, Paul},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023)},
pages = {0:i--0:x},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-275-4},
ISSN = {1868-8969},
year = {2023},
volume = {257},
editor = {Doty, David and Spirakis, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2023.0},
URN = {urn:nbn:de:0030-drops-179367},
doi = {10.4230/LIPIcs.SAND.2023.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{ibiapina_et_al:LIPIcs.SAND.2023.1,
author = {Ibiapina, Allen and Silva, Ana},
title = {{Snapshot Disjointness in Temporal Graphs}},
booktitle = {2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023)},
pages = {1:1--1:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-275-4},
ISSN = {1868-8969},
year = {2023},
volume = {257},
editor = {Doty, David and Spirakis, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2023.1},
URN = {urn:nbn:de:0030-drops-179379},
doi = {10.4230/LIPIcs.SAND.2023.1},
annote = {Keywords: Temporal graphs, Menger’s Theorem, Snapshot disjointness}
}
@InProceedings{shibata_et_al:LIPIcs.SAND.2023.2,
author = {Shibata, Masahiro and Kitamura, Naoki and Eguchi, Ryota and Sudo, Yuichi and Nakamura, Junya and Kim, Yonghwan},
title = {{Partial Gathering of Mobile Agents in Dynamic Tori}},
booktitle = {2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023)},
pages = {2:1--2:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-275-4},
ISSN = {1868-8969},
year = {2023},
volume = {257},
editor = {Doty, David and Spirakis, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2023.2},
URN = {urn:nbn:de:0030-drops-179387},
doi = {10.4230/LIPIcs.SAND.2023.2},
annote = {Keywords: distributed system, mobile agents, partial gathering, dynamic tori}
}
@InProceedings{becchetti_et_al:LIPIcs.SAND.2023.3,
author = {Becchetti, Luca and Clementi, Andrea and Pasquale, Francesco and Trevisan, Luca and Ziccardi, Isabella},
title = {{Bond Percolation in Small-World Graphs with Power-Law Distribution}},
booktitle = {2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023)},
pages = {3:1--3:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-275-4},
ISSN = {1868-8969},
year = {2023},
volume = {257},
editor = {Doty, David and Spirakis, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2023.3},
URN = {urn:nbn:de:0030-drops-179392},
doi = {10.4230/LIPIcs.SAND.2023.3},
annote = {Keywords: Information spreading, gossiping, epidemics, fault-tolerance, network self-organization and formation, complex systems, social and transportation networks}
}
@InProceedings{brunelli_et_al:LIPIcs.SAND.2023.4,
author = {Brunelli, Filippo and Viennot, Laurent},
title = {{Computing Temporal Reachability Under Waiting-Time Constraints in Linear Time}},
booktitle = {2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023)},
pages = {4:1--4:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-275-4},
ISSN = {1868-8969},
year = {2023},
volume = {257},
editor = {Doty, David and Spirakis, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2023.4},
URN = {urn:nbn:de:0030-drops-179402},
doi = {10.4230/LIPIcs.SAND.2023.4},
annote = {Keywords: temporal reachability, temporal graph, temporal path, temporal walk, waiting-time constraints, restless temporal walk, linear time}
}
@InProceedings{ani_et_al:LIPIcs.SAND.2023.5,
author = {Ani, Joshua and Coulombe, Michael and Demaine, Erik D. and Diomidov, Yevhenii and Gomez, Timothy and Hendrickson, Dylan and Lynch, Jayson},
title = {{Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines}},
booktitle = {2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023)},
pages = {5:1--5:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-275-4},
ISSN = {1868-8969},
year = {2023},
volume = {257},
editor = {Doty, David and Spirakis, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2023.5},
URN = {urn:nbn:de:0030-drops-179414},
doi = {10.4230/LIPIcs.SAND.2023.5},
annote = {Keywords: Gadgets, robots, undecidability, Petri nets}
}
@InProceedings{oh_et_al:LIPIcs.SAND.2023.6,
author = {Oh, Shunhao and Randall, Dana and Richa, Andr\'{e}a W.},
title = {{Adaptive Collective Responses to Local Stimuli in Anonymous Dynamic Networks}},
booktitle = {2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023)},
pages = {6:1--6:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-275-4},
ISSN = {1868-8969},
year = {2023},
volume = {257},
editor = {Doty, David and Spirakis, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2023.6},
URN = {urn:nbn:de:0030-drops-179424},
doi = {10.4230/LIPIcs.SAND.2023.6},
annote = {Keywords: Dynamic networks, adaptive stimuli, foraging, self-organizing particle systems, programmable matter}
}
@InProceedings{dubois_et_al:LIPIcs.SAND.2023.7,
author = {Dubois, Swan and Feuilloley, Laurent and Petit, Franck and Rabie, Mika\"{e}l},
title = {{When Should You Wait Before Updating? - Toward a Robustness Refinement}},
booktitle = {2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023)},
pages = {7:1--7:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-275-4},
ISSN = {1868-8969},
year = {2023},
volume = {257},
editor = {Doty, David and Spirakis, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2023.7},
URN = {urn:nbn:de:0030-drops-179435},
doi = {10.4230/LIPIcs.SAND.2023.7},
annote = {Keywords: Robustness, dynamic network, temporal graphs, edge removal, connectivity, footprint, packing/covering problems, maximal independent set, maximal matching, minimum dominating set, perfect matching, NP-hardness}
}
@InProceedings{bridonneau_et_al:LIPIcs.SAND.2023.8,
author = {Bridonneau, Vincent and Guinand, Fr\'{e}d\'{e}ric and Pign\'{e}, Yoann},
title = {{Dynamic Graphs Generators Analysis: An Illustrative Case Study}},
booktitle = {2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023)},
pages = {8:1--8:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-275-4},
ISSN = {1868-8969},
year = {2023},
volume = {257},
editor = {Doty, David and Spirakis, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2023.8},
URN = {urn:nbn:de:0030-drops-179443},
doi = {10.4230/LIPIcs.SAND.2023.8},
annote = {Keywords: Dynamic Graphs, Graph Generation, Graph Properties, Evolutionary models}
}
@InProceedings{boeckmann_et_al:LIPIcs.SAND.2023.9,
author = {Boeckmann, Jan and Thielen, Clemens and Wittmann, Alina},
title = {{Complexity of the Temporal Shortest Path Interdiction Problem}},
booktitle = {2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023)},
pages = {9:1--9:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-275-4},
ISSN = {1868-8969},
year = {2023},
volume = {257},
editor = {Doty, David and Spirakis, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2023.9},
URN = {urn:nbn:de:0030-drops-179455},
doi = {10.4230/LIPIcs.SAND.2023.9},
annote = {Keywords: Temporal Graphs, Interdiction Problems, Complexity, Shortest Paths, Most Vital Arcs}
}
@InProceedings{chazelle_et_al:LIPIcs.SAND.2023.10,
author = {Chazelle, Bernard and Karntikoon, Kritkorn},
title = {{A Connectivity-Sensitive Approach to Consensus Dynamics}},
booktitle = {2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023)},
pages = {10:1--10:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-275-4},
ISSN = {1868-8969},
year = {2023},
volume = {257},
editor = {Doty, David and Spirakis, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2023.10},
URN = {urn:nbn:de:0030-drops-179464},
doi = {10.4230/LIPIcs.SAND.2023.10},
annote = {Keywords: s-energy, dynamic networks, relaxation time, multiagent systems}
}
@InProceedings{cohen_et_al:LIPIcs.SAND.2023.11,
author = {Cohen, Johanne and Pilard, Laurence and Rabie, Mika\"{e}l and S\'{e}nizergues, Jonas},
title = {{Making Self-Stabilizing Algorithms for Any Locally Greedy Problem}},
booktitle = {2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023)},
pages = {11:1--11:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-275-4},
ISSN = {1868-8969},
year = {2023},
volume = {257},
editor = {Doty, David and Spirakis, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2023.11},
URN = {urn:nbn:de:0030-drops-179475},
doi = {10.4230/LIPIcs.SAND.2023.11},
annote = {Keywords: Greedy Problem, Ruling Set, Distance-K Coloring, Self-Stabilizing Algorithm}
}
@InProceedings{alaniz_et_al:LIPIcs.SAND.2023.12,
author = {Alaniz, Robert M. and Caballero, David and Gomez, Timothy and Grizzell, Elise and Rodriguez, Andrew and Schweller, Robert and Wylie, Tim},
title = {{Covert Computation in the Abstract Tile-Assembly Model}},
booktitle = {2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023)},
pages = {12:1--12:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-275-4},
ISSN = {1868-8969},
year = {2023},
volume = {257},
editor = {Doty, David and Spirakis, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2023.12},
URN = {urn:nbn:de:0030-drops-179482},
doi = {10.4230/LIPIcs.SAND.2023.12},
annote = {Keywords: self-assembly, covert computation, atam}
}
@InProceedings{bellitto_et_al:LIPIcs.SAND.2023.13,
author = {Bellitto, Thomas and Conchon-Kerjan, Cyril and Escoffier, Bruno},
title = {{Restless Exploration of Periodic Temporal Graphs}},
booktitle = {2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023)},
pages = {13:1--13:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-275-4},
ISSN = {1868-8969},
year = {2023},
volume = {257},
editor = {Doty, David and Spirakis, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2023.13},
URN = {urn:nbn:de:0030-drops-179497},
doi = {10.4230/LIPIcs.SAND.2023.13},
annote = {Keywords: Temporal graphs, Graph exploration, NP-completeness}
}
@InProceedings{chimani_et_al:LIPIcs.SAND.2023.14,
author = {Chimani, Markus and Troost, Niklas},
title = {{Multistage Shortest Path: Instances and Practical Evaluation}},
booktitle = {2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023)},
pages = {14:1--14:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-275-4},
ISSN = {1868-8969},
year = {2023},
volume = {257},
editor = {Doty, David and Spirakis, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2023.14},
URN = {urn:nbn:de:0030-drops-179507},
doi = {10.4230/LIPIcs.SAND.2023.14},
annote = {Keywords: Multistage Graphs, Shortest Paths, Experiments}
}
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