The following pages link to Gabriele Di Stefano (Q169277):
Displayed 37 items.
- (Q2917373) (← links)
- Decomposing Octilinear Polygons into Triangles and Rectangles (Q2945661) (← 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)
- Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks (Q3066463) (← links)
- Min-Max Coverage in Multi-interface Networks (Q3075516) (← links)
- Bandwidth Constrained Multi-interface Networks (Q3075517) (← links)
- Online Bounded Coloring of Permutation and Overlap Graphs (Q3503553) (← links)
- On Minimum k-Modal Partitions of Permutations (Q3525774) (← links)
- Recoverable Robust Timetables on Trees (Q3637092) (← links)
- Recoverable Robustness in Shunting and Timetabling (Q3649158) (← links)
- Evaluation of Recoverable-Robust Timetables on Tree Networks (Q3651532) (← links)
- (Q4217589) (← links)
- (Q4232787) (← links)
- (Q4448748) (← links)
- (Q4508381) (← links)
- (Q4511227) (← links)
- Low-congested interval routing schemes for hypercubelike networks (Q4520243) (← links)
- How to Gather Asynchronous Oblivious Robots on Anonymous Rings (Q4909421) (← links)
- Flow Problems in Multi-Interface Networks (Q5268319) (← links)
- Recoverable Robust Timetables: An Algorithmic Approach on Trees (Q5280617) (← links)
- Delay Management Problem: Complexity Results and Robust Algorithms (Q5505683) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710821) (← links)
- Graphs with bounded induced distance (Q5928866) (← links)
- Compact-port routing models and applications to distance-hereditary graphs (Q5959185) (← links)
- Variety of mutual-visibility problems in graphs (Q6049930) (← links)
- A structured methodology for designing distributed algorithms for mobile entities (Q6065957) (← links)
- Molecular robots with chirality on grids (Q6111996) (← links)
- Molecular pattern formation on grids in the \textsc{Moblot} model (Q6131197) (← links)
- On monophonic position sets in graphs (Q6356448) (← links)
- Mutual Visibility in Graphs (Q6367006) (← links)
- On the mutual visibility in Cartesian products and triangle-free graphs (Q6386633) (← links)
- On the Vertex Position Number of Graphs (Q6409449) (← links)
- Mutual-visibility in strong products of graphs via total mutual-visibility (Q6413953) (← links)
- Mutual-visibility in distance-hereditary graphs: a linear-time algorithm (Q6444452) (← links)
- Time-optimal geodesic mutual visibility of robots on grids within minimum area (Q6446198) (← links)
- Mutual visibility in hypercube-like graphs (Q6448885) (← links)