Linked e-resources
Details
Table of Contents
Segment Visibility for k-transmitters
Conflict Resolution in Arbitrary Hypergraphs
Dispatching the Minimum Number of UAVs in Neighborhood IoT Networks
Mutual Visibility with ASYNC Luminous Robots having Inaccurate Movements
Minimum Degree and Connectivity in 1-Dimensional Line of Sight Networks
WUBBLE: Energy Efficient BLE Neighborhood Discovery Leveraging Wake-up Radio
Byzantine Fault-Tolerant Protocols for $(n, f)$-evacuation from a Circle
Temporal Reachability Dominating Sets: contagion in temporal graphs
Fair Scheduling Under Packet Management: Competitive Analysis of Age of Information
Run for Cover: Dominating Set via Mobile Agents.
Conflict Resolution in Arbitrary Hypergraphs
Dispatching the Minimum Number of UAVs in Neighborhood IoT Networks
Mutual Visibility with ASYNC Luminous Robots having Inaccurate Movements
Minimum Degree and Connectivity in 1-Dimensional Line of Sight Networks
WUBBLE: Energy Efficient BLE Neighborhood Discovery Leveraging Wake-up Radio
Byzantine Fault-Tolerant Protocols for $(n, f)$-evacuation from a Circle
Temporal Reachability Dominating Sets: contagion in temporal graphs
Fair Scheduling Under Packet Management: Competitive Analysis of Age of Information
Run for Cover: Dominating Set via Mobile Agents.