| No. |
Title |
Author |
Year |
| 1 |
A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility |
Castenow, Jannik et al. |
2023 |
| 2 |
Algorithmic Aspects of Large and Complex Networks (Dagstuhl Seminar 01381) |
Adler, Micah et al. |
2021 |
| 3 |
Algorithmic Aspects of Large and Complex Networks (Dagstuhl Seminar 03361) |
Adler, Micah et al. |
2021 |
| 4 |
Parallel and Distributed Algorithms (Dagstuhl Seminar 9210) |
Cole, Richard et al. |
2021 |
| 5 |
Parallel and Distributed Algorithms (Dagstuhl Seminar 9337) |
Cole, Richard et al. |
2021 |
| 6 |
Parallel and Distributed Algorithms (Dagstuhl Seminar 9537) |
Dwork, Cynthia et al. |
2021 |
| 7 |
Parallel and Distributed Algorithms (Dagstuhl Seminar 9737) |
Mayr, Ernst W. et al. |
2021 |
| 8 |
Parallel and Distributed Algorithms (Dagstuhl Seminar 99291) |
Maggs, Bruce et al. |
2021 |
| 9 |
Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets |
Hamann, Heiko et al. |
2018 |
| 10 |
05361 Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks |
Leonardi, Stefano et al. |
2006 |
