The following pages link to Alfredo Navarra (Q393043):
Displaying 50 items.
- Maximum matching in multi-interface networks (Q393046) (← links)
- Distributed colorings for collision-free routing in sink-centric sensor networks (Q450566) (← links)
- Computing on rings by oblivious robots: a unified approach for different tasks (Q494795) (← links)
- A unified approach for gathering and exclusive searching on rings under weak assumptions (Q518678) (← links)
- Gathering of oblivious robots on infinite grids with minimum traveled distance (Q528200) (← links)
- Synchronous black hole search in directed graphs (Q719316) (← links)
- Synchronous robots vs asynchronous lights-enhanced robots on graphs (Q737100) (← links)
- Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications (Q849632) (← links)
- Sharing the cost of multicast transmissions in wireless networks (Q861267) (← links)
- Explore and repair graphs with black holes using mobile entities (Q888441) (← links)
- Gathering of robots on anonymous grids and trees without multiplicity detection (Q896693) (← links)
- Asymptotically optimal solutions for small world graphs (Q927399) (← links)
- Fast periodic graph exploration with constant memory (Q931724) (← links)
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring (Q986558) (← links)
- Layouts for mobility management in wireless ATM networks (Q1003759) (← links)
- Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases (Q1041435) (← links)
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane (Q1627966) (← links)
- Asynchronous embedded pattern formation without orientation (Q1660923) (← links)
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms (Q1699417) (← links)
- Turning cliques into paths to achieve planarity (Q1725735) (← links)
- On routing of wavebands for all-to-all communications in all-optical paths and cycles (Q1770374) (← links)
- Approximation bounds for the minimum \(k\)-storage problem (Q1796432) (← links)
- Bamboo garden trimming problem: priority schedulings (Q2003325) (← links)
- On the effectiveness of the genetic paradigm for polygonization (Q2032170) (← links)
- Arbitrary pattern formation on infinite regular tessellation graphs (Q2110359) (← links)
- Priority scheduling in the bamboo garden trimming problem (Q2206222) (← links)
- On the curve complexity of 3-colored point-set embeddings (Q2210505) (← links)
- Gathering robots in graphs: the central role of synchronicity (Q2215970) (← links)
- Gathering on rings under the look-compute-move model (Q2256947) (← links)
- Fair Hitting Sequence Problem: scheduling activities with varied frequency requirements (Q2294049) (← links)
- Asynchronous rendezvous with different maps (Q2303286) (← links)
- Gathering synchronous robots in graphs: from general properties to dense and symmetric topologies (Q2303287) (← links)
- Embedded pattern formation by asynchronous robots without chirality (Q2318112) (← links)
- The minimum \(k\)-storage problem on directed graphs (Q2355709) (← links)
- Online knapsack of unknown capacity. How to optimize energy consumption in smartphones (Q2405900) (← links)
- Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings (Q2407627) (← links)
- Maximizing the overall end-user satisfaction of data broadcast in wireless mesh networks (Q2407947) (← links)
- Asynchronous arbitrary pattern formation: the effects of a rigorous approach (Q2422768) (← links)
- Graph decomposition for memoryless periodic exploration (Q2429354) (← links)
- Minimize the maximum duty in multi-interface networks (Q2429355) (← links)
- Gathering six oblivious robots on anonymous symmetric rings (Q2447532) (← links)
- Improved approximation results for the minimum energy broadcasting problem (Q2471706) (← links)
- About Ungatherability of Oblivious and Asynchronous Robots on Anonymous Rings (Q2798226) (← links)
- (Q2867368) (← links)
- (Q2867370) (← links)
- Optimal Gathering of Oblivious Robots in Anonymous Graphs (Q2868646) (← links)
- Localization and scheduling protocols for actor-centric sensor networks (Q2894248) (← links)
- (Q2917368) (← links)
- MinMax-Distance Gathering on Given Meeting Points (Q2947015) (← links)
- Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model (Q2961405) (← links)
