The following pages link to Gianlorenzo D'Angelo (Q385948):
Displaying 50 items.
- A loop-free shortest-path routing algorithm for dynamic networks (Q385951) (← 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)
- On the maximum betweenness improvement problem (Q737099) (← links)
- Gathering of robots on anonymous grids and trees without multiplicity detection (Q896693) (← links)
- Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios (Q905697) (← links)
- Dynamic multi-level overlay graphs for shortest paths (Q943005) (← links)
- Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases (Q1041435) (← links)
- What can be verified locally? (Q1672006) (← links)
- Engineering graph-based models for dynamic timetable information systems (Q1679616) (← links)
- Recommending links through influence maximization (Q1731508) (← links)
- Approximation bounds for the minimum \(k\)-storage problem (Q1796432) (← links)
- Engineering a new algorithm for distributed shortest paths on dynamic networks (Q1949761) (← links)
- Election control through social influence with unknown preferences (Q2019485) (← links)
- Algorithms for hierarchical and semi-partitioned parallel scheduling (Q2037194) (← links)
- Generalized budgeted submodular set function maximization (Q2051778) (← links)
- Exploiting social influence to control elections based on positional scoring rules (Q2105422) (← links)
- Election control through social influence with voters' uncertainty (Q2168756) (← links)
- On the fixed-parameter tractability of the maximum connectivity improvement problem (Q2195571) (← links)
- Gathering on rings under the look-compute-move model (Q2256947) (← links)
- Partially dynamic efficient algorithms for distributed shortest paths (Q2268860) (← links)
- Finding disjoint paths in networks with star shared risk link groups (Q2344758) (← links)
- The minimum \(k\)-storage problem on directed graphs (Q2355709) (← links)
- Minimize the maximum duty in multi-interface networks (Q2429355) (← links)
- Gathering six oblivious robots on anonymous symmetric rings (Q2447532) (← links)
- The multi-budget maximum weighted coverage problem (Q2692723) (← links)
- Unveiling the truth in liquid democracy with misinformed voters (Q2695433) (← links)
- Preemptive uniprocessor scheduling of mixed-criticality sporadic task systems (Q2796402) (← links)
- Distance Queries in Large-Scale Fully Dynamic Complex Networks (Q2819495) (← links)
- Recoverable robustness for train shunting problems (Q2867368) (← links)
- Arc-flags in dynamic graphs (Q2917325) (← links)
- Robust algorithms and price of robustness in shunting problems (Q2917368) (← links)
- 15. Maintenance of multi-level overlay graphs for timetable queries (Q2917373) (← 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)
- Mixed-Criticality Scheduling of Sporadic Task Systems (Q3092260) (← links)
- The Shortcut Problem - Complexity and Algorithms (Q3143749) (← links)
- Scheduling Real-Time Mixed-Criticality Jobs (Q3586075) (← links)
- The Shortcut Problem – Complexity and Approximation (Q3599067) (← 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)
- Improving the Betweenness Centrality of a Node by Adding Links (Q4555544) (← links)
- Fully Dynamic 2-Hop Cover Labeling (Q4629540) (← links)
- (Q4636605) (← links)
- Fully dynamic update of arc-flags (Q4642489) (← links)
- How to Gather Asynchronous Oblivious Robots on Anonymous Rings (Q4909421) (← links)
- Enhancing the Computation of Distributed Shortest Paths on Real Dynamic Networks (Q4916040) (← links)
