Fabrizio Grandoni

From MaRDI portal
Revision as of 10:21, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:334925

Available identifiers

zbMath Open grandoni.fabrizioDBLPg/FGrandoniWikidataQ102393793 ScholiaQ102393793MaRDI QIDQ334925

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61472652024-01-15Paper
https://portal.mardi4nfdi.de/entity/Q61474262024-01-15Paper
A PTAS for unsplittable flow on a path2023-12-08Paper
Breaching the 2-approximation barrier for the forest augmentation problem2023-12-08Paper
Approximation Algorithms for Demand Strip Packing2023-11-20Paper
Fully Dynamic (Δ +1)-Coloring in O (1) Update Time2023-10-31Paper
A Tight (3/2+ε) Approximation for Skewed Strip Packing.2023-10-31Paper
Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter2023-10-23Paper
A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing2023-10-06Paper
Faster (1+µ)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back2023-09-20Paper
Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree2023-06-09Paper
$O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm2023-04-28Paper
Improved Approximation for Two-Edge-Connectivity2022-09-21Paper
Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack2022-05-11Paper
https://portal.mardi4nfdi.de/entity/Q50757982022-05-11Paper
A refined approximation for Euclidean \(k\)-means2022-04-07Paper
Approximating Geometric Knapsack via L-packings2022-02-22Paper
Faster Replacement Paths and Distance Sensitivity Oracles2021-12-16Paper
On the cycle augmentation problem: hardness and approximation algorithms2021-09-28Paper
Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree2021-01-19Paper
On the Cycle Augmentation Problem: hardness and approximation algorithms2020-08-24Paper
The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm2020-06-26Paper
https://portal.mardi4nfdi.de/entity/Q51113662020-05-27Paper
https://portal.mardi4nfdi.de/entity/Q51114042020-05-27Paper
Dynamic set cover: improved algorithms and lower bounds2020-01-30Paper
O (log 2 k / log log k )-approximation algorithm for directed Steiner tree2020-01-30Paper
Oblivious dimension reduction for k -means: beyond subspaces and the Johnson-Lindenstrauss lemma2020-01-30Paper
(1 + )-Approximate Incremental Matching in Constant Deterministic Amortized Time2019-10-15Paper
A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes2019-08-22Paper
Improved approximation for tree augmentation: saving by rewiring2019-08-22Paper
A Mazing 2+ Approximation for Unsplittable Flow on a Path2019-06-20Paper
How to Sell Hyperedges: The Hypermatching Assignment Problem2019-05-15Paper
Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product2019-05-07Paper
A Mazing 2+ε Approximation for Unsplittable Flow on a Path2019-03-28Paper
Tight Kernel Bounds for Problems on Graphs with Small Degeneracy2018-11-12Paper
Distributed weighted vertex cover via maximal matchings2018-11-05Paper
Combinatorial bounds via measure and conquer2018-11-05Paper
To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack2018-07-16Paper
Improved Pseudo-Polynomial-Time Approximation for Strip Packing2018-04-19Paper
Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter2017-10-05Paper
On Survivable Set Connectivity2017-10-05Paper
https://portal.mardi4nfdi.de/entity/Q53650722017-09-29Paper
Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree2017-08-17Paper
On Pairwise Spanners2017-01-30Paper
Online network design with outliers2016-11-01Paper
Pricing on Paths: A PTAS for the Highway Problem2016-03-23Paper
Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows2016-02-26Paper
Improved Approximation Algorithms for Stochastic Matching2015-11-19Paper
Improved Purely Additive Fault-Tolerant Spanners2015-11-19Paper
A measure & conquer approach for the analysis of exact algorithms2015-11-11Paper
On Conflict-Free Multi-coloring2015-10-30Paper
Data structures resilient to memory faults2015-03-16Paper
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities2015-03-10Paper
https://portal.mardi4nfdi.de/entity/Q29346372014-12-18Paper
An LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraph2014-12-09Paper
Resilient dictionaries2014-11-18Paper
Utilitarian Mechanism Design for Multiobjective Optimization2014-11-14Paper
https://portal.mardi4nfdi.de/entity/Q29217602014-10-13Paper
Designing reliable algorithms in unreliable memories2014-10-07Paper
New approaches to multi-objective optimization2014-08-29Paper
An improved LP-based approximation for steiner tree2014-08-13Paper
https://portal.mardi4nfdi.de/entity/Q54176492014-05-22Paper
Steiner Tree Approximation via Iterative Randomized Rounding2014-02-17Paper
Set Covering with Our Eyes Closed2013-09-25Paper
Tight Kernel Bounds for Problems on Graphs with Small Degeneracy2013-09-17Paper
Computing optimal Steiner trees in polynomial space2013-08-05Paper
Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path2013-03-19Paper
A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees2012-09-25Paper
On Min-Power Steiner Tree2012-09-25Paper
Approximation Algorithms for Union and Intersection Covering Problems2012-08-31Paper
From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk2012-05-24Paper
Sharp separation and applications to exact and parameterized algorithms2012-04-26Paper
Approximation Algorithms for Single and Multi-Commodity Connected Facility Location2011-06-24Paper
Budgeted matching and budgeted matroid intersection via the gasoline puzzle2011-06-17Paper
Stable routing under the Spanning Tree Protocol2010-12-20Paper
Connected facility location via random facility sampling and core detouring2010-10-07Paper
Online Network Design with Outliers2010-09-07Paper
Network Design via Core Detouring for Problems without a Core2010-09-07Paper
Approximation Schemes for Multi-Budgeted Independence Systems2010-09-06Paper
Measure and conquer2010-08-16Paper
https://portal.mardi4nfdi.de/entity/Q35794592010-08-06Paper
Low degree connectivity of ad-hoc networks via percolation2010-07-13Paper
Sharp Separation and Applications to Exact and Parameterized Algorithms2010-04-27Paper
Optimal resilient sorting and searching in the presence of memory faults2009-11-04Paper
Iterative Rounding for Multi-Objective Optimization Problems2009-10-29Paper
https://portal.mardi4nfdi.de/entity/Q33965672009-09-19Paper
Refined memorization for vertex cover2009-08-27Paper
Balanced cut approximation in random geometric graphs2009-07-10Paper
A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover2009-06-22Paper
Detecting directed 4-cycles still faster2009-04-28Paper
Optimal Resilient Sorting and Searching in the Presence of Memory Faults2009-03-12Paper
Solving connected dominating set faster than \(2^n\)2008-12-02Paper
Faster Steiner Tree Computation in Polynomial-Space2008-11-25Paper
Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation2008-09-25Paper
Optimal Resilient Dynamic Dictionaries2008-09-25Paper
A short proof of the VPN tree routing conjecture on ring networks2008-09-10Paper
Algorithms and Constraint Programming2008-09-09Paper
New Approaches for Virtual Private Network Design2008-06-19Paper
Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle2008-06-10Paper
Improved Approximation for Single-Sink Buy-at-Bulk2008-04-24Paper
Balanced Cut Approximation in Random Geometric Graphs2008-04-24Paper
Solving Connected Dominating Set Faster Than 2 n2008-04-17Paper
A note on the complexity of minimum dominating set2007-11-05Paper
On maximum number of minimal dominating sets in graphs2007-05-29Paper
Algorithms and Computation2006-11-14Paper
Algorithms – ESA 20052006-06-27Paper
A linear time algorithm to list the minimal separators of chordal graphs2006-03-29Paper
Computing and Combinatorics2006-01-11Paper
Automata, Languages and Programming2006-01-10Paper
Automata, Languages and Programming2006-01-10Paper
Graph-Theoretic Concepts in Computer Science2005-12-08Paper
Parameterized and Exact Computation2005-08-23Paper
On the complexity of fixed parameter clique and dominating set2005-01-11Paper
Evaluation of Fault-Tolerant Multiprocessor Systems for High Assurance Applications2002-10-06Paper
https://portal.mardi4nfdi.de/entity/Q38148061989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37774441988-01-01Paper
A Theory of Diagnosability of Digital Systems1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32126661974-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Fabrizio Grandoni