Robot Planning -- The Multi-source Beachcombers Problem -- Multi-Robot Foremost Coverage of Time-Varying Graphs -- Strategies for Parallel Unaware Cleaners -- Minimum-Traveled-Distance Gathering of Oblivious Robots over Given Meeting Points -- Algorithms and Data Structures on Graphs Fast Rendezvous with Advice -- Computing the Dynamic Diameter of Non-Deterministic Dynamic Networks is Hard -- Improved Spanners in Networks with Symmetric Directional Antennas -- Wireless Networks -- Exploiting Geometry in the SINRk Model -- Interference Minimization in Asymmetric Sensor Networks -- Minimum Latency Aggregation Scheduling in Wireless Sensor Networks.