The following pages link to Stefano Leucci (Q338391):
Displaying 46 items.
- Exact and approximate algorithms for movement problems on (special classes of) graphs (Q338392) (← links)
- Specializations and generalizations of the Stackelberg minimum spanning tree game (Q476917) (← links)
- Trainyard is NP-hard (Q1623273) (← links)
- Effective edge-fault-tolerant single-source spanners via best (or good) swap edges (Q1742786) (← links)
- No truthful mechanism can be better than \(n\) approximate for two natural problems (Q1792559) (← 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)
- Optimal dislocation with persistent errors in subquadratic time (Q1987515) (← links)
- Multiple-edge-fault-tolerant approximate shortest-path trees (Q2072097) (← links)
- Approximate minimum selection with unreliable comparisons (Q2072098) (← links)
- Cutting bamboo down to size (Q2078615) (← links)
- Tracks from hell -- when finding a proof may be easier than checking it (Q2196558) (← links)
- The max-distance network creation game on general host graphs (Q2257298) (← links)
- Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem (Q2424799) (← links)
- Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates (Q2828206) (← links)
- Dynamically Maintaining Shortest Path Trees under Batches of Updates (Q2868652) (← 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)
- Optimal Dislocation with Persistent Errors in Subquadratic Time (Q3304135) (← links)
- Tracks from hell - When finding a proof may be easier than checking it (Q3305722) (← 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)
- Improved Purely Additive Fault-Tolerant Spanners (Q3452780) (← links)
- Path-Fault-Tolerant Approximate Shortest-Path Trees (Q3460718) (← links)
- A Faster Computation of All the Best Swap Edges of a Tree Spanner (Q3460719) (← 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)
- (Q5075792) (← links)
- Resilient Dictionaries for Randomly Unreliable Memory (Q5075817) (← links)
- An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner (Q5136230) (← links)
- Sorting with Recurrent Comparison Errors (Q5136257) (← links)
- Trainyard is NP-hard (Q5282799) (← links)
- (Q5282816) (← links)
- Network Creation Games with Traceroute-Based Strategies (Q5496160) (← links)
- (Q5875632) (← 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)
- Cutting bamboo down to size (Q6487569) (← links)
- Single-source shortest \(p\)-disjoint paths: fast computation and sparse preservers (Q6490964) (← links)
