Name and Surname Fabrizio Grandoni

Position Department of Innovative Technologies, Professore

Email fabrizio.grandoni@supsi.ch

Office Polo universitario Lugano, Campus Est, Viganello
Polo universitario Lugano, Campus Est, Via la Santa 1, 6962 Lugano-Viganello

Internal telephone number +41586666590

vCard

Education and training He got a Master Degree in Computer Engineering cum laude at the Universita' di Roma Tor Vergata (Italy) on July 2000. He got a PhD in Computer Science at the same university on May 2004. He spent part of his PhD at the Max Planck Institut fur Informatik (Germany) as a visiting student and as a Marie-Curie Fellow.

Work experience He was a PostDoc in the following Universities and Research Centers: Max Planck Institut fur Informatik (Germany), Universitetet i Bergen (Norway), Sapienza Universita' di Roma (Italy), Technische Universität Berlin (Germany), Ècole Polytechnique Fèdèrale de Lausanne (Switzerland). He was an Assistant Professor at the University of Rome Tor Vergata between 2007 and 2011. He published over 100 papers with more than 80 distinct coauthors on the top journals and conferences of his area. His papers obtained over 3000 citations, and his h-index is 31.

Skills His research is focused on the design and analysis of algorithms and data structures, with a special focus on approximation algorithms. He also works on exact/parameterized algorithms, distributed algorithms, dynamic algorithms, and data structures resilient to memory faults.

Awards - Marie-Curie Doctoral Fellowship, 2002. - Best Paper Award at the ACM Symposium on Theory of Computing, 2010. - ERC Starting Grant, 2011. - EATCS-IPEC Nerode Prize, 2017.

Article in conference proceedings 80 Elements

