Linked e-resources
Details
Table of Contents
Mobility Management
Evacuation of equilateral triangles by mobile agents of limited communication range
Fast Dispersion of Mobile Robots on Arbitrary Graphs
Pushing Lines Helps: Efficient Universal Centralised Transformations for Programmable Matter
Foundations
Existence of Connected Intersection-Free Subgraphs in Graphs with Redundancy and Coexistence Property
Vertex-Connectivity for Node Failure Identification in Boolean Network Tomography
Reception Capacity: Definitions, Game Theory and Hardness
Wireless Communication
Collaborative Broadcast in O(log log n) Rounds
Multi-Channel Assignment and Link Scheduling for Prioritized Latency-Sensitive Applications
Throughput and Packet Displacements of Dynamic Broadcasting Algorithms
Faulty Robots
Chauffeuring a Crashed Robot from a Disk
Optimal Cycle Search Despite the Presence of Faulty Robots.
Evacuation of equilateral triangles by mobile agents of limited communication range
Fast Dispersion of Mobile Robots on Arbitrary Graphs
Pushing Lines Helps: Efficient Universal Centralised Transformations for Programmable Matter
Foundations
Existence of Connected Intersection-Free Subgraphs in Graphs with Redundancy and Coexistence Property
Vertex-Connectivity for Node Failure Identification in Boolean Network Tomography
Reception Capacity: Definitions, Game Theory and Hardness
Wireless Communication
Collaborative Broadcast in O(log log n) Rounds
Multi-Channel Assignment and Link Scheduling for Prioritized Latency-Sensitive Applications
Throughput and Packet Displacements of Dynamic Broadcasting Algorithms
Faulty Robots
Chauffeuring a Crashed Robot from a Disk
Optimal Cycle Search Despite the Presence of Faulty Robots.