Abstract is missing.
- The Multi-source Beachcombers' ProblemJurek Czyzowicz, Leszek Gasieniec, Konstantinos Georgiou, Evangelos Kranakis, Fraser MacQuarrie. 3-21 [doi]
- Multi-Robot Foremost Coverage of Time-Varying GraphsEric Aaron, Danny Krizanc, Elliot Meyerson. 22-38 [doi]
- Strategies for Parallel Unaware CleanersChristian Ortolf, Christian Schindelhauer. 39-56 [doi]
- Minimum-Traveled-Distance Gathering of Oblivious Robots over Given Meeting PointsSerafino Cicerone, Gabriele Di Stefano, Alfredo Navarra. 57-72 [doi]
- Fast Rendezvous with AdviceAvery Miller, Andrzej Pelc. 75-87 [doi]
- Computing the Dynamic Diameter of Non-Deterministic Dynamic Networks is HardEmmanuel Godard, Dorian Mazauric. 88-102 [doi]
- Improved Spanners in Networks with Symmetric Directional AntennasStefan Dobrev, Milan Plzík. 103-121 [doi]
- Exploiting Geometry in the SINR _k ModelRom Aschner, Gui Citovsky, Matthew J. Katz. 125-135 [doi]
- Interference Minimization in Asymmetric Sensor NetworksYves Brise, Kevin Buchin, Dustin Eversmann, Michael Hoffmann, Wolfgang Mulzer. 136-151 [doi]
- Minimum Latency Aggregation Scheduling in Wireless Sensor NetworksJonathan Gagnon, Lata Narayanan. 152-168 [doi]