Algorithmics of Wireless Networks

Collision Free Robot Scheduling.- On the Exponential Growth of Geometric Shapes.- Optimizing Robot Dispersion on Unoriented Grids with and without Fault Tolerance.- Channel allocation revisited through 1 extendability of graphs.- On the Min Max Star Partitioning Number.- Collision Detection for Modular Robots it is easy to cause collisions and hard to avoid them.- Bike Assisted Evacuation on a Line of Robots with Communication Faults.- On Permutation Selectors and Their Applications in Ad Hoc Radio Networks Protocols.- Reconfigurable routing in data center networks.- The threshold of existence of delta temporal cliques in random simple temporal graphs.- The Exact Spanning Ratio of the Parallelogram Delaunay Graph.- A 1.5 approximation algorithm for activating 2 disjoint st paths.- Modular population protocols.- Decreasing verification radius in local certification.