Byrka, J., Grandoni, F.& Ameli, A. (2023) Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree. » more details Garg, M., Grandoni, F.& Jabal Ameli, A. (2023) Improved Approximation for Two-Edge-Connectivity. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.2368-2410. » more details Cohen-Addad Viallat, V., Grandoni, F., Lee, E.& Schwiegelshohn, C. (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), pp.940-986. » more details Grandoni, F., Mathieu, C.& Zhou, H. (2023) Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm., pp.631-6313. Schloss Dagstuhl — Leibniz-Zentrum für Informatik. » more details Byrka, J., Grandoni, F.& Ameli, A. (2023) Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree., pp.718-739. » more details Grandoni, F., Ameli, A.& Traub, V. (2022) Breaching the 2-approximation barrier for the forest augmentation problem. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pp.1598-1611. » more details Grandoni, F., Mömke, T.& Wiese, A. (2022) PTAS for unsplittable flow on a path, A. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pp.289-302. » more details Grandoni, F., Mömke, T.& Wiese, A. (2022) Unsplittable Flow on a Path: The Game!. In Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.906-926. » more details Grandoni, F., Schwiegelshohn, C., Solomon, S.& Uzrad, A. (2022) Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds. In Symposium on Simplicity in Algorithms (SOSA), pp.12-23. » more details Grandoni, F., Italian, G., Łukasiewicz, A., Parotsidis, N.& Uznański, P. (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), pp.273-289. » more details Galvez, W., Grandoni, F., Khan, A., Ramirez-Romero, D.& Wiese, A. (2021) Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More., pp.391-3917. Schloss Dagstuhl - Leibniz-Zentrum f\"r Informatik. » more details G\'lvez, W., Grandoni, F., Ameli, A.& Khodamoradi, K. (2021) Approximation Algorithms for Demand Strip Packing., pp.201-2024. Schloss Dagstuhl - Leibniz-Zentrum f\"r Informatik. » more details Grandoni, F., M\"mke, T.& Wiese, A. (2021) Faster (1+\(ε\))-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back., pp.491-4915. Schloss Dagstuhl - Leibniz-Zentrum f\"r Informatik. » more details Bhattacharya, S., Grandoni, F.& Wajc, D. (2021) Online Edge Coloring Algorithms via the Nibble Method. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.2830-2842. » more details G\'lvez, W., Grandoni, F., Ameli, A., Jansen, K., Khan, A.& Rau, M. (2020) Tight (3/2+\(ε\)) Approximation for Skewed Strip Packing, A., pp.441-4418. Schloss Dagstuhl - Leibniz-Zentrum f\"r Informatik. » more details Gálvez, W., Grandoni, F., Ameli, A.& Sornat, K. (2020) On the Cycle Augmentation Problem: Hardness and Approximation Algorithms. In Approximation and Online Algorithms, pp.138-153. » more details Abboud, A., Addanki, R., Grandoni, F., Panigrahi, D.& Saha, B. (2019) Dynamic set cover: improved algorithms and lower bounds. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pp.114-125. » more details Becchetti, L., Bury, M., Cohen-Addad, V., Grandoni, F.& Schwiegelshohn, C. (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, pp.1039-1050. » more details Grandoni, F., Laekhanukit, B.& Li, S. (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, pp.253-264. » more details Grandoni, F.& Wiese, A. (2019) Packing Cars into Narrow Roads: PTASs for Limited Supply Highway., pp.541-5414. Schloss Dagstuhl - Leibniz-Zentrum f\"r Informatik. » more details Grandoni, F., Leonardi, S., Sankowski, P., Schwiegelshohn, C.& Solomon, S. (2019) 1 + \(ε\))-Approximate Incremental Matching in Constant Deterministic Amortized Time., pp.1886-1898. SIAM. » more details Grandoni, F., Kratsch, S.& Wiese, A. (2019) Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack., pp.531-5316. Schloss Dagstuhl - Leibniz-Zentrum f\"r Informatik. » more details Grandoni, F., Mömke, T., Wiese, A.& Zhou, H. (2018) 5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes, A. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pp.607-619. » more details Grandoni, F., Kalaitzis, C.& Zenklusen, R. (2018) Improved approximation for tree augmentation: saving by rewiring. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pp.632-645. » more details Bodwin, G., Grandoni, F., Parter, M.& Williams, V. (2017) Preserving Distances in Very Faulty Graphs., pp.731-7314. Schloss Dagstuhl - Leibniz-Zentrum f\"r Informatik. » more details G\'lvez, W., Grandoni, F., Heydrich, S., Ingala, S., Khan, A.& Wiese, A. (2017) Approximating Geometric Knapsack via L-Packings., pp.260-271. IEEE Computer Society. » more details Adamczyk, M., Grandoni, F., Leonardi, S.& Wlodarczyk, M. (2017) When the Optimum is also Blind: a New Perspective on Universal Optimization. » more details Grandoni, F.& Laekhanukit, B. (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, pp.420-428. » more details Grandoni, F., Mömke, T., Wiese, A.& Zhou, H. (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, pp.2411-2422. » more details Bringmann, K., Grandoni, F., Saha, B.& Williams, V. (2016) Truly Sub-cubic Algorithms for Language Edit Distance and RNA-Folding via Fast Bounded-Difference Min-Plus Product., pp.375-384. IEEE Computer Society. » more details G\'lvez, W., Grandoni, F., Ingala, S.& Khan, A. (2016) Improved Pseudo-Polynomial-Time Approximation for Strip Packing., pp.91-914. Schloss Dagstuhl - Leibniz-Zentrum f\"r Informatik. » more details Bärtschi, A.& Grandoni, F. (2015) On Conflict-Free Multi-coloring. In Algorithms and Data Structures, pp.103-114. » more details Bilo, D., Grandoni, F., Guala, L., Leucci, S.& Proietti, G. (2015) Improved Purely Additive Fault-Tolerant Spanners., pp.167-178. Springer. » more details Adamczyk, M., Grandoni, F.& Mukherjee, J. (2015) Improved Approximation Algorithms for Stochastic Matching. In Algorithms - ESA 2015, pp.1-12. » more details Grandoni, F., Ingala, S.& Uniyal, S. (2015) Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows., pp.13-24. Springer. » more details Abboud, A., Grandoni, F.& Williams, V. (2014) Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.1681-1697. » more details Chalermsook, P., Grandoni, F.& Laekhanukit, B. (2014) On Survivable Set Connectivity. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.25-36. » more details Grandoni, F., Gupta, A., Leonardi, S., Miettinen, P., Sankowski, P.& Singh, M. (2013) Set Covering with Our Eyes Closed. In Foundations of Computer Science, pp.347-356. » more details Anagnostopoulos, A., Grandoni, F., Leonardi, S.& Wiese, A. (2013) Mazing 2+∊ Approximation for Unsplittable Flow on a Path, A. In Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.26-41. » more details Cygan, M., Grandoni, F.& Mastrolilli, P. (2013) How to Sell Hyperedges: The Hypermatching Assignment Problem., pp.342-351. » more details Cygan, M., Grandoni, F.& Kavitha, T. (2013) On Pairwise Spanners., pp.209-220. » more details Anagnostopoulos, A., Grandoni, F., Leonardi, S.& Wiese, A. (2013) Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path., pp.25-36. » more details Cygan, M., Grandoni, F.& Hermelin, D. (2013) Tight Kernel Bounds for Problems on Graphs with Small Degeneracy - (Extended Abstract)., pp.361-372. » more details Grandoni, F. (2012) On Min-Power Steiner Tree., pp.527-538. » more details Cygan, M., Grandoni, F., Leonardi, S., Pilipczuk, M.& Sankowski, P. (2012) Path-Decomposition Theorem with Applications to Pricing and Covering on Trees, A., pp.349-360. » more details Grandoni, F.& Williams, V. (2012) Improved Distance Sensitivity Oracles via Fast Single-Source Replacement Paths., pp.748-757. » more details Cygan, M., Grandoni, F., Leonardi, S., Mucha, M., Pilipczuk, M.& Sankowski, P. (2011) Approximation Algorithms for Union and Intersection Covering Problems., pp.28-40. » more details Grandoni, F.& Rothvoß, T. (2011) Pricing on Paths: A PTAS for the Highway Problem., pp.675-684. » more details Grandoni, F.& Rothvoß, T. (2011) Approximation Algorithms for Single and Multi-Commodity Connected Facility Location., pp.248-260. » more details Grandoni, F., Krysta, P., Leonardi, S.& Ventre, C. (2010) Utilitarian Mechanism Design for Multi-Objective Optimization., pp.573-584. » more details Grandoni, F.& Zenklusen, R. (2010) Approximation Schemes for Multi-Budgeted Independence Systems., pp.536-548. » more details Fomin, F., Lokshtanov, D., Grandoni, F.& Saurabh, S. (2010) Sharp Separation and Applications to Exact and Parameterized Algorithms., pp.72-83. » more details Byrka, J., Grandoni, F., Rothvoß, T.& Sanità, L. (2010) improved LP-based approximation for steiner tree, An., pp.583-592. » more details Grandoni, F.& Rothvoß, T. (2010) Network Design via Core Detouring for Problems without a Core., pp.490-502. » more details Petrillo, U., Grandoni, F.& Italiano, G. (2010) Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries., pp.398-410. » more details Anagnostopoulos, A., Grandoni, F., Leonardi, S.& Sankowski, P. (2010) Online Network Design with Outliers., pp.114-126. » more details Grandoni, F., Ravi, R.& Singh, M. (2009) Iterative Rounding for Multi-Objective Optimization Problems., pp.95-106. » more details Berger, A., Bonifaci, V., Grandoni, F.& Schäfer, G. (2008) Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle., pp.273-287. » more details Eisenbrand, F., Grandoni, F., Rothvoß, T.& Schäfer, G. (2008) Approximating connected facility location problems via random facility sampling and core detouring., pp.1174-1183. » more details Grandoni, F., Gupta, A., Leonardi, S., Miettinen, P., Sankowski, P.& Singh, M. (2008) Set Covering with our Eyes Closed., pp.347-356. » more details Fomin, F., Grandoni, F.& Kratsch, D. (2008) Faster Steiner Tree Computation in Polynomial-Space., pp.430-441. » more details De Santis, E., Grandoni, F.& Panconesi, A. (2007) Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation., pp.206-217. » more details Finocchi, I., Grandoni, F.& Italiano, G. (2007) Resilient search trees., pp.547-553. » more details Brodal, G., Fagerberg, R., Finocchi, I., Grandoni, F., Italiano, G., Jørgensen, A., Moruz, G.& Mølhave, T. (2007) Optimal Resilient Dynamic Dictionaries., pp.347-358. » more details Diaz, J., Grandoni, F.& Marchetti-Spaccamela, A. (2006) Balanced Cut Approximation in Random Geometric Graphs., pp.527-536. » more details Grandoni, F.& Italiano, G. (2006) Algorithms and Constraint Programming., pp.2-14. » more details Grandoni, F.& Italiano, G. (2006) Improved Approximation for Single-Sink Buy-at-Bulk., pp.111-120. » more details Finocchi, I., Grandoni, F.& Italiano, G. (2006) Optimal Resilient Sorting and Searching in the Presence of Memory Faults., pp.286-298. » more details Fomin, F., Grandoni, F.& Kratsch, D. (2006) Measure and conquer: a simple O(2^{0.288 n}) independent set algorithm., pp.18-25. » more details Fomin, F., Grandoni, F.& Kratsch, D. (2006) Solving Connected Dominating Set Faster Than 2^n., pp.152-163. » more details Eisenbrand, F., Grandoni, F., Oriolo, G.& Skutella, M. (2005) New Approaches for Virtual Private Network Design., pp.1151-1162. » more details Finocchi, I., Grandoni, F.& Italiano, G. (2005) Designing Reliable Algorithms in Unreliable Memories., pp.1-8. » more details Fomin, F., Grandoni, F.& Kratsch, D. (2005) Measure and Conquer: Domination - A Case Study., pp.191-203. » more details Grandoni, F., Könemann, J.& Panconesi, A. (2005) Distributed Weighted Vertex Cover via Maximal Matchings., pp.839-848. » more details Fomin, F., Grandoni, F., Pyatkin, A.& Stepanov, A. (2005) Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach., pp.573-582. » more details Eisenbrand, F.& Grandoni, F. (2005) improved approximation algorithm for virtual private network design, An., pp.928-932. » more details Grandoni, F., Könemann, J., Panconesi, A.& Sozio, M. (2005) Primal-dual based distributed algorithms for vertex cover with semi-hard capacities., pp.118-125. » more details Grandoni, F.& Italiano, G. (2004) Decremental Clique Problem., pp.142-153. » more details Chandran, L.& Grandoni, F. (2004) Refined Memorisation for Vertex Cover., pp.61-70. » more details Grandoni, F.& Italiano, G. (2003) Improved Algorithms for Max-restricted Path Consistency., pp.858-862. » more details

