The following pages link to Davide Bilò (Q338389):
Displayed 23 items.
- A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners (Q5090997) (← links)
- (Q5091032) (← links)
- An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner (Q5136230) (← links)
- Approximating the Metric TSP in Linear Time (Q5302042) (← links)
- Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem (Q5385930) (← links)
- Locating Facilities on a Network to Minimize Their Average Service Radius (Q5387793) (← links)
- An algorithm composition scheme preserving monotonicity (Q5401463) (← links)
- Network Creation Games with Traceroute-Based Strategies (Q5496160) (← links)
- Structural Information and Communication Complexity (Q5710096) (← links)
- Algorithms and Computation (Q5712107) (← links)
- Approximation and Online Algorithms (Q5713436) (← links)
- New approximation algorithms for the heterogeneous weighted delivery problem (Q5918637) (← links)
- New approximation algorithms for the heterogeneous weighted delivery problem (Q5918793) (← links)
- Tracking routes in communication networks (Q5918972) (← links)
- Tracking routes in communication networks (Q5919484) (← links)
- (Q6075905) (← links)
- Blackout-tolerant temporal spanners (Q6111995) (← links)
- (Q6126249) (← links)
- Blackout-tolerant temporal spanners (Q6141041) (← links)
- Geometric Network Creation Games (Q6141862) (← links)
- (Q6168428) (← links)
- Compact distance oracles with large sensitivity and low stretch (Q6179407) (← links)
- Finding diameter-reducing shortcuts in trees (Q6179408) (← links)