default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID2nd SAND 2023: Pisa, Italy
- David Doty
, Paul G. Spirakis:
2nd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2023, June 19-21, 2023, Pisa, Italy. LIPIcs 257, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-275-4 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:10
- Allen Ibiapina, Ana Silva:
Snapshot Disjointness in Temporal Graphs. 1:1-1:20 - Masahiro Shibata, Naoki Kitamura, Ryota Eguchi, Yuichi Sudo, Junya Nakamura, Yonghwan Kim:
Partial Gathering of Mobile Agents in Dynamic Tori. 2:1-2:22 - Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi:
Bond Percolation in Small-World Graphs with Power-Law Distribution. 3:1-3:22 - Filippo Brunelli, Laurent Viennot:
Computing Temporal Reachability Under Waiting-Time Constraints in Linear Time. 4:1-4:11 - Joshua Ani, Michael J. Coulombe, Erik D. Demaine, Yevhenii Diomidov, Timothy Gomez, Dylan H. Hendrickson, Jayson Lynch:
Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines. 5:1-5:21 - Shunhao Oh, Dana Randall, Andréa W. Richa:
Adaptive Collective Responses to Local Stimuli in Anonymous Dynamic Networks. 6:1-6:23 - Swan Dubois, Laurent Feuilloley, Franck Petit, Mikaël Rabie:
When Should You Wait Before Updating? - Toward a Robustness Refinement. 7:1-7:15 - Vincent Bridonneau, Frédéric Guinand, Yoann Pigné:
Dynamic Graphs Generators Analysis: An Illustrative Case Study. 8:1-8:19 - Jan Boeckmann, Clemens Thielen, Alina Wittmann:
Complexity of the Temporal Shortest Path Interdiction Problem. 9:1-9:20 - Bernard Chazelle, Kritkorn Karntikoon:
A Connectivity-Sensitive Approach to Consensus Dynamics. 10:1-10:17 - Johanne Cohen, Laurence Pilard, Mikaël Rabie, Jonas Sénizergues:
Making Self-Stabilizing Algorithms for Any Locally Greedy Problem. 11:1-11:17 - Robert M. Alaniz, David Caballero, Timothy Gomez, Elise Grizzell, Andrew Rodriguez, Robert T. Schweller, Tim Wylie:
Covert Computation in the Abstract Tile-Assembly Model. 12:1-12:17 - Thomas Bellitto, Cyril Conchon-Kerjan, Bruno Escoffier:
Restless Exploration of Periodic Temporal Graphs. 13:1-13:15 - Markus Chimani, Niklas Troost:
Multistage Shortest Path: Instances and Practical Evaluation. 14:1-14:19
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-08 20:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
