The following pages link to Davide Bilò (Q338389):
Displayed 50 items.
- Exact and approximate algorithms for movement problems on (special classes of) graphs (Q338392) (← links)
- (Q442259) (redirect page) (← links)
- Reconstructing visibility graphs with simple robots (Q442263) (← links)
- Finding best swap edges minimizing the routing cost of a spanning tree (Q476426) (← links)
- Specializations and generalizations of the Stackelberg minimum spanning tree game (Q476917) (← links)
- Reoptimization of the shortest common superstring problem (Q639296) (← links)
- Approximating the metric TSP in linear time (Q649110) (← links)
- Network verification via routing table queries (Q743125) (← links)
- Improved approximability and non-approximability results for graph diameter decreasing problems (Q764323) (← links)
- A faster computation of all the best swap edges of a shortest paths tree (Q893317) (← links)
- On the complexity of minimizing interference in ad-hoc and sensor networks (Q936529) (← links)
- Discovery of network properties with all-shortest-paths queries (Q962167) (← links)
- Dynamic mechanism design (Q1014626) (← links)
- Effective edge-fault-tolerant single-source spanners via best (or good) swap edges (Q1742786) (← links)
- Polygon-constrained motion planning problems (Q1796426) (← links)
- Fault-tolerant approximate shortest-path trees (Q1799205) (← links)
- An improved algorithm for computing all the best swap edges of a tree spanner (Q1986961) (← links)
- On the tree conjecture for the network creation game (Q1987511) (← links)
- Multiple-edge-fault-tolerant approximate shortest-path trees (Q2072097) (← links)
- Cutting bamboo down to size (Q2078615) (← links)
- Almost optimal algorithms for diameter-optimally augmenting trees (Q2167895) (← links)
- The max-distance network creation game on general host graphs (Q2257298) (← links)
- New bounds for the balloon popping problem (Q2354305) (← links)
- New Reoptimization Techniques applied to Steiner Tree Problem (Q2840741) (← links)
- A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree (Q2849307) (← links)
- Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs (Q2868655) (← links)
- New Advances in Reoptimizing the Minimum Steiner Tree Problem (Q2912720) (← links)
- Fault-Tolerant Approximate Shortest-Path Trees (Q2921400) (← links)
- Efficient Oracles and Routing Schemes for Replacement Paths (Q3304107) (← links)
- On the Tree Conjecture for the Network Creation Game (Q3304108) (← links)
- On the Complexity of Two Dots for Narrow Boards and Few Colors. (Q3305725) (← links)
- On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games (Q3305726) (← links)
- Reconstructing Visibility Graphs with Simple Robots (Q3408162) (← links)
- Stability of Networks in Stretchable Graphs (Q3408163) (← links)
- Improved Purely Additive Fault-Tolerant Spanners (Q3452780) (← links)
- A Faster Computation of All the Best Swap Edges of a Tree Spanner (Q3460719) (← links)
- Discovery of Network Properties with All-Shortest-Paths Queries (Q3511392) (← links)
- Reoptimization of Steiner Trees (Q3512464) (← links)
- Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems (Q3574304) (← links)
- Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree (Q3586079) (← links)
- Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems (Q3586080) (← links)
- Reoptimization of Weighted Graph and Covering Problems (Q3602840) (← links)
- On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem (Q3613659) (← links)
- Reoptimization of the Shortest Common Superstring Problem (Q3637106) (← links)
- Multiple-edge-fault-tolerant approximate shortest-path trees (Q4601870) (← links)
- Compact and Fast Sensitivity Oracles for Single-Source Distances (Q4606282) (← links)
- The Max-Distance Network Creation Game on General Host Graphs (Q4915722) (← links)
- New Bounds for the Balloon Popping Problem (Q4925221) (← links)
- (Q5002685) (← links)
- Topological Influence and Locality in Swap Schelling Games. (Q5089176) (← links)