Fabrizio Grandoni

ORCID

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 78

Top Venues

CoRR

SODA

STOC

ACM Trans. Algorithms

Publications

Ilan Doron-Arad, Fabrizio Grandoni, Ariel Kulik
Unsplittable Flow on a Short Path. CoRR (2024)
Jaroslaw Byrka, Fabrizio Grandoni, Vera Traub
The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller than 2. CoRR (2024)
Fabrizio Grandoni, Edin Husic, Mathieu Mari, Antoine Tinguely
Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions. SoCG (2024)
Fabrizio Grandoni, Edin Husic, Mathieu Mari, Antoine Tinguely
Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions. CoRR (2024)
Fateme Abbasi, Marek Adamczyk, Miguel Bosch-Calvo, Jaroslaw Byrka, Fabrizio Grandoni, Krzysztof Sornat, Antoine Tinguely
An O(loglog n)-Approximation for Submodular Facility Location. ICALP (2024)
Jaroslaw Byrka, Fabrizio Grandoni, Afrouz Jabal Ameli
Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree. SIAM J. Comput. 52 (3) (2023)
Vincent Cohen-Addad, Fabrizio Grandoni, Euiwoong Lee, Chris Schwiegelshohn
-Median. SODA (2023)
Fabrizio Grandoni, Claire Mathieu, Hang Zhou
Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm. ITCS (2023)
Amir Abboud, Fabrizio Grandoni, Virginia Vassilevska Williams
Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter. ACM Trans. Algorithms 19 (1) (2023)
Mohit Garg, Fabrizio Grandoni, Afrouz Jabal Ameli
Improved Approximation for Two-Edge-Connectivity. SODA (2023)
Miguel Bosch-Calvo, Fabrizio Grandoni, Afrouz Jabal Ameli
A PTAS for Triangle-Free 2-Matching. CoRR (2023)
Miguel Bosch-Calvo, Fabrizio Grandoni, Afrouz Jabal Ameli
A 4/3 Approximation for 2-Vertex-Connectivity. ICALP (2023)
Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan, Malin Rau
A Tight (3/2+ε )-Approximation for Skewed Strip Packing. Algorithmica 85 (10) (2023)
Miguel Bosch-Calvo, Fabrizio Grandoni, Afrouz Jabal Ameli
A 4/3 Approximation for 2-Vertex-Connectivity. CoRR (2023)
Sayan Bhattacharya, Fabrizio Grandoni, Janardhan Kulkarni, Quanquan C. Liu, Shay Solomon
(1) Update Time. ACM Trans. Algorithms 18 (2) (2022)
Fabrizio Grandoni, Chris Schwiegelshohn, Shay Solomon, Amitai Uzrad
Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds. SOSA (2022)
Fabrizio Grandoni, Tobias Mömke, Andreas Wiese
Unsplittable Flow on a Path: The Game!. SODA (2022)
Fateme Abbasi, Marek Adamczyk, Miguel Bosch-Calvo, Jaroslaw Byrka, Fabrizio Grandoni, Krzysztof Sornat, Antoine Tinguely
An O(loglog n)-Approximation for Submodular Facility Location. CoRR (2022)
Fabrizio Grandoni, Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Rakesh Venkat
A refined approximation for Euclidean k-means. Inf. Process. Lett. 176 (2022)
Vincent Cohen-Addad, Fabrizio Grandoni, Euiwoong Lee, Chris Schwiegelshohn
Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median. CoRR (2022)
Mohit Garg, Fabrizio Grandoni, Afrouz Jabal Ameli
Improved Approximation for Two-Edge-Connectivity. CoRR (2022)
Fabrizio Grandoni, Tobias Mömke, Andreas Wiese
A PTAS for unsplittable flow on a path. STOC (2022)
Fabrizio Grandoni, Afrouz Jabal Ameli, Vera Traub
Breaching the 2-approximation barrier for the forest augmentation problem. STOC (2022)
Fabrizio Grandoni, Claire Mathieu, Hang Zhou
Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm. CoRR (2022)
Waldo Gálvez, Fabrizio Grandoni, Salvatore Ingala, Sandy Heydrich, Arindam Khan, Andreas Wiese
Approximating Geometric Knapsack via L-packings. ACM Trans. Algorithms 17 (4) (2021)
Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Lukasiewicz, Nikos Parotsidis, Przemyslaw Uznanski
) barrier. SODA (2021)
Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Kamyar Khodamoradi
Approximation Algorithms for Demand Strip Packing. APPROX-RANDOM (2021)
Waldo Gálvez, Fabrizio Grandoni, Arindam Khan, Diego Ramírez-Romero, Andreas Wiese
Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More. CoRR (2021)
Fabrizio Grandoni, Chris Schwiegelshohn, Shay Solomon, Amitai Uzrad
Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds. CoRR (2021)
Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Krzysztof Sornat
On the Cycle Augmentation Problem: Hardness and Approximation Algorithms. Theory Comput. Syst. 65 (6) (2021)
Sayan Bhattacharya, Fabrizio Grandoni, David Wajc
Online Edge Coloring Algorithms via the Nibble Method. SODA (2021)
Fabrizio Grandoni, Tobias Mömke, Andreas Wiese
Faster (1+ε)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back. ESA (2021)
Waldo Gálvez, Fabrizio Grandoni, Arindam Khan, Diego Ramírez-Romero, Andreas Wiese
Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More. SoCG (2021)
Fabrizio Grandoni, Afrouz Jabal Ameli, Vera Traub
Breaching the 2-Approximation Barrier for the Forest Augmentation Problem. CoRR (2021)
Fabrizio Grandoni, Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Rakesh Venkat
A Refined Approximation for Euclidean k-Means. CoRR (2021)
Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Kamyar Khodamoradi
Approximation Algorithms for Demand Strip Packing. CoRR (2021)
Joe Cheriyan, Jack Dippel, Fabrizio Grandoni, Arindam Khan, Vishnu V. Narayan
The matching augmentation problem: a $\frac{7}{4}$-approximation algorithm. Math. Program. 182 (1) (2020)
Sayan Bhattacharya, Fabrizio Grandoni, David Wajc
Online Edge Coloring Algorithms via the Nibble Method. CoRR (2020)
Marek Adamczyk, Brian Brubach, Fabrizio Grandoni, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
Improved Approximation Algorithms for Stochastic-Matching Problems. CoRR (2020)
Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Lukasiewicz, Nikos Parotsidis, Przemyslaw Uznanski
) barrier. CoRR (2020)
Jaroslaw Byrka, Fabrizio Grandoni, Afrouz Jabal Ameli
Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree. STOC (2020)
Fabrizio Grandoni, Virginia Vassilevska Williams
Faster Replacement Paths and Distance Sensitivity Oracles. ACM Trans. Algorithms 16 (1) (2020)
Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan, Malin Rau
A Tight (3/2+ε) Approximation for Skewed Strip Packing. APPROX-RANDOM (2020)
Fabrizio Grandoni, Bundit Laekhanukit, Shi Li
)-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithm. STOC (2019)
Fabrizio Grandoni, Andreas Wiese
Packing Cars into Narrow Roads: PTASs for Limited Supply Highway. ESA (2019)
Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Krzysztof Sornat
On the Cycle Augmentation Problem: Hardness and Approximation Algorithms. WAOA (2019)
Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski, Chris Schwiegelshohn, Shay Solomon
(1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time. SODA (2019)
Amir Abboud, Raghavendra Addanki, Fabrizio Grandoni, Debmalya Panigrahi, Barna Saha
Dynamic set cover: improved algorithms and lower bounds. STOC (2019)
Karl Bringmann, Fabrizio Grandoni, Barna Saha, Virginia Vassilevska Williams
Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product. SIAM J. Comput. 48 (2) (2019)
Luca Becchetti, Marc Bury, Vincent Cohen-Addad, Fabrizio Grandoni, Chris Schwiegelshohn
-means: beyond subspaces and the Johnson-Lindenstrauss lemma. STOC (2019)
Fabrizio Grandoni, Stefan Kratsch, Andreas Wiese
Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack. ESA (2019)
Sayan Bhattacharya, Fabrizio Grandoni, Janardhan Kulkarni, Quanquan C. Liu, Shay Solomon
Fully Dynamic (Δ+1)-Coloring in Constant Update Time. CoRR (2019)
Fabrizio Grandoni, Stefan Kratsch, Andreas Wiese
Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack. CoRR (2019)
Jaroslaw Byrka, Fabrizio Grandoni, Afrouz Jabal Ameli
Breaching the 2-Approximation Barrier for Connectivity Augmentation: a Reduction to Steiner Tree. CoRR (2019)
Fabrizio Grandoni, Christos Kalaitzis, Rico Zenklusen
Improved Approximation for Tree Augmentation: Saving by Rewiring. CoRR (2018)
Arnab Bhattacharyya, Fabrizio Grandoni, Aleksandar Nikolov, Barna Saha, Saket Saurabh, Aravindan Vijayaraghavan, Qin Zhang
Editorial: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016 Special Issue. ACM Trans. Algorithms 14 (3) (2018)
Fabrizio Grandoni, Bundit Laekhanukit, Shi Li
k/log log k)-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm. CoRR (2018)
Joe Cheriyan, Jack Dippel, Fabrizio Grandoni, Arindam Khan, Vishnu V. Narayan
The Matching Augmentation Problem: A 7/4-Approximation Algorithm. CoRR (2018)
Fabrizio Grandoni, Christos Kalaitzis, Rico Zenklusen
Improved approximation for tree augmentation: saving by rewiring. STOC (2018)
Fabrizio Grandoni, Tobias Mömke, Andreas Wiese, Hang Zhou
A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes. STOC (2018)
Erik D. Demaine, Fabrizio Grandoni
Editorial fun. Theor. Comput. Sci. 748 (2018)
Waldo Gálvez, Fabrizio Grandoni, Salvatore Ingala, Arindam Khan
Improved Pseudo-Polynomial-Time Approximation for Strip Packing. CoRR (2018)
Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese
A Mazing 2+ϵ Approximation for Unsplittable Flow on a Path. ACM Trans. Algorithms 14 (4) (2018)
Marek Adamczyk, Fabrizio Grandoni, Stefano Leonardi, Michal Wlodarczyk
When the Optimum is also Blind: a New Perspective on Universal Optimization. ICALP (2017)
Karl Bringmann, Fabrizio Grandoni, Barna Saha, Virginia Vassilevska Williams
Truly Sub-cubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product. CoRR (2017)
Marek Adamczyk, Fabrizio Grandoni, Stefano Leonardi, Michal Wlodarczyk
When the Optimum is also Blind: a New Perspective on Universal Optimization. CoRR (2017)
Marek Cygan, Fabrizio Grandoni, Danny Hermelin
Tight Kernel Bounds for Problems on Graphs with Small Degeneracy. ACM Trans. Algorithms 13 (3) (2017)
Fabrizio Grandoni, Tobias Mömke, Andreas Wiese, Hang Zhou
To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack. SODA (2017)
Waldo Gálvez, Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan, Andreas Wiese
Approximating Geometric Knapsack via L-Packings. FOCS (2017)
Fabrizio Grandoni, Bundit Laekhanukit
Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree. STOC (2017)
Greg Bodwin, Fabrizio Grandoni, Merav Parter, Virginia Vassilevska Williams
Preserving Distances in Very Faulty Graphs. ICALP (2017)
Greg Bodwin, Fabrizio Grandoni, Merav Parter, Virginia Vassilevska Williams
Preserving Distances in Very Faulty Graphs. CoRR (2017)
Waldo Gálvez, Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan, Andreas Wiese
Approximating Geometric Knapsack via L-packings. CoRR (2017)
Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski
Online Network Design with Outliers. Algorithmica 76 (1) (2016)
Waldo Gálvez, Fabrizio Grandoni, Salvatore Ingala, Arindam Khan
Improved Pseudo-Polynomial-Time Approximation for Strip Packing. FSTTCS (2016)
Karl Bringmann, Fabrizio Grandoni, Barna Saha, Virginia Vassilevska Williams
Truly Sub-cubic Algorithms for Language Edit Distance and RNA-Folding via Fast Bounded-Difference Min-Plus Product. FOCS (2016)
Fabrizio Grandoni, Bundit Laekhanukit
Surviving in Directed Graphs: A Polylogarithmic Approximation for Two-Connected Directed Steiner Tree. CoRR (2016)
Fabrizio Grandoni, Thomas Rothvoß
Pricing on Paths: A PTAS for the Highway Problem. SIAM J. Comput. 45 (2) (2016)
Andreas Bärtschi, Fabrizio Grandoni
On Conflict-Free Multi-coloring. WADS (2015)
Fabrizio Grandoni, Salvatore Ingala, Sumedha Uniyal
Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows. WAOA (2015)
Marek Adamczyk, Fabrizio Grandoni, Joydeep Mukherjee
Improved Approximation Algorithms for Stochastic Matching. ESA (2015)
Davide Bilò, Fabrizio Grandoni, Luciano Gualà, Stefano Leucci, Guido Proietti
Improved Purely Additive Fault-Tolerant Spanners. CoRR (2015)
Parinya Chalermsook, Fabrizio Grandoni, Bundit Laekhanukit
On Survivable Set Connectivity. SODA (2015)
Davide Bilò, Fabrizio Grandoni, Luciano Gualà, Stefano Leucci, Guido Proietti
Improved Purely Additive Fault-Tolerant Spanners. ESA (2015)
Amir Abboud, Fabrizio Grandoni, Virginia Vassilevska Williams
Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter. SODA (2015)
Fabrizio Grandoni, Tomasz Kociumaka, Michal Wlodarczyk
An LP-rounding 2√2-approximation for restricted maximum acyclic subgraph. Inf. Process. Lett. 115 (2) (2015)
Marek Adamczyk, Fabrizio Grandoni, Joydeep Mukherjee
Improved Approximation Algorithms for Stochastic Matching. CoRR (2015)
Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese
Approximation for Unsplittable Flow on a Path. SODA (2014)
Fabrizio Grandoni, Piotr Krysta, Stefano Leonardi, Carmine Ventre
Utilitarian Mechanism Design for Multiobjective Optimization. SIAM J. Comput. 43 (4) (2014)
Fabrizio Grandoni, R. Ravi, Mohit Singh, Rico Zenklusen
New approaches to multi-objective optimization. Math. Program. 146 (1-2) (2014)
Fabrizio Grandoni, Tomasz Kociumaka, Michal Wlodarczyk
An LP-Rounding $2\sqrt{2}$ Approximation for Restricted Maximum Acyclic Subgraph. CoRR (2014)
Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch, Daniel Lokshtanov, Saket Saurabh
Computing Optimal Steiner Trees in Polynomial Space. Algorithmica 65 (3) (2013)
Marek Cygan, Fabrizio Grandoni, Danny Hermelin
Tight Kernel Bounds for Problems on Graphs with Small Degeneracy CoRR (2013)
Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese
Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path. IPCO (2013)
Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, Mohit Singh
Set Covering with Our Eyes Closed. SIAM J. Comput. 42 (3) (2013)
Marek Cygan, Fabrizio Grandoni, Danny Hermelin
Tight Kernel Bounds for Problems on Graphs with Small Degeneracy - (Extended Abstract). ESA (2013)
Umberto Ferraro Petrillo, Fabrizio Grandoni, Giuseppe F. Italiano
Data structures resilient to memory faults: An experimental study of dictionaries. ACM J. Exp. Algorithmics 18 (2013)
Marek Cygan, Fabrizio Grandoni, Telikepalli Kavitha
On Pairwise Spanners CoRR (2013)
Marek Cygan, Fabrizio Grandoni, Monaldo Mastrolilli
How to Sell Hyperedges: The Hypermatching Assignment Problem. SODA (2013)
Marek Cygan, Fabrizio Grandoni, Telikepalli Kavitha
On Pairwise Spanners. STACS (2013)

Fabrizio Grandoni.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Fabrizio Grandoni