The following pages link to Luciano Gualà (Q338390):
Displaying 50 items.
- Exact and approximate algorithms for movement problems on (special classes of) graphs (Q338392) (← 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)
- 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)
- 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)
- Multiple-edge-fault-tolerant approximate shortest-path trees (Q2072097) (← links)
- Cutting bamboo down to size (Q2078615) (← links)
- Coalition resilient outcomes in max \(k\)-cut games (Q2206218) (← links)
- The max-distance network creation game on general host graphs (Q2257298) (← links)
- Reducing the diameter of a unit disk graph via node addition (Q2353655) (← links)
- Exact and approximate truthful mechanisms for the shortest paths tree problem (Q2461546) (← 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)
- Fault-Tolerant Approximate Shortest-Path Trees (Q2921400) (← links)
- Efficient Oracles and Routing Schemes for Replacement Paths (Q3304107) (← 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)
- 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)
- 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)
- On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem (Q3613659) (← links)
- Multiple-edge-fault-tolerant approximate shortest-path trees (Q4601870) (← links)
- Compact and Fast Sensitivity Oracles for Single-Source Distances (Q4606282) (← links)
- On stackelberg pricing with computationally bounded customers (Q4648689) (← links)
- The Max-Distance Network Creation Game on General Host Graphs (Q4915722) (← links)
- A tight analysis of the parallel undecided-state dynamics with two colors (Q5005128) (← links)
- An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner (Q5136230) (← links)
- (Q5282816) (← 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)
- Computing and Combinatorics (Q5716957) (← links)
- Consensus vs Broadcast, with and without Noise (Q5875742) (← 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)
- Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees (Q6103520) (← links)
- Blackout-tolerant temporal spanners (Q6141041) (← links)
- (Q6187834) (← links)
