The following pages link to Fabrizio Grandoni (Q334925):
Displaying 50 items.
- Online network design with outliers (Q334928) (← links)
- New approaches to multi-objective optimization (Q403670) (← links)
- Designing reliable algorithms in unreliable memories (Q458451) (← links)
- An LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraph (Q477619) (← links)
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle (Q543415) (← links)
- Stable routing under the Spanning Tree Protocol (Q613335) (← links)
- On the complexity of fixed parameter clique and dominating set (Q703534) (← links)
- A linear time algorithm to list the minimal separators of chordal graphs (Q819826) (← links)
- Refined memorization for vertex cover (Q835007) (← links)
- A short proof of the VPN tree routing conjecture on ring networks (Q943799) (← links)
- Solving connected dominating set faster than \(2^n\) (Q958203) (← links)
- Detecting directed 4-cycles still faster (Q1014385) (← links)
- Balanced cut approximation in random geometric graphs (Q1029344) (← links)
- Optimal resilient sorting and searching in the presence of memory faults (Q1035681) (← links)
- Connected facility location via random facility sampling and core detouring (Q1959419) (← links)
- A refined approximation for Euclidean \(k\)-means (Q2122798) (← links)
- The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm (Q2191772) (← links)
- On the Cycle Augmentation Problem: hardness and approximation algorithms (Q2193089) (← links)
- On the cycle augmentation problem: hardness and approximation algorithms (Q2230719) (← links)
- Computing optimal Steiner trees in polynomial space (Q2392926) (← links)
- Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
- A note on the complexity of minimum dominating set (Q2458924) (← links)
- Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows (Q2788987) (← links)
- Pricing on Paths: A PTAS for the Highway Problem (Q2796210) (← links)
- Set Covering with Our Eyes Closed (Q2848202) (← links)
- Tight Kernel Bounds for Problems on Graphs with Small Degeneracy (Q2849328) (← links)
- An improved LP-based approximation for steiner tree (Q2875185) (← links)
- From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk (Q2884270) (← links)
- Approximation Algorithms for Union and Intersection Covering Problems (Q2911608) (← links)
- A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees (Q2912854) (← links)
- On Min-Power Steiner Tree (Q2912871) (← links)
- (Q2921760) (← links)
- Utilitarian Mechanism Design for Multiobjective Optimization (Q2929697) (← links)
- Resilient dictionaries (Q2930274) (← links)
- (Q2934637) (← links)
- On Pairwise Spanners (Q2957885) (← links)
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location (Q3009767) (← links)
- (Q3212666) (← links)
- Faster Replacement Paths and Distance Sensitivity Oracles (Q3384662) (← links)
- (Q3396567) (← links)
- On maximum number of minimal dominating sets in graphs (Q3439327) (← links)
- On Conflict-Free Multi-coloring (Q3449809) (← links)
- A measure & conquer approach for the analysis of exact algorithms (Q3452221) (← links)
- Improved Approximation Algorithms for Stochastic Matching (Q3452763) (← links)
- Improved Purely Additive Fault-Tolerant Spanners (Q3452780) (← links)
- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle (Q3503853) (← links)
- New Approaches for Virtual Private Network Design (Q3507517) (← links)
- Algorithms and Constraint Programming (Q3524235) (← links)
- Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation (Q3527213) (← links)
- Optimal Resilient Dynamic Dictionaries (Q3527225) (← links)