Chapter in book 2 Elements

Kratsch, D., Fomin, F.& Grandoni, F. 2008. Exact Algorithms for Dominating Set. In Encyclopedia of Algorithms. Springer. » more details Dubhashi, D., Grandoni, F.& Panconesi, A. 2007. Distributed approximation algorithms via LP-duality and randomization. In Handbook of Approximation Algorithms and Metaheuristics. Taylor and Francis. » more details

Scientific journal article 43 Elements

Byrka, J., Grandoni, F.& Ameli, A. (2023) Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree. SIAM Journal on Computing, vol. 52 (3) pp.718-739. » more details Abboud, A., Grandoni, F.& Vassilevska Williams, V. (2023) Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter. ACM Transactions on Algorithms, vol. 19 (1) pp.1-30. » more details Bhattacharya, S., Grandoni, F., Kulkarni, J., Liu, Q.& Solomon, S. (2022) Fully Dynamic (Δ +1)-Coloring in O (1) Update Time . ACM Transactions on Algorithms, vol. 18 (2) pp.1-25. » more details Grandoni, F., Ostrovsky, R., Rabani, Y., Schulman, L.& Venkat, R. (2022) refined approximation for Euclidean k-means, A. Information Processing Letters, vol. 176 pp.106251-106251. » more details Gálvez, W., Grandoni, F., Ingala, S., Heydrich, S., Khan, A.& Wiese, A. (2021) Approximating Geometric Knapsack via L-packings. ACM Transactions on Algorithms, vol. 17 (4) pp.1-67. » more details Gálvez, W., Grandoni, F., Jabal Ameli, A.& Sornat, K. (2021) On the Cycle Augmentation Problem: Hardness and Approximation Algorithms. Theory of Computing Systems, vol. 65 (6) pp.985-1008. » more details Grandoni, F.& Williams, V. (2020) Faster Replacement Paths and Distance Sensitivity Oracles. ACM Transactions on Algorithms, vol. 16 (1) pp.1-25. » more details Cheriyan, J., Dippel, J., Grandoni, F., Khan, A.& Narayan, V. (2020) matching augmentation problem: a $$\frac{7}{4}$$-approximation algorithm, The. Mathematical Programming, vol. 182 (1-2) pp.315-354. » more details Bringmann, K., Grandoni, F., Saha, B.& Williams, V. (2019) Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product. SIAM Journal on Computing, vol. 48 (2) pp.481-512. » more details Anagnostopoulos, A., Grandoni, F., Leonardi, S.& Wiese, A. (2018) Mazing 2+ε Approximation for Unsplittable Flow on a Path, A. ACM Transactions on Algorithms, vol. 14 (4) pp.1-23. » more details Cygan, M., Grandoni, F.& Hermelin, D. (2017) Tight Kernel Bounds for Problems on Graphs with Small Degeneracy. ACM Transactions on Algorithms, vol. 13 (3) pp.1-22. » more details Grandoni, F.& Rothvoß, T. (2016) Pricing on Paths: A PTAS for the Highway Problem. SIAM Journal on Computing, vol. 45 (2) pp.216-231. » more details Anagnostopoulos, A., Grandoni, F., Leonardi, S.& Sankowski, P. (2016) Online Network Design with Outliers. Algorithmica, vol. 76 (1) pp.88-109. » more details Grandoni, F., Kociumaka, T.& Wlodarczyk, M. (2015) LP-rounding 2\(\surd\)2-approximation for restricted maximum acyclic subgraph, An. Inf. Process. Lett., vol. 115 (2) pp.182-185. » more details Grandoni, F., Ravi, R., Singh, M.& Zenklusen, R. (2014) New approaches to multi-objective optimization. Mathematical Programming, vol. 146 (1-2) pp.525-554. » more details Grandoni, F., Krysta, P., Leonardi, S.& Ventre, C. (2014) Utilitarian Mechanism Design for Multiobjective Optimization. SIAM Journal on Computing, vol. 43 (4) pp.1263-1290. » more details Fomin, F., Grandoni, F., Kratsch, D., Lokshtanov, D.& Saurabh, S. (2013) Computing Optimal Steiner Trees in Polynomial Space. Algorithmica, vol. 65 (3) pp.584-604. » more details Petrillo, U., Grandoni, F.& Italiano, G. (2013) Data structures resilient to memory faults: An experimental study of dictionaries. Journal of Experimental Algorithmics, vol. 18. » more details Byrka, J., Grandoni, F., Rothvoß, T.& Sanità, L. (2013) Steiner Tree Approximation via Iterative Randomized Rounding. Journal of the ACM, vol. 60 (1) pp.6-6. » more details Fomin, F., Grandoni, F., Lokshtanov, D.& Saurabh, S. (2012) Sharp Separation and Applications to Exact and Parameterized Algorithms. Algorithmica, vol. 63 (3) pp.692-706. » more details Berger, A., Bonifaci, V., Grandoni, F.& Schäfer, G. (2011) Budgeted matching and budgeted matroid intersection via the gasoline puzzle. Mathematical Programming, vol. 128 (1-2) pp.355-372. » more details Grandoni, F., Rothvoß, T.& Sanità, L. (2011) From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk. Journal of Mathematics of Operations Research, vol. 36 (2) pp.185-204. » more details Eisenbrand, F., Grandoni, F., Rothvoß, T.& Schäfer, G. (2010) Connected facility location via random facility sampling and core detouring. Journal of Computer and System Sciences, vol. 76 (8) pp.709-726. » more details De Santis, E., Grandoni, F.& Panconesi, A. (2010) Low degree connectivity of ad-hoc networks via percolation. Advances in Applied Probability, vol. 42 (2) pp.559-576. » more details Grandoni, F., Nicosia, G., Oriolo, G.& Sanità, L. (2010) Stable routing under the Spanning Tree Protocol. Operations Research Letters, vol. 38 (5) pp.399-404. » more details Finocchi, I., Grandoni, F.& Italiano, G. (2009) Resilient dictionaries. ACM Transactions on Algorithms, vol. 6 (1). » more details Diaz, J., Grandoni, F.& Marchetti-Spaccamela, A. (2009) Balanced cut approximation in random geometric graphs. Theoretical Computer Science, vol. 410 (27-29) pp.2725-2731. » more details Finocchi, I., Grandoni, F.& Italiano, G. (2009) Optimal resilient sorting and searching in the presence of memory faults. Theoretical Computer Science, vol. 410 (44) pp.4457-4470. » more details Fomin, F., Grandoni, F.& Kratsch, D. (2009) measure & conquer approach for the analysis of exact algorithms, A. Journal of the ACM, vol. 56 (5). » more details Fomin, F., Grandoni, F., Pyatkin, A.& Stepanov, A. (2008) Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications. ACM Transactions on Algorithms, vol. 5 (1). » more details Fomin, F., Grandoni, F.& Kratsch, D. (2008) Solving Connected Dominating Set Faster than 2^n. Algorithmica, vol. 52 (2) pp.153-166. » more details Grandoni, F., Könemann, J.& Panconesi, A. (2008) Distributed weighted vertex cover via maximal matchings. ACM Transactions on Algorithms, vol. 5 (1). » more details Grandoni, F., Kaibel, V., Oriolo, G.& Skutella, M. (2008) short proof of the VPN Tree Routing Conjecture on ring networks, A. Operations Research Letters, vol. 36 (3) pp.361-365. » more details Grandoni, F., Könemann, J., Panconesi, A.& Sozio, M. (2008) Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover, A. SIAM Journal on Computing, vol. 38 (3) pp.825-840. » more details Eisenbrand, F., Grandoni, F., Oriolo, G.& Skutella, M. (2007) New Approaches for Virtual Private Network Design. SIAM Journal of Computing, vol. 37 (3) pp.706-721. » more details Finocchi, I., Grandoni, F.& Italiano, G. (2007) Designing reliable algorithms in unreliable memories. Computer Science Review, vol. 1 (2) pp.77-87. » more details Chandran, L.& Grandoni, F. (2006) linear time algorithm to list the minimal separators of chordal graphs, A. Discrete Mathematics, vol. 306 (3) pp.351-358. » more details Grandoni, F. (2006) note on the complexity of minimum dominating set, A. Journal of Discrete Algorithms, vol. 4 (2) pp.209-214. » more details Fomin, F., Grandoni, F., Pyatkin, A.& Stepanov, A. (2005) On maximum number of minimal dominating sets in graphs. Electronic Notes in Discrete Mathematics, vol. 22 pp.157-162. » more details Chandran, L.& Grandoni, F. (2005) Refined memorization for vertex cover. Information Processing Letters, vol. 93 (3) pp.123-131. » more details Fomin, F., Grandoni, F.& Kratsch, D. (2005) Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms. Bulletin of the European Association for Theoretical Computer Science, vol. 87 pp.47-77. » more details Eisenbrand, F.& Grandoni, F. (2004) On the complexity of fixed parameter clique and dominating set. Theoretical Computer Science, vol. 326 (1-3) pp.57-67. » more details Eisenbrand, F.& Grandoni, F. (2003) Detecting directed 4-cycles still faster. Information Processing Letters, vol. 87 (1) pp.13-15. » more details

Thesis 1 Element

Grandoni, F. (2004) Exact Algorithms for Hard Graph Problems. University of Rome Tor Vergata. » more details

In charge of the following projects

Approximation algorithms for Netowrk Problems » more details New Approaches to network Design » more details