Fabrizio Grandoni
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
85
Venues
19
Active years
1978–2026
Best venue rank
A*
Where they publish
Papers
85 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | IPCO | A PTAS for Weighted Triangle-Free 2-Matching. | Miguel Bosch-Calvo, Fabrizio Grandoni, Yusuke Kobayashi, Takashi Noguchi |
| 2026 | SODA | Augmenting Packing Dynamic Programs to Handle (Many) Additional Budget Constraints. | Alexander Armbruster, Fabrizio Grandoni, Antoine Tinguely, Andreas Wiese |
| 2026 | SODA | Breaching the 2-Approximation Barrier for Euclidean Capacitated Vehicle Routing. | Zachary Friggstad, Fabrizio Grandoni, Ramin Mousavi |
| 2026 | STOC | Improved Approximation Algorithms for Non-preemptive Throughput Maximization. | Alexander Armbruster, Fabrizio Grandoni, Antoine Tinguely, Andreas Wiese |
| 2026 | STOC | A (4+ϵ)-Approximation for Euclidean k-Means via Non-monotone Dual-Fitting. | Moses Charikar, Vincent Cohen-Addad, Ruiquan Gao, Fabrizio Grandoni, Euiwoong Lee, Ernest van Wijland |
| 2025 | FOCS | An Improved Greedy Approximation for (Metric) k-Means. | Moses Charikar, Vincent Cohen-Addad, Ruiquan Gao, Fabrizio Grandoni, Euiwoong Lee, Ernest van Wijland |
| 2025 | IPCO | On the Approximability of Unsplittable Flow on a Path with Time Windows. | Alexander Armbruster, Fabrizio Grandoni, Edin Husic, Antoine Tinguely, Andreas Wiese |
| 2025 | IPCO | On the Bidirected Cut Relaxation for Steiner Forest. | Jaroslaw Byrka, Fabrizio Grandoni, Vera Traub |
| 2025 | STOC | A 5/4-Approximation for Two-Edge Connectivity. | Miguel Bosch-Calvo, Mohit Garg, Fabrizio Grandoni, Felix Hommelsheim, Afrouz Jabal Ameli, Alexander Lindermayr |
| 2025 | STOC | A (2+ε)-Approximation Algorithm for Metric k-Median. | Vincent Cohen-Addad, Fabrizio Grandoni, Euiwoong Lee, Chris Schwiegelshohn, Ola Svensson |
| 2024 | FOCS | The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller Than 2. | Jaroslaw Byrka, Fabrizio Grandoni, Vera Traub |
| 2024 | ICALP | An O(loglog n)-Approximation for Submodular Facility Location. | Fateme Abbasi, Marek Adamczyk, Miguel Bosch-Calvo, Jaroslaw Byrka, Fabrizio Grandoni, Krzysztof Sornat, Antoine Tinguely |
| 2023 | ICALP | A 4/3 Approximation for 2-Vertex-Connectivity. | Miguel Bosch-Calvo, Fabrizio Grandoni, Afrouz Jabal Ameli |
| 2023 | SODA | Improved Approximation for Two-Edge-Connectivity. | Mohit Garg, Fabrizio Grandoni, Afrouz Jabal Ameli |
| 2023 | SODA | Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to | Vincent Cohen-Addad, Fabrizio Grandoni, Euiwoong Lee, Chris Schwiegelshohn |
| 2022 | SODA | Unsplittable Flow on a Path: The Game!. | Fabrizio Grandoni, Tobias Mmke, Andreas Wiese |
| 2022 | STOC | Breaching the 2-approximation barrier for the forest augmentation problem. | Fabrizio Grandoni, Afrouz Jabal Ameli, Vera Traub |
| 2022 | STOC | A PTAS for unsplittable flow on a path. | Fabrizio Grandoni, Tobias Mmke, Andreas Wiese |
| 2021 | ESA | Faster (1+ε)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back. | Fabrizio Grandoni, Tobias Mmke, Andreas Wiese |
| 2021 | SODA | Online Edge Coloring Algorithms via the Nibble Method. | Sayan Bhattacharya, Fabrizio Grandoni, David Wajc |
| 2021 | SODA | All-Pairs LCA in DAGs: Breaking through the | Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Lukasiewicz, Nikos Parotsidis, Przemyslaw Uznanski |
| 2020 | STOC | Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree. | Jaroslaw Byrka, Fabrizio Grandoni, Afrouz Jabal Ameli |
| 2019 | ESA | Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack. | Fabrizio Grandoni, Stefan Kratsch, Andreas Wiese |
| 2019 | ESA | Packing Cars into Narrow Roads: PTASs for Limited Supply Highway. | Fabrizio Grandoni, Andreas Wiese |
| 2019 | SODA | (1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time. | Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski, Chris Schwiegelshohn, Shay Solomon |
| 2019 | STOC | Untitled record | Fabrizio Grandoni, Bundit Laekhanukit, Shi Li |
| 2019 | STOC | Dynamic set cover: improved algorithms and lower bounds. | Amir Abboud, Raghavendra Addanki, Fabrizio Grandoni, Debmalya Panigrahi, Barna Saha |
| 2019 | STOC | Oblivious dimension reduction for | Luca Becchetti, Marc Bury, Vincent Cohen-Addad, Fabrizio Grandoni, Chris Schwiegelshohn |
| 2019 | WAOA | On the Cycle Augmentation Problem: Hardness and Approximation Algorithms. | Waldo Glvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Krzysztof Sornat |
| 2018 | STOC | Improved approximation for tree augmentation: saving by rewiring. | Fabrizio Grandoni, Christos Kalaitzis, Rico Zenklusen |
| 2018 | STOC | A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes. | Fabrizio Grandoni, Tobias Mmke, Andreas Wiese, Hang Zhou |
| 2017 | FOCS | Approximating Geometric Knapsack via L-Packings. | Waldo Glvez, Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan, Andreas Wiese |
| 2017 | ICALP | When the Optimum is also Blind: a New Perspective on Universal Optimization. | Marek Adamczyk, Fabrizio Grandoni, Stefano Leonardi, Michal Wlodarczyk |
| 2017 | ICALP | Preserving Distances in Very Faulty Graphs. | Greg Bodwin, Fabrizio Grandoni, Merav Parter, Virginia Vassilevska Williams |
| 2017 | SODA | To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack. | Fabrizio Grandoni, Tobias Mmke, Andreas Wiese, Hang Zhou |
| 2017 | STOC | Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree. | Fabrizio Grandoni, Bundit Laekhanukit |
| 2016 | FOCS | Truly Sub-cubic Algorithms for Language Edit Distance and RNA-Folding via Fast Bounded-Difference Min-Plus Product. | Karl Bringmann, Fabrizio Grandoni, Barna Saha, Virginia Vassilevska Williams |
| 2015 | ESA | Improved Approximation Algorithms for Stochastic Matching. | Marek Adamczyk, Fabrizio Grandoni, Joydeep Mukherjee |
| 2015 | ESA | Improved Purely Additive Fault-Tolerant Spanners. | Davide Bil, Fabrizio Grandoni, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2015 | SODA | Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter. | Amir Abboud, Fabrizio Grandoni, Virginia Vassilevska Williams |
| 2015 | SODA | On Survivable Set Connectivity. | Parinya Chalermsook, Fabrizio Grandoni, Bundit Laekhanukit |
| 2015 | WADS | On Conflict-Free Multi-coloring. | Andreas Brtschi, Fabrizio Grandoni |
| 2015 | WAOA | Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows. | Fabrizio Grandoni, Salvatore Ingala, Sumedha Uniyal |
| 2014 | SODA | A Mazing 2+ | Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese |
| 2013 | ESA | Tight Kernel Bounds for Problems on Graphs with Small Degeneracy - (Extended Abstract). | Marek Cygan, Fabrizio Grandoni, Danny Hermelin |
| 2013 | IPCO | Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path. | Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese |
| 2013 | SODA | How to Sell Hyperedges: The Hypermatching Assignment Problem. | Marek Cygan, Fabrizio Grandoni, Monaldo Mastrolilli |
| 2013 | STACS | On Pairwise Spanners. | Marek Cygan, Fabrizio Grandoni, Telikepalli Kavitha |
| 2012 | ESA | A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees. | Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Pilipczuk, Piotr Sankowski |
| 2012 | ESA | On Min-Power Steiner Tree. | Fabrizio Grandoni |
| 2012 | FOCS | Improved Distance Sensitivity Oracles via Fast Single-Source Replacement Paths. | Fabrizio Grandoni, Virginia Vassilevska Williams |
| 2011 | IPCO | Approximation Algorithms for Single and Multi-Commodity Connected Facility Location. | Fabrizio Grandoni, Thomas Rothvo |
| 2011 | SODA | Pricing on Paths: A PTAS for the Highway Problem. | Fabrizio Grandoni, Thomas Rothvo |
| 2010 | ESA | Approximation Schemes for Multi-Budgeted Independence Systems. | Fabrizio Grandoni, Rico Zenklusen |
| 2010 | ICALP | Online Network Design with Outliers. | Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski |
| 2010 | ICALP | Network Design via Core Detouring for Problems without a Core. | Fabrizio Grandoni, Thomas Rothvo |
| 2010 | LATIN | Sharp Separation and Applications to Exact and Parameterized Algorithms. | Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grandoni, Saket Saurabh |
| 2010 | SODA | Utilitarian Mechanism Design for Multi-Objective Optimization. | Fabrizio Grandoni, Piotr Krysta, Stefano Leonardi, Carmine Ventre |
| 2010 | STOC | An improved LP-based approximation for steiner tree. | Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvo, Laura Sanit |
| 2009 | ESA | Iterative Rounding for Multi-Objective Optimization Problems. | Fabrizio Grandoni, R. Ravi, Mohit Singh |
| 2008 | ESA | Faster Steiner Tree Computation in Polynomial-Space. | Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch |
| 2008 | FOCS | Set Covering with our Eyes Closed. | Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, Mohit Singh |
| 2008 | IPCO | Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle. | Andr Berger, Vincenzo Bonifaci, Fabrizio Grandoni, Guido Schfer |
| 2008 | SODA | Approximating connected facility location problems via random facility sampling and core detouring. | Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Rothvo, Guido Schfer |
| 2007 | ESA | Optimal Resilient Dynamic Dictionaries. | Gerth Stlting Brodal, Rolf Fagerberg, Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano, Allan Grnlund Jrgensen, Gabriel Moruz, Thomas Mlhave |
| 2007 | ESA | Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation. | Emilio De Santis, Fabrizio Grandoni, Alessandro Panconesi |
| 2007 | SODA | Resilient search trees. | Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano |
| 2006 | CP | Algorithms and Constraint Programming. | Fabrizio Grandoni, Giuseppe F. Italiano |
| 2006 | ICALP | Optimal Resilient Sorting and Searching in the Presence of Memory Faults. | Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano |
| 2006 | ISAAC | Balanced Cut Approximation in Random Geometric Graphs. | Josep Daz, Fabrizio Grandoni, Alberto Marchetti-Spaccamela |
| 2006 | ISAAC | Improved Approximation for Single-Sink Buy-at-Bulk. | Fabrizio Grandoni, Giuseppe F. Italiano |
| 2006 | SODA | Measure and conquer: a simple O(2 | Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch |
| 2005 | COCOON | Distributed Weighted Vertex Cover via Maximal Matchings. | Fabrizio Grandoni, Jochen Knemann, Alessandro Panconesi |
| 2005 | ESA | Designing Reliable Algorithms in Unreliable Memories. | Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano |
| 2005 | ICALP | New Approaches for Virtual Private Network Design. | Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella |
| 2005 | ICALP | Measure and Conquer: Domination - A Case Study. | Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch |
| 2005 | ISAAC | Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach. | Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov |
| 2005 | PODC | Primal-dual based distributed algorithms for vertex cover with semi-hard capacities. | Fabrizio Grandoni, Jochen Knemann, Alessandro Panconesi, Mauro Sozio |
| 2005 | SODA | An improved approximation algorithm for virtual private network design. | Friedrich Eisenbrand, Fabrizio Grandoni |
| 2004 | WG | Decremental Clique Problem. | Fabrizio Grandoni, Giuseppe F. Italiano |
| 2003 | CP | Improved Algorithms for Max-restricted Path Consistency. | Fabrizio Grandoni, Giuseppe F. Italiano |
| 2000 | PDPTA | Evaluation of Integrated Error Processing and Fault Diagnosis in Multiprocessor Systems. | Felicita Di Giandomenico, Silvano Chiaradonna, Andrea Bondavalli, Fabrizio Grandoni |
| 1998 | ISORC | State Restoration in a COTS-Based N-Modular Architecture. | Andrea Bondavalli, Felicita Di Giandomenico, Fabrizio Grandoni, David Powell, Christophe Rabjac |
| 1987 | SRDS | A Gracefully Degradable Algorithm for Byzantine Agreement. | Felicita Di Giandomenico, M. L. Guidotti, Fabrizio Grandoni, Luca Simoncini |
| 1978 | ISCA | The Serial Microprocessor Array (SMA): Microprogramming and Application Examples. | Paolo Corsini, Graziano Frosini, Fabrizio Grandoni, G. Galati, M. La Manna |