 | Up a level |
Cohen-Addad Viallat, Vincent and Grandoni, Fabrizio and Lee, Euiwoong and Schwiegelshohn, Chris (2023) Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median. In: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) UNSPECIFIED.
Byrka, Jarosław and Grandoni, Fabrizio and Ameli, Afrouz Jabal (2023) Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree. SIAM Journal on Computing, 52 (3). pp. 718-739. ISSN 0097-5397
Garg, Mohit and Grandoni, Fabrizio and Jabal Ameli, Afrouz (2023) Improved Approximation for Two-Edge-Connectivity. In: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) UNSPECIFIED.
Abboud, Amir and Grandoni, Fabrizio and Vassilevska Williams, Virginia (2023) Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter. ACM Transactions on Algorithms, 19 (1). pp. 1-30. ISSN 1549-6325
Grandoni, Fabrizio and Mathieu, Claire and Zhou, Hang (2023) Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm. In: 14th Innovations in Theoretical Computer Science Conference (ITCS 2023).
Grandoni, Fabrizio and Ameli, Afrouz Jabal and Traub, Vera (2022) Breaching the 2-approximation barrier for the forest augmentation problem. In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing UNSPECIFIED.
Bhattacharya, Sayan and Grandoni, Fabrizio and Kulkarni, Janardhan and Liu, Quanquan C. and Solomon, Shay (2022) Fully Dynamic (Δ +1)-Coloring in O (1) Update Time. ACM Transactions on Algorithms, 18 (2). pp. 1-25. ISSN 1549-6325
Grandoni, Fabrizio and Schwiegelshohn, Chris and Solomon, Shay and Uzrad, Amitai (2022) Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds. In: Symposium on Simplicity in Algorithms (SOSA) UNSPECIFIED.
Grandoni, Fabrizio and Mömke, Tobias and Wiese, Andreas (2022) A PTAS for unsplittable flow on a path. In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing UNSPECIFIED.
Grandoni, Fabrizio and Mömke, Tobias and Wiese, Andreas (2022) Unsplittable Flow on a Path: The Game! In: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) UNSPECIFIED.
Grandoni, Fabrizio and Ostrovsky, Rafail and Rabani, Yuval and Schulman, Leonard J. and Venkat, Rakesh (2022) A refined approximation for Euclidean k-means. Information Processing Letters, 176. p. 106251. ISSN 00200190
Grandoni, Fabrizio and Italian, Giuseppe F. and Łukasiewicz, Aleksander and Parotsidis, Nikos and Uznański, Przemysław (2021) All-Pairs LCA in DAGs: Breaking through the O(n2.5) barrier. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) UNSPECIFIED.
Gálvez, Waldo and Grandoni, Fabrizio and Ingala, Salvatore and Heydrich, Sandy and Khan, Arindam and Wiese, Andreas (2021) Approximating Geometric Knapsack via L-packings. ACM Transactions on Algorithms, 17 (4). pp. 1-67. ISSN 1549-6325
G\'lvez, Waldo and Grandoni, Fabrizio and Ameli, Afrouz Jabal and Khodamoradi, Kamyar (2021) Approximation Algorithms for Demand Strip Packing. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference).
Grandoni, Fabrizio and M\"mke, Tobias and Wiese, Andreas (2021) Faster (1+\(ε\))-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back. In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference).
Galvez, Waldo and Grandoni, Fabrizio and Khan, Arindam and Ramirez-Romero, Diego and Wiese, Andreas (2021) Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More. In: 37th International Symposium on Computational Geometry, SoCG 2021, June 7-11, 2021, Buffalo, NY, USA (Virtual Conference).
Gálvez, Waldo and Grandoni, Fabrizio and Jabal Ameli, Afrouz and Sornat, Krzysztof (2021) On the Cycle Augmentation Problem: Hardness and Approximation Algorithms. Theory of Computing Systems, 65 (6). pp. 985-1008. ISSN 1432-4350
Bhattacharya, Sayan and Grandoni, Fabrizio and Wajc, David (2021) Online Edge Coloring Algorithms via the Nibble Method. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) UNSPECIFIED.
Grandoni, Fabrizio and Williams, Virginia Vassilevska (2020) Faster Replacement Paths and Distance Sensitivity Oracles. ACM Transactions on Algorithms, 16 (1). pp. 1-25. ISSN 1549-6325
Gálvez, Waldo and Grandoni, Fabrizio and Ameli, Afrouz Jabal and Sornat, Krzysztof (2020) On the Cycle Augmentation Problem: Hardness and Approximation Algorithms. In: Approximation and Online Algorithms UNSPECIFIED.
G\'lvez, Waldo and Grandoni, Fabrizio and Ameli, Afrouz Jabal and Jansen, Klaus and Khan, Arindam and Rau, Malin (2020) A Tight (3/2+\(ε\)) Approximation for Skewed Strip Packing. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference.
Cheriyan, Joe and Dippel, Jack and Grandoni, Fabrizio and Khan, Arindam and Narayan, Vishnu V. (2020) The matching augmentation problem: a $$\frac{7}{4}$$-approximation algorithm. Mathematical Programming, 182 (1-2). pp. 315-354. ISSN 0025-5610
Grandoni, Fabrizio and Leonardi, Stefano and Sankowski, Piotr and Schwiegelshohn, Chris and Solomon, Shay (2019) (1 + \(ε\))-Approximate Incremental Matching in Constant Deterministic Amortized Time. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019.
Abboud, Amir and Addanki, Raghavendra and Grandoni, Fabrizio and Panigrahi, Debmalya and Saha, Barna (2019) Dynamic set cover: improved algorithms and lower bounds. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing UNSPECIFIED.
Grandoni, Fabrizio and Laekhanukit, Bundit and Li, Shi (2019) O (log 2 k / log log k )-approximation algorithm for directed Steiner tree. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing UNSPECIFIED.
Becchetti, Luca and Bury, Marc and Cohen-Addad, Vincent and Grandoni, Fabrizio and Schwiegelshohn, Chris (2019) Oblivious dimension reduction for k -means: beyond subspaces and the Johnson-Lindenstrauss lemma. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing UNSPECIFIED.
Grandoni, Fabrizio and Wiese, Andreas (2019) Packing Cars into Narrow Roads: PTASs for Limited Supply Highway. In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany.
Grandoni, Fabrizio and Kratsch, Stefan and Wiese, Andreas (2019) Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack. In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany.
Bringmann, Karl and Grandoni, Fabrizio and Saha, Barna and Williams, Virginia Vassilevska (2019) Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product. SIAM Journal on Computing, 48 (2). pp. 481-512. ISSN 0097-5397
Grandoni, Fabrizio and Mömke, Tobias and Wiese, Andreas and Zhou, Hang (2018) A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing UNSPECIFIED.
Grandoni, Fabrizio and Kalaitzis, Christos and Zenklusen, Rico (2018) Improved approximation for tree augmentation: saving by rewiring. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing UNSPECIFIED.
Anagnostopoulos, Aris and Grandoni, Fabrizio and Leonardi, Stefano and Wiese, Andreas (2018) A Mazing 2+ε Approximation for Unsplittable Flow on a Path. ACM Transactions on Algorithms, 14 (4). pp. 1-23. ISSN 1549-6325
G\'lvez, Waldo and Grandoni, Fabrizio and Heydrich, Sandy and Ingala, Salvatore and Khan, Arindam and Wiese, Andreas (2017) Approximating Geometric Knapsack via L-Packings. In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017.
Bodwin, Greg and Grandoni, Fabrizio and Parter, Merav and Williams, Virginia Vassilevska (2017) Preserving Distances in Very Faulty Graphs. In: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland.
Grandoni, Fabrizio and Laekhanukit, Bundit (2017) Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing UNSPECIFIED.
Cygan, Marek and Grandoni, Fabrizio and Hermelin, Danny (2017) Tight Kernel Bounds for Problems on Graphs with Small Degeneracy. ACM Transactions on Algorithms, 13 (3). pp. 1-22. ISSN 1549-6325
Grandoni, Fabrizio and Mömke, Tobias and Wiese, Andreas and Zhou, Hang (2017) To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms UNSPECIFIED.
G\'lvez, Waldo and Grandoni, Fabrizio and Ingala, Salvatore and Khan, Arindam (2016) Improved Pseudo-Polynomial-Time Approximation for Strip Packing. In: 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, December 13-15, 2016, Chennai, India.
Anagnostopoulos, Aris and Grandoni, Fabrizio and Leonardi, Stefano and Sankowski, Piotr (2016) Online Network Design with Outliers. Algorithmica, 76 (1). pp. 88-109. ISSN 0178-4617
Grandoni, Fabrizio and Rothvoß, Thomas (2016) Pricing on Paths: A PTAS for the Highway Problem. SIAM Journal on Computing, 45 (2). pp. 216-231. ISSN 0097-5397
Bringmann, Karl and Grandoni, Fabrizio and Saha, Barna and Williams, Virginia Vassilevska (2016) Truly Sub-cubic Algorithms for Language Edit Distance and RNA-Folding via Fast Bounded-Difference Min-Plus Product. In: IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA.
Adamczyk, Marek and Grandoni, Fabrizio and Mukherjee, Joydeep (2015) Improved Approximation Algorithms for Stochastic Matching. In: Algorithms - ESA 2015 UNSPECIFIED.
Grandoni, Fabrizio and Ingala, Salvatore and Uniyal, Sumedha (2015) Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows. In: Approximation and Online Algorithms - 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers.
Bilo, Davide and Grandoni, Fabrizio and Guala, Luciano and Leucci, Stefano and Proietti, Guido (2015) Improved Purely Additive Fault-Tolerant Spanners. In: Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings.
Grandoni, Fabrizio and Kociumaka, Tomasz and Wlodarczyk, Michal (2015) An LP-rounding 2\(\surd\)2-approximation for restricted maximum acyclic subgraph. Inf. Process. Lett., 115 (2). pp. 182-185.
Bärtschi, Andreas and Grandoni, Fabrizio (2015) On Conflict-Free Multi-coloring. In: Algorithms and Data Structures UNSPECIFIED.
Grandoni, Fabrizio and Ravi, R. and Singh, Mohit and Zenklusen, Rico (2014) New approaches to multi-objective optimization. Mathematical Programming, 146 (1-2). pp. 525-554. ISSN 0025-5610
Chalermsook, Parinya and Grandoni, Fabrizio and Laekhanukit, Bundit (2014) On Survivable Set Connectivity. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms UNSPECIFIED.
Abboud, Amir and Grandoni, Fabrizio and Williams, Virginia Vassilevska (2014) Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms UNSPECIFIED.
Grandoni, Fabrizio and Krysta, Piotr and Leonardi, Stefano and Ventre, Carmine (2014) Utilitarian Mechanism Design for Multiobjective Optimization. SIAM Journal on Computing, 43 (4). pp. 1263-1290. ISSN 0097-5397
Fomin, Fedor V. and Grandoni, Fabrizio and Kratsch, Dieter and Lokshtanov, Daniel and Saurabh, Saket (2013) Computing Optimal Steiner Trees in Polynomial Space. Algorithmica, 65 (3). pp. 584-604. ISSN 1432-0541
Anagnostopoulos, Aris and Grandoni, Fabrizio and Leonardi, Stefano and Wiese, Andreas (2013) Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path. In: IPCO.
Petrillo, Umberto Ferraro and Grandoni, Fabrizio and Italiano, Giuseppe F. (2013) Data structures resilient to memory faults: An experimental study of dictionaries. Journal of Experimental Algorithmics, 18. ISSN 1084-6654
Cygan, Marek and Grandoni, Fabrizio and Mastrolilli, Palmo Monaldo (2013) How to Sell Hyperedges: The Hypermatching Assignment Problem. In: SODA.
Anagnostopoulos, Aris and Grandoni, Fabrizio and Leonardi, Stefano and Wiese, Andreas (2013) A Mazing 2+∊ Approximation for Unsplittable Flow on a Path. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms UNSPECIFIED.
Cygan, Marek and Grandoni, Fabrizio and Kavitha, Telikepalli (2013) On Pairwise Spanners. In: STACS.
Grandoni, Fabrizio and Gupta, Anupam and Leonardi, Stefano and Miettinen, Pauli and Sankowski, Piotr and Singh, Mohit (2013) Set Covering with Our Eyes Closed. In: Foundations of Computer Science FOCS '08. IEEE 49th Annual IEEE Symposium, 25.10.2008-28.10.2008, Philadelphia, PA.
Byrka, Jaroslaw and Grandoni, Fabrizio and Rothvoß, Thomas and Sanità, Laura (2013) Steiner Tree Approximation via Iterative Randomized Rounding. Journal of the ACM, 60 (1). p. 6. ISSN 0004-5411
Cygan, Marek and Grandoni, Fabrizio and Hermelin, Danny (2013) Tight Kernel Bounds for Problems on Graphs with Small Degeneracy - (Extended Abstract). In: ESA.
Grandoni, Fabrizio and Williams, Virginia Vassilevska (2012) Improved Distance Sensitivity Oracles via Fast Single-Source Replacement Paths. In: FOCS.
Grandoni, Fabrizio (2012) On Min-Power Steiner Tree. In: ESA.
Cygan, Marek and Grandoni, Fabrizio and Leonardi, Stefano and Pilipczuk, Marcin and Sankowski, Piotr (2012) A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees. In: ESA.
Fomin, Fedor V. and Grandoni, Fabrizio and Lokshtanov, Daniel and Saurabh, Saket (2012) Sharp Separation and Applications to Exact and Parameterized Algorithms. Algorithmica, 63 (3). pp. 692-706. ISSN 1432-0541
Grandoni, Fabrizio and Rothvoß, Thomas and Sanità, Laura (2011) From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk. Journal of Mathematics of Operations Research, 36 (2). pp. 185-204. ISSN 1526-5471
Grandoni, Fabrizio and Rothvoß, Thomas (2011) Approximation Algorithms for Single and Multi-Commodity Connected Facility Location. In: IPCO.
Cygan, Marek and Grandoni, Fabrizio and Leonardi, Stefano and Mucha, Marcin and Pilipczuk, Marcin and Sankowski, Piotr (2011) Approximation Algorithms for Union and Intersection Covering Problems. In: FSTTCS.
Berger, André and Bonifaci, Vincenzo and Grandoni, Fabrizio and Schäfer, Guido (2011) Budgeted matching and budgeted matroid intersection via the gasoline puzzle. Mathematical Programming, 128 (1-2). pp. 355-372. ISSN 1436-4646
Grandoni, Fabrizio and Rothvoß, Thomas (2011) Pricing on Paths: A PTAS for the Highway Problem. In: SODA.
Eisenbrand, Friedrich and Grandoni, Fabrizio and Rothvoß, Thomas and Schäfer, Guido (2010) Connected facility location via random facility sampling and core detouring. Journal of Computer and System Sciences, 76 (8). pp. 709-726. ISSN 0022-0000
Grandoni, Fabrizio and Nicosia, Gaia and Oriolo, Gianpaolo and Sanità, Laura (2010) Stable routing under the Spanning Tree Protocol. Operations Research Letters, 38 (5). pp. 399-404. ISSN 0167-6377
Grandoni, Fabrizio and Zenklusen, Rico (2010) Approximation Schemes for Multi-Budgeted Independence Systems. In: ESA (1).
Petrillo, Umberto Ferraro and Grandoni, Fabrizio and Italiano, Giuseppe F. (2010) Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries. In: SEA.
De Santis, Emilio and Grandoni, Fabrizio and Panconesi, Alessandro (2010) Low degree connectivity of ad-hoc networks via percolation. Advances in Applied Probability, 42 (2). pp. 559-576. ISSN 0001-8678
Grandoni, Fabrizio and Rothvoß, Thomas (2010) Network Design via Core Detouring for Problems without a Core. In: ICALP (1).
Anagnostopoulos, Aris and Grandoni, Fabrizio and Leonardi, Stefano and Sankowski, Piotr (2010) Online Network Design with Outliers. In: ICALP (1).
Fomin, Fedor V. and Lokshtanov, Daniel and Grandoni, Fabrizio and Saurabh, Saket (2010) Sharp Separation and Applications to Exact and Parameterized Algorithms. In: LATIN.
Grandoni, Fabrizio and Krysta, Piotr and Leonardi, Stefano and Ventre, Carmine (2010) Utilitarian Mechanism Design for Multi-Objective Optimization. In: SODA.
Byrka, Jaroslaw and Grandoni, Fabrizio and Rothvoß, Thomas and Sanità, Laura (2010) An improved LP-based approximation for steiner tree. In: STOC.
Diaz, Josep and Grandoni, Fabrizio and Marchetti-Spaccamela, Alberto (2009) Balanced cut approximation in random geometric graphs. Theoretical Computer Science, 410 (27-29). pp. 2725-2731. ISSN 0304-3975
Grandoni, Fabrizio and Ravi, Ramamoorthi and Singh, Mohit (2009) Iterative Rounding for Multi-Objective Optimization Problems. In: ESA.
Finocchi, Irene and Grandoni, Fabrizio and Italiano, Giuseppe F. (2009) Optimal resilient sorting and searching in the presence of memory faults. Theoretical Computer Science, 410 (44). pp. 4457-4470. ISSN 0304-3975
Finocchi, Irene and Grandoni, Fabrizio and Italiano, Giuseppe F. (2009) Resilient dictionaries. ACM Transactions on Algorithms, 6 (1). ISSN 1549-6325
Fomin, Fedor V. and Grandoni, Fabrizio and Kratsch, Dieter (2009) A measure & conquer approach for the analysis of exact algorithms. Journal of the ACM, 56 (5). ISSN 0004-5411
Eisenbrand, Friedrich and Grandoni, Fabrizio and Rothvoß, Thomas and Schäfer, Guido (2008) Approximating connected facility location problems via random facility sampling and core detouring. In: SODA.
Berger, André and Bonifaci, Vincenzo and Grandoni, Fabrizio and Schäfer, Guido (2008) Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle. In: IPCO.
Fomin, Fedor V. and Grandoni, Fabrizio and Pyatkin, Artem V. and Stepanov, Alexey A. (2008) Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications. ACM Transactions on Algorithms, 5 (1). ISSN 1549-6325
Grandoni, Fabrizio and Könemann, Jochen and Panconesi, Alessandro (2008) Distributed weighted vertex cover via maximal matchings. ACM Transactions on Algorithms, 5 (1). ISSN 1549-6325
Kratsch, Dieter and Fomin, Fedor V. and Grandoni, Fabrizio (2008) Exact Algorithms for Dominating Set. In: Encyclopedia of Algorithms. Springer.
Fomin, Fedor V. and Grandoni, Fabrizio and Kratsch, Dieter (2008) Faster Steiner Tree Computation in Polynomial-Space. In: ESA.
Grandoni, Fabrizio and Könemann, Jochen and Panconesi, Alessandro and Sozio, Mauro (2008) A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover. SIAM Journal on Computing, 38 (3). pp. 825-840. ISSN 0097-5397
Grandoni, Fabrizio and Gupta, Anupam and Leonardi, Stefano and Miettinen, Pauli and Sankowski, Piotr and Singh, Mohit (2008) Set Covering with our Eyes Closed. In: FOCS.
Fomin, Fedor V. and Grandoni, Fabrizio and Kratsch, Dieter (2008) Solving Connected Dominating Set Faster than 2^n. Algorithmica, 52 (2). pp. 153-166. ISSN 1432-0541
Grandoni, Fabrizio and Kaibel, Volker and Oriolo, Gianpaolo and Skutella, Martin (2008) A short proof of the VPN Tree Routing Conjecture on ring networks. Operations Research Letters, 36 (3). pp. 361-365. ISSN 0167-6377
Finocchi, Irene and Grandoni, Fabrizio and Italiano, Giuseppe F. (2007) Designing reliable algorithms in unreliable memories. Computer Science Review, 1 (2). pp. 77-87. ISSN 1574-0137
Dubhashi, Devdat and Grandoni, Fabrizio and Panconesi, Alessandro (2007) Distributed approximation algorithms via LP-duality and randomization. In: Handbook of Approximation Algorithms and Metaheuristics. Taylor and Francis.
De Santis, Emilio and Grandoni, Fabrizio and Panconesi, Alessandro (2007) Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation. In: ESA.
Eisenbrand, Friedrich and Grandoni, Fabrizio and Oriolo, Gianpaolo and Skutella, Martin (2007) New Approaches for Virtual Private Network Design. SIAM Journal of Computing, 37 (3). pp. 706-721. ISSN 0097-5397
Brodal, Gerth Stølting and Fagerberg, Rolf and Finocchi, Irene and Grandoni, Fabrizio and Italiano, Giuseppe F. and Jørgensen, Allan Grønlund and Moruz, Gabriel and Mølhave, Thomas (2007) Optimal Resilient Dynamic Dictionaries. In: ESA.
Finocchi, Irene and Grandoni, Fabrizio and Italiano, Giuseppe F. (2007) Resilient search trees. In: SODA.
Grandoni, Fabrizio and Italiano, Giuseppe F. (2006) Algorithms and Constraint Programming. In: CP.
Diaz, Josep and Grandoni, Fabrizio and Marchetti-Spaccamela, Alberto (2006) Balanced Cut Approximation in Random Geometric Graphs. In: ISAAC.
Grandoni, Fabrizio and Italiano, Giuseppe F. (2006) Improved Approximation for Single-Sink Buy-at-Bulk. In: ISAAC.
Fomin, Fedor V. and Grandoni, Fabrizio and Kratsch, Dieter (2006) Measure and conquer: a simple O(2^{0.288 n}) independent set algorithm. In: SODA.
Finocchi, Irene and Grandoni, Fabrizio and Italiano, Giuseppe F. (2006) Optimal Resilient Sorting and Searching in the Presence of Memory Faults. In: ICALP (1).
Fomin, Fedor V. and Grandoni, Fabrizio and Kratsch, Dieter (2006) Solving Connected Dominating Set Faster Than 2^n. In: FSTTCS.
Chandran, L. Sunil and Grandoni, Fabrizio (2006) A linear time algorithm to list the minimal separators of chordal graphs. Discrete Mathematics, 306 (3). pp. 351-358. ISSN 0012-365X
Grandoni, Fabrizio (2006) A note on the complexity of minimum dominating set. Journal of Discrete Algorithms, 4 (2). pp. 209-214. ISSN 1570-8667
Fomin, Fedor V. and Grandoni, Fabrizio and Pyatkin, Artem V. and Stepanov, Alexey A. (2005) On maximum number of minimal dominating sets in graphs. Electronic Notes in Discrete Mathematics, 22. pp. 157-162. ISSN 1571-0653
Chandran, L. Sunil and Grandoni, Fabrizio (2005) Refined memorization for vertex cover. Information Processing Letters, 93 (3). pp. 123-131. ISSN 0020-0190
Fomin, Fedor V. and Grandoni, Fabrizio and Pyatkin, Artem V. and Stepanov, Alexey A. (2005) Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach. In: ISAAC.
Finocchi, Irene and Grandoni, Fabrizio and Italiano, Giuseppe F. (2005) Designing Reliable Algorithms in Unreliable Memories. In: ESA.
Grandoni, Fabrizio and Könemann, Jochen and Panconesi, Alessandro (2005) Distributed Weighted Vertex Cover via Maximal Matchings. In: COCOON.
Fomin, Fedor V. and Grandoni, Fabrizio and Kratsch, Dieter (2005) Measure and Conquer: Domination - A Case Study. In: ICALP.
Eisenbrand, Friedrich and Grandoni, Fabrizio and Oriolo, Gianpaolo and Skutella, Martin (2005) New Approaches for Virtual Private Network Design. In: ICALP.
Grandoni, Fabrizio and Könemann, Jochen and Panconesi, Alessandro and Sozio, Mauro (2005) Primal-dual based distributed algorithms for vertex cover with semi-hard capacities. In: PODC.
Fomin, Fedor V. and Grandoni, Fabrizio and Kratsch, Dieter (2005) Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms. Bulletin of the European Association for Theoretical Computer Science, 87. pp. 47-77. ISSN 0252-9742
Eisenbrand, Friedrich and Grandoni, Fabrizio (2005) An improved approximation algorithm for virtual private network design. In: SODA.
Eisenbrand, Friedrich and Grandoni, Fabrizio (2004) On the complexity of fixed parameter clique and dominating set. Theoretical Computer Science, 326 (1-3). pp. 57-67. ISSN 0304-3975
Grandoni, Fabrizio and Italiano, Giuseppe F. (2004) Decremental Clique Problem. In: WG.
Grandoni, Fabrizio (2004) Exact Algorithms for Hard Graph Problems. PhD thesis, University of Rome Tor Vergata.
Chandran, L. Sunil and Grandoni, Fabrizio (2004) Refined Memorisation for Vertex Cover. In: IWPEC.
Eisenbrand, Friedrich and Grandoni, Fabrizio (2003) Detecting directed 4-cycles still faster. Information Processing Letters, 87 (1). pp. 13-15. ISSN 0020-0190
Grandoni, Fabrizio and Italiano, Giuseppe F. (2003) Improved Algorithms for Max-restricted Path Consistency. In: CP.
Adamczyk, Marek and Grandoni, Fabrizio and Leonardi, Stefano and Wlodarczyk, Michal (2017) When the Optimum is also Blind: a New Perspective on Universal Optimization. In: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland.
Byrka, Jaroslaw and Grandoni, Fabrizio and Ameli, Afrouz Jabal (2023) Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree. In: UNSPECIFIED.