The following pages link to Gabriele Di Stefano (Q169277):
Displayed 50 items.
- On the online track assignment problem (Q423916) (← links)
- Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances (Q454883) (← links)
- Computing on rings by oblivious robots: a unified approach for different tasks (Q494795) (← links)
- Gathering of oblivious robots on infinite grids with minimum traveled distance (Q528200) (← links)
- Networks with small stretch number (Q876723) (← links)
- Gathering of robots on anonymous grids and trees without multiplicity detection (Q896693) (← links)
- Dynamic multi-level overlay graphs for shortest paths (Q943005) (← links)
- On minimum \(k\)-modal partitions of permutations (Q1018088) (← links)
- Item:Q169277 (redirect page) (← links)
- Treelike comparability graphs (Q1026130) (← links)
- Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases (Q1041435) (← links)
- On the extension of bipartite to parity graphs (Q1302156) (← links)
- Graph classes between parity and distance-hereditary graphs (Q1302157) (← links)
- A fully dynamic algorithm for distributed shortest paths. (Q1401293) (← links)
- Static and dynamic low-congested interval routing schemes (Q1605315) (← 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)
- Distance-hereditary comparability graphs (Q1759843) (← links)
- (\(k,+\))-distance-hereditary graphs (Q1827274) (← links)
- Engineering a new algorithm for distributed shortest paths on dynamic networks (Q1949761) (← links)
- Bamboo garden trimming problem: priority schedulings (Q2003325) (← links)
- On the effectiveness of the genetic paradigm for polygonization (Q2032170) (← links)
- On the mutual visibility in Cartesian products and triangle-free graphs (Q2096353) (← links)
- Arbitrary pattern formation on infinite regular tessellation graphs (Q2110359) (← links)
- A graph theoretical approach to the firebreak locating problem (Q2124231) (← links)
- Priority scheduling in the bamboo garden trimming problem (Q2206222) (← links)
- Gathering robots in graphs: the central role of synchronicity (Q2215970) (← links)
- Gathering on rings under the look-compute-move model (Q2256947) (← links)
- Partially dynamic efficient algorithms for distributed shortest paths (Q2268860) (← 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)
- Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings (Q2407627) (← links)
- Approximation algorithms for decomposing octilinear polygons (Q2420578) (← links)
- Asynchronous arbitrary pattern formation: the effects of a rigorous approach (Q2422768) (← links)
- Minimize the maximum duty in multi-interface networks (Q2429355) (← links)
- Gathering six oblivious robots on anonymous symmetric rings (Q2447532) (← links)
- Track assignment (Q2457297) (← links)
- Self-spanner graphs (Q2565853) (← links)
- Mutual visibility in graphs (Q2668324) (← links)
- (Q2766673) (← links)
- About Ungatherability of Oblivious and Asynchronous Robots on Anonymous Rings (Q2798226) (← links)
- Distance-Hereditary Comparability Graphs (Q2840542) (← links)
- (Q2847382) (← links)
- (Q2867368) (← links)
- Optimal Gathering of Oblivious Robots in Anonymous Graphs (Q2868646) (← links)
- (Q2917363) (← links)
- (Q2917368) (← links)