Fabrizio Grandoni

190 papers A* 46A 18B 15Misc 2Journal 94Unranked 11

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A PTAS for Weighted Triangle-free 2-Matching. CoRR Miguel Bosch-Calvo, Fabrizio Grandoni, Yusuke Kobayashi, Takashi Noguchi
2026	A*	`conf`	Augmenting Packing Dynamic Programs to Handle (Many) Additional Budget Constraints. SODA Alexander Armbruster, Fabrizio Grandoni, Antoine Tinguely, Andreas Wiese
2026	A*	`conf`	Breaching the 2-Approximation Barrier for Euclidean Capacitated Vehicle Routing. SODA Zachary Friggstad, Fabrizio Grandoni, Ramin Mousavi
2026	J	`jnl`	Improved Approximation Algorithms for Non-Preemptive Throughput Maximization. CoRR Alexander Armbruster, Fabrizio Grandoni, Antoine Tinguely, Andreas Wiese
2026	J	`jnl`	Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds. ACM Trans. Algorithms Fabrizio Grandoni, Chris Schwiegelshohn, Shay Solomon, Amitai Uzrad
2025	A*	`ed.`	52nd International Colloquium on Automata, Languages, and Programming, ICALP 2025, Aarhus, Denmark, July 8-11, 2025 ICALP Keren Censor-Hillel, Fabrizio Grandoni, Joël Ouaknine, Gabriele Puppis
2025	J	`jnl`	A (2+ ϵ)-Approximation Algorithm for Metric CoRR Vincent Cohen-Addad, Fabrizio Grandoni, Euiwoong Lee, Chris Schwiegelshohn, Ola Svensson
2025	A*	`conf`	A (2+ε)-Approximation Algorithm for Metric k-Median. STOC Vincent Cohen-Addad, Fabrizio Grandoni, Euiwoong Lee, Chris Schwiegelshohn, Ola Svensson
2025	J	`jnl`	A 4/3 Approximation for 2-Vertex-Connectivity. TheoretiCS Miguel Bosch-Calvo, Fabrizio Grandoni, Afrouz Jabal Ameli
2025	A*	`conf`	A 5/4-Approximation for Two-Edge Connectivity. STOC Miguel Bosch-Calvo, Mohit Garg, Fabrizio Grandoni, Felix Hommelsheim, Afrouz Jabal Ameli, Alexander Lindermayr
2025	A*	`conf`	An Improved Greedy Approximation for (Metric) k-Means. FOCS Moses Charikar, Vincent Cohen-Addad, Ruiquan Gao, Fabrizio Grandoni, Euiwoong Lee, Ernest van Wijland
2025	B	`conf`	On the Approximability of Unsplittable Flow on a Path with Time Windows. IPCO Alexander Armbruster, Fabrizio Grandoni, Edin Husic, Antoine Tinguely, Andreas Wiese
2025	J	`jnl`	On the Approximability of Unsplittable Flow on a Path with Time Windows. CoRR Alexander Armbruster, Fabrizio Grandoni, Edin Husic, Antoine Tinguely, Andreas Wiese
2025	B	`conf`	On the Bidirected Cut Relaxation for Steiner Forest. IPCO Jaroslaw Byrka, Fabrizio Grandoni, Vera Traub
2024	J	`jnl`	A 5/4 Approximation for Two-Edge-Connectivity. CoRR Miguel Bosch-Calvo, Fabrizio Grandoni, Afrouz Jabal Ameli
2024	A*	`conf`	An O(loglog n)-Approximation for Submodular Facility Location. ICALP Fateme Abbasi, Marek Adamczyk, Miguel Bosch-Calvo, Jaroslaw Byrka, Fabrizio Grandoni, Krzysztof Sornat, Antoine Tinguely
2024	A*	`conf`	Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions. SoCG Fabrizio Grandoni, Edin Husic, Mathieu Mari, Antoine Tinguely
2024	J	`jnl`	Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions. CoRR Fabrizio Grandoni, Edin Husic, Mathieu Mari, Antoine Tinguely
2024	J	`jnl`	On the Bidirected Cut Relaxation for Steiner Forest. CoRR Jaroslaw Byrka, Fabrizio Grandoni, Vera Traub
2024	A*	`conf`	The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller Than 2. FOCS Jaroslaw Byrka, Fabrizio Grandoni, Vera Traub
2024	J	`jnl`	The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller than 2. CoRR Jaroslaw Byrka, Fabrizio Grandoni, Vera Traub
2024	B	`conf`	Unsplittable Flow on a Short Path. IPEC Ilan Doron-Arad, Fabrizio Grandoni, Ariel Kulik
2024	J	`jnl`	Unsplittable Flow on a Short Path. CoRR Ilan Doron-Arad, Fabrizio Grandoni, Ariel Kulik
2023	A*	`conf`	A 4/3 Approximation for 2-Vertex-Connectivity. ICALP Miguel Bosch-Calvo, Fabrizio Grandoni, Afrouz Jabal Ameli
2023	J	`jnl`	A 4/3 Approximation for 2-Vertex-Connectivity. CoRR Miguel Bosch-Calvo, Fabrizio Grandoni, Afrouz Jabal Ameli
2023	J	`jnl`	A PTAS for Triangle-Free 2-Matching. CoRR Miguel Bosch-Calvo, Fabrizio Grandoni, Afrouz Jabal Ameli
2023	J	`jnl`	A Tight (3/2+ε )-Approximation for Skewed Strip Packing. Algorithmica Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan, Malin Rau
2023	A*	`conf`	Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to SODA Vincent Cohen-Addad, Fabrizio Grandoni, Euiwoong Lee, Chris Schwiegelshohn
2023	J	`jnl`	Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree. SIAM J. Comput. Jaroslaw Byrka, Fabrizio Grandoni, Afrouz Jabal Ameli
2023	A*	`conf`	Improved Approximation for Two-Edge-Connectivity. SODA Mohit Garg, Fabrizio Grandoni, Afrouz Jabal Ameli
2023	J	`jnl`	Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter. ACM Trans. Algorithms Amir Abboud, Fabrizio Grandoni, Virginia Vassilevska Williams
2023	A	`conf`	Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm. ITCS Fabrizio Grandoni, Claire Mathieu, Hang Zhou
2022	A*	`conf`	A PTAS for unsplittable flow on a path. STOC Fabrizio Grandoni, Tobias Mömke, Andreas Wiese
2022	J	`jnl`	A refined approximation for Euclidean k-means. Inf. Process. Lett. Fabrizio Grandoni, Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Rakesh Venkat
2022	J	`jnl`	An O(loglog n)-Approximation for Submodular Facility Location. CoRR Fateme Abbasi, Marek Adamczyk, Miguel Bosch-Calvo, Jaroslaw Byrka, Fabrizio Grandoni, Krzysztof Sornat, Antoine Tinguely
2022	J	`jnl`	Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median. CoRR Vincent Cohen-Addad, Fabrizio Grandoni, Euiwoong Lee, Chris Schwiegelshohn
2022	A*	`conf`	Breaching the 2-approximation barrier for the forest augmentation problem. STOC Fabrizio Grandoni, Afrouz Jabal Ameli, Vera Traub
2022	J	`jnl`	Fully Dynamic (Δ +1)-Coloring in ACM Trans. Algorithms Sayan Bhattacharya, Fabrizio Grandoni, Janardhan Kulkarni, Quanquan C. Liu, Shay Solomon
2022	J	`jnl`	Improved Approximation for Two-Edge-Connectivity. CoRR Mohit Garg, Fabrizio Grandoni, Afrouz Jabal Ameli
2022	—	`conf`	Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds. SOSA Fabrizio Grandoni, Chris Schwiegelshohn, Shay Solomon, Amitai Uzrad
2022	J	`jnl`	Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm. CoRR Fabrizio Grandoni, Claire Mathieu, Hang Zhou
2022	A*	`conf`	Unsplittable Flow on a Path: The Game!. SODA Fabrizio Grandoni, Tobias Mömke, Andreas Wiese
2021	J	`jnl`	A Refined Approximation for Euclidean k-Means. CoRR Fabrizio Grandoni, Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Rakesh Venkat
2021	A*	`conf`	All-Pairs LCA in DAGs: Breaking through the SODA Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Lukasiewicz, Nikos Parotsidis, Przemyslaw Uznanski
2021	J	`jnl`	Approximating Geometric Knapsack via L-packings. ACM Trans. Algorithms Waldo Gálvez, Fabrizio Grandoni, Salvatore Ingala, Sandy Heydrich, Arindam Khan, Andreas Wiese
2021	—	`conf`	Approximation Algorithms for Demand Strip Packing. APPROX-RANDOM Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Kamyar Khodamoradi
2021	J	`jnl`	Approximation Algorithms for Demand Strip Packing. CoRR Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Kamyar Khodamoradi
2021	J	`jnl`	Breaching the 2-Approximation Barrier for the Forest Augmentation Problem. CoRR Fabrizio Grandoni, Afrouz Jabal Ameli, Vera Traub
2021	A	`conf`	Faster (1+ε)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back. ESA Fabrizio Grandoni, Tobias Mömke, Andreas Wiese
2021	A*	`conf`	Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More. SoCG Waldo Gálvez, Fabrizio Grandoni, Arindam Khan, Diego Ramírez-Romero, Andreas Wiese
2021	J	`jnl`	Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More. CoRR Waldo Gálvez, Fabrizio Grandoni, Arindam Khan, Diego Ramírez-Romero, Andreas Wiese
2021	J	`jnl`	Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds. CoRR Fabrizio Grandoni, Chris Schwiegelshohn, Shay Solomon, Amitai Uzrad
2021	J	`jnl`	On the Cycle Augmentation Problem: Hardness and Approximation Algorithms. Theory Comput. Syst. Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Krzysztof Sornat
2021	A*	`conf`	Online Edge Coloring Algorithms via the Nibble Method. SODA Sayan Bhattacharya, Fabrizio Grandoni, David Wajc
2020	A	`ed.`	28th Annual European Symposium on Algorithms, ESA 2020, Pisa, Italy (Virtual Conference), September 7-9, 2020 ESA Fabrizio Grandoni, Grzegorz Herman, Peter Sanders
2020	—	`conf`	A Tight (3/2+ε) Approximation for Skewed Strip Packing. APPROX-RANDOM Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan, Malin Rau
2020	J	`jnl`	All-Pairs LCA in DAGs: Breaking through the O(n CoRR Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Lukasiewicz, Nikos Parotsidis, Przemyslaw Uznanski
2020	A*	`conf`	Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree. STOC Jaroslaw Byrka, Fabrizio Grandoni, Afrouz Jabal Ameli
2020	J	`jnl`	Faster Replacement Paths and Distance Sensitivity Oracles. ACM Trans. Algorithms Fabrizio Grandoni, Virginia Vassilevska Williams
2020	J	`jnl`	Improved Approximation Algorithms for Stochastic-Matching Problems. CoRR Marek Adamczyk, Brian Brubach, Fabrizio Grandoni, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
2020	J	`jnl`	Online Edge Coloring Algorithms via the Nibble Method. CoRR Sayan Bhattacharya, Fabrizio Grandoni, David Wajc
2020	J	`jnl`	The matching augmentation problem: a $\frac{7}{4}$-approximation algorithm. Math. Program. Joe Cheriyan, Jack Dippel, Fabrizio Grandoni, Arindam Khan, Vishnu V. Narayan
2019	J	`jnl`	$O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm. SIAM J. Comput. Fabrizio Grandoni, Bundit Laekhanukit, Shi Li
2019	A*	`conf`	(1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time. SODA Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski, Chris Schwiegelshohn, Shay Solomon
2019	J	`jnl`	Breaching the 2-Approximation Barrier for Connectivity Augmentation: a Reduction to Steiner Tree. CoRR Jaroslaw Byrka, Fabrizio Grandoni, Afrouz Jabal Ameli
2019	A*	`conf`	Dynamic set cover: improved algorithms and lower bounds. STOC Amir Abboud, Raghavendra Addanki, Fabrizio Grandoni, Debmalya Panigrahi, Barna Saha
2019	J	`jnl`	Fully Dynamic (Δ+1)-Coloring in Constant Update Time. CoRR Sayan Bhattacharya, Fabrizio Grandoni, Janardhan Kulkarni, Quanquan C. Liu, Shay Solomon
2019	A*	`conf`	Oblivious dimension reduction for STOC Luca Becchetti, Marc Bury, Vincent Cohen-Addad, Fabrizio Grandoni, Chris Schwiegelshohn
2019	B	`conf`	On the Cycle Augmentation Problem: Hardness and Approximation Algorithms. WAOA Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Krzysztof Sornat
2019	A	`conf`	Packing Cars into Narrow Roads: PTASs for Limited Supply Highway. ESA Fabrizio Grandoni, Andreas Wiese
2019	A	`conf`	Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack. ESA Fabrizio Grandoni, Stefan Kratsch, Andreas Wiese
2019	J	`jnl`	Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack. CoRR Fabrizio Grandoni, Stefan Kratsch, Andreas Wiese
2019	J	`jnl`	Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product. SIAM J. Comput. Karl Bringmann, Fabrizio Grandoni, Barna Saha, Virginia Vassilevska Williams
2018	A*	`conf`	A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes. STOC Fabrizio Grandoni, Tobias Mömke, Andreas Wiese, Hang Zhou
2018	J	`jnl`	A Mazing 2+ϵ Approximation for Unsplittable Flow on a Path. ACM Trans. Algorithms Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese
2018	—	`ch.`	Distributed Approximation Algorithms via LP-Duality and Randomization. Handbook of Approximation Algorithms and Metaheuristics (1) Devdatt P. Dubhashi, Fabrizio Grandoni, Alessandro Panconesi
2018	J	`jnl`	Editorial fun. Theor. Comput. Sci. Erik D. Demaine, Fabrizio Grandoni
2018	J	`jnl`	Editorial: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016 Special Issue. ACM Trans. Algorithms Arnab Bhattacharyya, Fabrizio Grandoni, Aleksandar Nikolov, Barna Saha, Saket Saurabh, Aravindan Vijayaraghavan, Qin Zhang
2018	J	`jnl`	Improved Approximation for Tree Augmentation: Saving by Rewiring. CoRR Fabrizio Grandoni, Christos Kalaitzis, Rico Zenklusen
2018	J	`jnl`	Improved Pseudo-Polynomial-Time Approximation for Strip Packing. CoRR Waldo Gálvez, Fabrizio Grandoni, Salvatore Ingala, Arindam Khan
2018	A*	`conf`	Improved approximation for tree augmentation: saving by rewiring. STOC Fabrizio Grandoni, Christos Kalaitzis, Rico Zenklusen
2018	J	`jnl`	O(log CoRR Fabrizio Grandoni, Bundit Laekhanukit, Shi Li
2018	J	`jnl`	The Matching Augmentation Problem: A 7/4-Approximation Algorithm. CoRR Joe Cheriyan, Jack Dippel, Fabrizio Grandoni, Arindam Khan, Vishnu V. Narayan
2017	A*	`conf`	Approximating Geometric Knapsack via L-Packings. FOCS Waldo Gálvez, Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan, Andreas Wiese
2017	J	`jnl`	Approximating Geometric Knapsack via L-packings. CoRR Waldo Gálvez, Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan, Andreas Wiese
2017	A*	`conf`	Preserving Distances in Very Faulty Graphs. ICALP Greg Bodwin, Fabrizio Grandoni, Merav Parter, Virginia Vassilevska Williams
2017	J	`jnl`	Preserving Distances in Very Faulty Graphs. CoRR Greg Bodwin, Fabrizio Grandoni, Merav Parter, Virginia Vassilevska Williams
2017	A*	`conf`	Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree. STOC Fabrizio Grandoni, Bundit Laekhanukit
2017	J	`jnl`	Tight Kernel Bounds for Problems on Graphs with Small Degeneracy. ACM Trans. Algorithms Marek Cygan, Fabrizio Grandoni, Danny Hermelin
2017	A*	`conf`	To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack. SODA Fabrizio Grandoni, Tobias Mömke, Andreas Wiese, Hang Zhou
2017	J	`jnl`	Truly Sub-cubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product. CoRR Karl Bringmann, Fabrizio Grandoni, Barna Saha, Virginia Vassilevska Williams
2017	A*	`conf`	When the Optimum is also Blind: a New Perspective on Universal Optimization. ICALP Marek Adamczyk, Fabrizio Grandoni, Stefano Leonardi, Michal Wlodarczyk
2017	J	`jnl`	When the Optimum is also Blind: a New Perspective on Universal Optimization. CoRR Marek Adamczyk, Fabrizio Grandoni, Stefano Leonardi, Michal Wlodarczyk
2016	Misc	`ed.`	8th International Conference on Fun with Algorithms, FUN 2016, La Maddalena, Italy, June 8-10, 2016 FUN Erik D. Demaine, Fabrizio Grandoni
2016	—	`ch.`	Exact Algorithms for Maximum Independent Set. Encyclopedia of Algorithms Fabrizio Grandoni
2016	—	`conf`	Improved Pseudo-Polynomial-Time Approximation for Strip Packing. FSTTCS Waldo Gálvez, Fabrizio Grandoni, Salvatore Ingala, Arindam Khan
2016	J	`jnl`	Online Network Design with Outliers. Algorithmica Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski
2016	J	`jnl`	Pricing on Paths: A PTAS for the Highway Problem. SIAM J. Comput. Fabrizio Grandoni, Thomas Rothvoß
2016	J	`jnl`	Surviving in Directed Graphs: A Polylogarithmic Approximation for Two-Connected Directed Steiner Tree. CoRR Fabrizio Grandoni, Bundit Laekhanukit
2016	A*	`conf`	Truly Sub-cubic Algorithms for Language Edit Distance and RNA-Folding via Fast Bounded-Difference Min-Plus Product. FOCS Karl Bringmann, Fabrizio Grandoni, Barna Saha, Virginia Vassilevska Williams
2015	J	`jnl`	An LP-rounding 2√2-approximation for restricted maximum acyclic subgraph. Inf. Process. Lett. Fabrizio Grandoni, Tomasz Kociumaka, Michal Wlodarczyk
2015	A	`conf`	Improved Approximation Algorithms for Stochastic Matching. ESA Marek Adamczyk, Fabrizio Grandoni, Joydeep Mukherjee
2015	J	`jnl`	Improved Approximation Algorithms for Stochastic Matching. CoRR Marek Adamczyk, Fabrizio Grandoni, Joydeep Mukherjee
2015	B	`conf`	Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows. WAOA Fabrizio Grandoni, Salvatore Ingala, Sumedha Uniyal
2015	A	`conf`	Improved Purely Additive Fault-Tolerant Spanners. ESA Davide Bilò, Fabrizio Grandoni, Luciano Gualà, Stefano Leucci, Guido Proietti
2015	J	`jnl`	Improved Purely Additive Fault-Tolerant Spanners. CoRR Davide Bilò, Fabrizio Grandoni, Luciano Gualà, Stefano Leucci, Guido Proietti
2015	B	`conf`	On Conflict-Free Multi-coloring. WADS Andreas Bärtschi, Fabrizio Grandoni
2015	A*	`conf`	On Survivable Set Connectivity. SODA Parinya Chalermsook, Fabrizio Grandoni, Bundit Laekhanukit
2015	A*	`conf`	Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter. SODA Amir Abboud, Fabrizio Grandoni, Virginia Vassilevska Williams
2014	A*	`conf`	A Mazing 2+ SODA Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese
2014	J	`jnl`	An LP-Rounding $2\sqrt{2}$ Approximation for Restricted Maximum Acyclic Subgraph. CoRR Fabrizio Grandoni, Tomasz Kociumaka, Michal Wlodarczyk
2014	J	`jnl`	New approaches to multi-objective optimization. Math. Program. Fabrizio Grandoni, R. Ravi, Mohit Singh, Rico Zenklusen
2014	J	`jnl`	Utilitarian Mechanism Design for Multiobjective Optimization. SIAM J. Comput. Fabrizio Grandoni, Piotr Krysta, Stefano Leonardi, Carmine Ventre
2013	J	`jnl`	Computing Optimal Steiner Trees in Polynomial Space. Algorithmica Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch, Daniel Lokshtanov, Saket Saurabh
2013	B	`conf`	Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path. IPCO Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese
2013	J	`jnl`	Data structures resilient to memory faults: An experimental study of dictionaries. ACM J. Exp. Algorithmics Umberto Ferraro Petrillo, Fabrizio Grandoni, Giuseppe F. Italiano
2013	A*	`conf`	How to Sell Hyperedges: The Hypermatching Assignment Problem. SODA Marek Cygan, Fabrizio Grandoni, Monaldo Mastrolilli
2013	J	`jnl`	On Pairwise Spanners CoRR Marek Cygan, Fabrizio Grandoni, Telikepalli Kavitha
2013	A	`conf`	On Pairwise Spanners. STACS Marek Cygan, Fabrizio Grandoni, Telikepalli Kavitha
2013	J	`jnl`	Set Covering with Our Eyes Closed. SIAM J. Comput. Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, Mohit Singh
2013	J	`jnl`	Steiner Tree Approximation via Iterative Randomized Rounding. J. ACM Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoß, Laura Sanità
2013	J	`jnl`	Tight Kernel Bounds for Problems on Graphs with Small Degeneracy CoRR Marek Cygan, Fabrizio Grandoni, Danny Hermelin
2013	A	`conf`	Tight Kernel Bounds for Problems on Graphs with Small Degeneracy - (Extended Abstract). ESA Marek Cygan, Fabrizio Grandoni, Danny Hermelin
2012	J	`jnl`	A Mazing 2+eps Approximation for Unsplittable Flow on a Path CoRR Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese
2012	A	`conf`	A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees. ESA Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Pilipczuk, Piotr Sankowski
2012	A*	`conf`	Improved Distance Sensitivity Oracles via Fast Single-Source Replacement Paths. FOCS Fabrizio Grandoni, Virginia Vassilevska Williams
2012	J	`jnl`	On Min-Power Steiner Tree CoRR Fabrizio Grandoni
2012	A	`conf`	On Min-Power Steiner Tree. ESA Fabrizio Grandoni
2012	J	`jnl`	Sharp Separation and Applications to Exact and Parameterized Algorithms. Algorithmica Fedor V. Fomin, Fabrizio Grandoni, Daniel Lokshtanov, Saket Saurabh
2011	B	`conf`	Approximation Algorithms for Single and Multi-Commodity Connected Facility Location. IPCO Fabrizio Grandoni, Thomas Rothvoß
2011	J	`jnl`	Approximation Algorithms for Union and Intersection Covering Problems CoRR Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski
2011	—	`conf`	Approximation Algorithms for Union and Intersection Covering Problems. FSTTCS Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski
2011	J	`jnl`	Budgeted matching and budgeted matroid intersection via the gasoline puzzle. Math. Program. André Berger, Vincenzo Bonifaci, Fabrizio Grandoni, Guido Schäfer
2011	J	`jnl`	From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk. Math. Oper. Res. Fabrizio Grandoni, Thomas Rothvoß, Laura Sanità
2011	A*	`conf`	Pricing on Paths: A PTAS for the Highway Problem. SODA Fabrizio Grandoni, Thomas Rothvoß
2010	A*	`conf`	An improved LP-based approximation for steiner tree. STOC Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoß, Laura Sanità
2010	—	`conf`	Approximation Schemes for Multi-Budgeted Independence Systems. ESA (1) Fabrizio Grandoni, Rico Zenklusen
2010	J	`jnl`	Connected facility location via random facility sampling and core detouring. J. Comput. Syst. Sci. Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Rothvoß, Guido Schäfer
2010	B	`conf`	Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries. SEA Umberto Ferraro Petrillo, Fabrizio Grandoni, Giuseppe F. Italiano
2010	—	`conf`	Network Design via Core Detouring for Problems without a Core. ICALP (1) Fabrizio Grandoni, Thomas Rothvoß
2010	—	`conf`	Online Network Design with Outliers. ICALP (1) Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski
2010	J	`jnl`	Optimization with More than One Budget CoRR Fabrizio Grandoni, Rico Zenklusen
2010	J	`jnl`	Prizing on Paths: A PTAS for the Highway Problem CoRR Fabrizio Grandoni, Thomas Rothvoß
2010	B	`conf`	Sharp Separation and Applications to Exact and Parameterized Algorithms. LATIN Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grandoni, Saket Saurabh
2010	J	`jnl`	Stable routing under the Spanning Tree Protocol. Oper. Res. Lett. Fabrizio Grandoni, Gaia Nicosia, Gianpaolo Oriolo, Laura Sanità
2010	A*	`conf`	Utilitarian Mechanism Design for Multi-Objective Optimization. SODA Fabrizio Grandoni, Piotr Krysta, Stefano Leonardi, Carmine Ventre
2009	J	`jnl`	A measure & conquer approach for the analysis of exact algorithms. J. ACM Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
2009	J	`jnl`	Balanced cut approximation in random geometric graphs. Theor. Comput. Sci. Josep Díaz, Fabrizio Grandoni, Alberto Marchetti-Spaccamela
2009	A	`conf`	Iterative Rounding for Multi-Objective Optimization Problems. ESA Fabrizio Grandoni, R. Ravi, Mohit Singh
2009	J	`jnl`	Optimal resilient sorting and searching in the presence of memory faults. Theor. Comput. Sci. Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
2009	J	`jnl`	Resilient dictionaries. ACM Trans. Algorithms Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
2008	J	`jnl`	A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover. SIAM J. Comput. Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi, Mauro Sozio
2008	J	`jnl`	A short proof of the VPN Tree Routing Conjecture on ring networks. Oper. Res. Lett. Fabrizio Grandoni, Volker Kaibel, Gianpaolo Oriolo, Martin Skutella
2008	A*	`conf`	Approximating connected facility location problems via random facility sampling and core detouring. SODA Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Rothvoß, Guido Schäfer
2008	B	`conf`	Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle. IPCO André Berger, Vincenzo Bonifaci, Fabrizio Grandoni, Guido Schäfer
2008	J	`jnl`	Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications. ACM Trans. Algorithms Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov
2008	J	`jnl`	Distributed weighted vertex cover via maximal matchings. ACM Trans. Algorithms Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi
2008	—	`ch.`	Exact Algorithms for Dominating Set. Encyclopedia of Algorithms Dieter Kratsch, Fedor V. Fomin, Fabrizio Grandoni
2008	A	`conf`	Faster Steiner Tree Computation in Polynomial-Space. ESA Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
2008	A*	`conf`	Set Covering with our Eyes Closed. FOCS Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, Mohit Singh
2008	J	`jnl`	Solving Connected Dominating Set Faster than 2 Algorithmica Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
2007	J	`jnl`	Designing reliable algorithms in unreliable memories. Comput. Sci. Rev. Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
2007	—	`ch.`	Distributed Approximation Algorithms via LP-Duality and Randomization. Handbook of Approximation Algorithms and Metaheuristics Alessandro Panconesi, Fabrizio Grandoni, Devdatt P. Dubhashi
2007	A	`conf`	Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation. ESA Emilio De Santis, Fabrizio Grandoni, Alessandro Panconesi
2007	J	`jnl`	New Approaches for Virtual Private Network Design. SIAM J. Comput. Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella
2007	A	`conf`	Optimal Resilient Dynamic Dictionaries. ESA Gerth Stølting Brodal, Rolf Fagerberg, Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano, Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave
2007	A*	`conf`	Resilient search trees. SODA Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
2006	J	`jnl`	A linear time algorithm to list the minimal separators of chordal graphs. Discret. Math. L. Sunil Chandran, Fabrizio Grandoni
2006	J	`jnl`	A note on the complexity of minimum dominating set. J. Discrete Algorithms Fabrizio Grandoni
2006	A	`conf`	Algorithms and Constraint Programming. CP Fabrizio Grandoni, Giuseppe F. Italiano
2006	B	`conf`	Balanced Cut Approximation in Random Geometric Graphs. ISAAC Josep Díaz, Fabrizio Grandoni, Alberto Marchetti-Spaccamela
2006	B	`conf`	Improved Approximation for Single-Sink Buy-at-Bulk. ISAAC Fabrizio Grandoni, Giuseppe F. Italiano
2006	A*	`conf`	Measure and conquer: a simple O(2 SODA Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
2006	—	`conf`	Optimal Resilient Sorting and Searching in the Presence of Memory Faults. ICALP (1) Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
2006	—	`conf`	Solving Connected Dominating Set Faster Than 2 FSTTCS Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
2005	A*	`conf`	An improved approximation algorithm for virtual private network design. SODA Friedrich Eisenbrand, Fabrizio Grandoni
2005	B	`conf`	Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach. ISAAC Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov
2005	A	`conf`	Designing Reliable Algorithms in Unreliable Memories. ESA Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
2005	Misc	`conf`	Distributed Weighted Vertex Cover via Maximal Matchings. COCOON Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi
2005	A*	`conf`	Measure and Conquer: Domination - A Case Study. ICALP Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
2005	A*	`conf`	New Approaches for Virtual Private Network Design. ICALP Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella
2005	J	`jnl`	On maximum number of minimal dominating sets in graphs. Electron. Notes Discret. Math. Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov
2005	A*	`conf`	Primal-dual based distributed algorithms for vertex cover with semi-hard capacities. PODC Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi, Mauro Sozio
2005	J	`jnl`	Refined memorization for vertex cover. Inf. Process. Lett. L. Sunil Chandran, Fabrizio Grandoni
2005	J	`jnl`	Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms. Bull. EATCS Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
2004	B	`conf`	Decremental Clique Problem. WG Fabrizio Grandoni, Giuseppe F. Italiano
2004	J	`jnl`	On the complexity of fixed parameter clique and dominating set. Theor. Comput. Sci. Friedrich Eisenbrand, Fabrizio Grandoni
2004	—	`conf`	Refined Memorisation for Vertex Cover. IWPEC L. Sunil Chandran, Fabrizio Grandoni
2003	J	`jnl`	Detecting directed 4-cycles still faster. Inf. Process. Lett. Friedrich Eisenbrand, Fabrizio Grandoni
2003	A	`conf`	Improved Algorithms for Max-restricted Path Consistency. CP Fabrizio Grandoni, Giuseppe F. Italiano