The following pages link to Fabrizio Grandoni (Q334925):
Displaying 50 items.
- Faster Steiner Tree Computation in Polynomial-Space (Q3541105) (← links)
- Sharp Separation and Applications to Exact and Parameterized Algorithms (Q3557010) (← links)
- Low degree connectivity of ad-hoc networks via percolation (Q3578044) (← links)
- (Q3579459) (← links)
- Measure and conquer (Q3581486) (← links)
- Approximation Schemes for Multi-Budgeted Independence Systems (Q3586491) (← links)
- Online Network Design with Outliers (Q3587373) (← links)
- Network Design via Core Detouring for Problems without a Core (Q3587402) (← links)
- Optimal Resilient Sorting and Searching in the Presence of Memory Faults (Q3613767) (← links)
- A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover (Q3631893) (← links)
- Iterative Rounding for Multi-Objective Optimization Problems (Q3639238) (← links)
- (Q3777444) (← links)
- (Q3814806) (← links)
- A Theory of Diagnosability of Digital Systems (Q4096862) (← links)
- Evaluation of Fault-Tolerant Multiprocessor Systems for High Assurance Applications (Q4551644) (← links)
- Tight Kernel Bounds for Problems on Graphs with Small Degeneracy (Q4554933) (← links)
- To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack (Q4575908) (← links)
- A Mazing 2+ε Approximation for Unsplittable Flow on a Path (Q4629969) (← links)
- Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product (Q4634027) (← links)
- Improved Pseudo-Polynomial-Time Approximation for Strip Packing (Q4636556) (← links)
- Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path (Q4910802) (← links)
- Distributed weighted vertex cover via maximal matchings (Q4962764) (← links)
- Combinatorial bounds via measure and conquer (Q4962767) (← links)
- Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree (Q4977990) (← links)
- Approximating Geometric Knapsack via L-packings (Q5035877) (← links)
- Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack (Q5075797) (← links)
- (Q5075798) (← links)
- (Q5111366) (← links)
- (Q5111404) (← links)
- Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree (Q5144967) (← links)
- Primal-dual based distributed algorithms for vertex cover with semi-hard capacities (Q5177233) (← links)
- Data structures resilient to memory faults (Q5178739) (← links)
- Dynamic set cover: improved algorithms and lower bounds (Q5212753) (← links)
- <i>O</i> (log <sup>2</sup> <i>k</i> / log log <i>k</i> )-approximation algorithm for directed Steiner tree (Q5212767) (← links)
- Oblivious dimension reduction for <i>k</i> -means: beyond subspaces and the Johnson-Lindenstrauss lemma (Q5212844) (← links)
- A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes (Q5230324) (← links)
- Improved approximation for tree augmentation: saving by rewiring (Q5230326) (← links)
- (1 + <i>∊</i>)-Approximate Incremental Matching in Constant Deterministic Amortized Time (Q5236300) (← links)
- Parameterized and Exact Computation (Q5311526) (← links)
- Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter (Q5363057) (← links)
- On Survivable Set Connectivity (Q5363080) (← links)
- (Q5365072) (← links)
- A Mazing 2+<i>∊</i> Approximation for Unsplittable Flow on a Path (Q5383962) (← links)
- Solving Connected Dominating Set Faster Than 2 n (Q5385982) (← links)
- Steiner Tree Approximation via Iterative Randomized Rounding (Q5395705) (← links)
- (Q5417649) (← links)
- Improved Approximation for Single-Sink Buy-at-Bulk (Q5459107) (← links)
- Balanced Cut Approximation in Random Geometric Graphs (Q5459147) (← links)
- Algorithms – ESA 2005 (Q5475813) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710795) (← links)
