The following pages link to Evangelos Kranakis (Q215100):
Displaying 50 items.
- The pony express communication problem (Q2115855) (← links)
- Graph exploration by energy-sharing mobile agents (Q2117723) (← links)
- On convergence and threshold properties of discrete Lotka-Volterra population protocols (Q2168846) (← links)
- Treasure evacuation with one robot on a disk (Q2220826) (← links)
- The bike sharing problem (Q2232233) (← links)
- Searching for a non-adversarial, uncooperative agent on a cycle (Q2285151) (← links)
- Priority evacuation from a disk: the case of \(n = 1,2,3\) (Q2285157) (← links)
- Weak coverage of a rectangular barrier (Q2300721) (← links)
- Group search of the plane with faulty robots (Q2326387) (← links)
- Complexity of barrier coverage with relocatable sensors in the plane (Q2344757) (← links)
- Excuse me! or the courteous theatregoers' problem (Q2347004) (← links)
- Connectivity and stretch factor trade-offs in wireless sensor networks with directional antennae (Q2348034) (← links)
- Asynchronous deterministic rendezvous in graphs (Q2369001) (← links)
- Approximate hotlink assignment (Q2390237) (← links)
- Asymptotic number of hairpins of saturated RNA secondary structures (Q2446792) (← links)
- Deterministic M2M multicast in radio networks (Q2508975) (← links)
- Games on triangulations (Q2570126) (← links)
- Broadcasting in unlabeled hypercubes with a linear number of messages. (Q2583557) (← links)
- On the displacement for covering a unit interval with randomly placed sensors (Q2630340) (← links)
- (Q2728846) (← links)
- (Q2728847) (← links)
- (Q2729093) (← links)
- Fault-tolerant broadcasting in radio networks (Q2731601) (← links)
- Cutting circles into equal area pieces (Q2752519) (← links)
- Locating information with uncertainty in fully interconnected networks with applications to world wide web information retrieval (Q2765224) (← links)
- Optimal adaptive fault diagnosis for simple multiprocessor systems (Q2766104) (← links)
- (Q2766883) (← links)
- Survivability of bouncing robots (Q2821106) (← links)
- Know When to Persist: Deriving Value from a Stream Buffer (Q2830062) (← links)
- Reconstructing Cactus Graphs from Shortest Path Information (Q2830066) (← links)
- Sensor allocation problems on the real line (Q2836224) (← links)
- Approximation Algorithms for the Antenna Orientation Problem (Q2842787) (← links)
- Preventing the Cluster Formation Attack against the Hierarchical OLSR Protocol (Q2889824) (← links)
- Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points (Q2894470) (← links)
- Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs (Q2907493) (← links)
- Strong Connectivity of Sensor Networks with Double Antennae (Q2913213) (← links)
- Displacing Random Sensors to Avoid Interference (Q2920485) (← links)
- Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs (Q2971126) (← links)
- Distributed Patrolling with Two-Speed Robots (and an Application to Transportation) (Q2980175) (← links)
- The diameter and connectivity of networks with random dependent faults (Q3057173) (← links)
- Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs (Q3066172) (← links)
- Strong Connectivity in Sensor Networks with Given Number of Directional Antennae of Bounded Angle (Q3066444) (← links)
- Optimal Balancing of Satellite Queues in Packet Transmission to Ground Stations (Q3066467) (← links)
- Computing Majority with Triple Queries (Q3087986) (← links)
- Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds (Q3092272) (← links)
- Distributed Computing on Anonymous Hypercube Networks (Q3128984) (← links)
- BOUNDED LENGTH, 2-EDGE AUGMENTATION OF GEOMETRIC PLANAR GRAPHS (Q3166746) (← links)
- STRONG CONNECTIVITY IN SENSOR NETWORKS WITH GIVEN NUMBER OF DIRECTIONAL ANTENNAE OF BOUNDED ANGLE (Q3166749) (← links)
- Stretch Factor in Wireless Sensor Networks with Directional Antennae (Q3167346) (← links)
- (Q3181699) (← links)
