RESEARCH & PUBLICATIONS RESEARCH INTERESTS My research is focused on the design and (mostly theoretical) analysis of algorithms and data structures to address a variety of problems (mainly related to network applications). My main sub-area of interest is polynomial-time approximation algorithms. I also work(ed) on polynomial-time exact algorithms and data structures, exact/parameterized exponential-time algorithms, and distributed algorithms. I currently have 79 publications (31 journals) with 56 coauthors. According to Google Scholar, my papers received over 1700 citations and my h-index is 23. PUBLICATIONS These are the preprints of some papers of mine. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. Journal Publications An LP-Rounding $2\sqrt{2}$-Approximation for Restricted Maximum Acyclic Subgraph. F. Grandoni, T. Kociumaka, and M. Wlodarczyk. Information Processing Letters. To appear. Utilitarian mechanism design for multi-objective optimization. F. Grandoni, P. Krysta, S. Leonardi, and C. Ventre. SIAM Journal on Computing, 43(4), 1263-1290, 2014. New approaches to multi-objective optimization. F. Grandoni, R. Ravi, M. Singh, and R. Zenklusen. Mathematical Programming, 146(1-2), 525-554, 2014. Steiner tree approximation via iterative randomized rounding. J. Byrka, F. Grandoni, T. Rothvoß, and L. Sanità. Journal of the ACM, 60(1), 2013. Data structures resilient to memory faults: an experimental study of dictionaries. U. Ferraro-Petrilllo, F. Grandoni, and G. F. Italiano. ACM Journal of Experimental Algorithms, 18, 2013. Computing optimal Steiner trees in polynomial space. F. V. Fomin, F. Grandoni, D. Kratsch, D. Lokshtanov, and S. Saurabh. Algorithmica, 65(3): 584-604, 2013. Set covering with our eyes closed. F. Grandoni, A. Gupta, S. Leonardi, P. Miettinen, P. Sankowski, M. Singh. SIAM Journal on Computing, 42(3): 808-830, 2013. Sharp separation and applications to exact and parameterized algorithms. F. V. Fomin, F. Grandoni, D. Lokshtanov, and S. Saurabh. Algorithmica, 63(3): 692-706, 2012. Budgeted matching and budgeted matroid intersection via the gasoline puzzle. A. Berger, V. Bonifaci, F. Grandoni, and G. Schäfer. Mathematical Programming, 128(1-2): 355-372, 2011. From uncertainty to non-linearity: Solving virtual private network via single-sink buy-at-bulk. F. Grandoni, T. Rothvoß, and L. Sanità. Mathematics of Operations Research, 36(2): 185-204, 2011. Stable routing under the spanning tree protocol. F. Grandoni, G. Nicosia, G. Oriolo, and L. Sanità. Operations Research Letters, 38(5): 399-404, 2010. Low degree connectivity of ad-hoc networks via percolation. E. De Santis, F. Grandoni, and A. Panconesi. Advances in Applied Probability, 42(2): 559-576, 2010. Connected facility location via random facility sampling and core detouring. F. Eisenbrand, F. Grandoni, T. Rothvoß, and G. Schäfer. Journal of Computer and System Sciences, 76: 709-726, 2010. Balanced cut approximation in random geometric graphs. J. Diaz, F. Grandoni, and A. Marchetti-Spaccamela. Theoretical Computer Science, 410(27-29): 2725-2731, 2009. Resilient dictionaries. I. Finocchi, F. Grandoni, and G. F. Italiano. ACM Transactions on Algorithms, 6(1), 2009. Optimal resilient sorting and searching in the presence of dynamic memory faults. I. Finocchi, F. Grandoni, and G. F. Italiano. Theoretical Computer Science, 410(44): 4457--4470, 2009. Special issue devoted to the best papers of ICALP'06. A measure & conquer approach for the analysis of exact algorithms. F. V. Fomin, F. Grandoni, and D. Kratsch. Journal of the ACM 56(5), 2009. Solving connected dominating set faster than 2^n. F. V. Fomin, F. Grandoni, and D. Kratsch. Algorithmica, 52(2): 153-166, 2008. F. V. Fomin, F. Grandoni, A. V. Pyatkin, and A. A. Stepanov. ACM Transactions on Algorithms, 5(1), 2008. A short proof of the VPN tree routing conjecture on ring networks. F. Grandoni, V. Kaibel, G. Oriolo, and M. Skutella. Operations Research Letters, 36(3): 361-365, 2008. F. Grandoni, J. Könemann, and A. Panconesi. ACM Transactions on Algorithms, 5(1), 2008. A primal-dual bicriteria distributed algorithm for capacitated vertex cover.  F. Grandoni, J. Könemann, A. Panconesi, and M. Sozio. SIAM Journal on Computing, 38(3): 825-840, 2008. New approaches for virtual private network design. F. Eisenbrand, F. Grandoni, G. Oriolo, and M. Skutella. SIAM Journal on Computing, 37(3): 706-721, 2007. Designing reliable algorithms in unreliable memories. I. Finocchi, F. Grandoni, and G. F. Italiano. Computer Science Review, 1(2): 77-87, 2007. A linear time algorithm to list the minimal separators of chordal graphs. L. S. Chandran and F. Grandoni. Discrete Mathematics, 306(3): 351-358, 2006. A note on the complexity of minimum dominating set. F. Grandoni. Journal of Discrete Algorithms, 4(2): 209-214, 2006. . S. Chandran and F. Grandoni. Information Processing Letters, 93(3):123--131, 2005. Some new techniques in design and analysis of exact (exponential) algorithms. F.V. Fomin, F. Grandoni, and D. Kratsch. Bulletin of the European Association for Theoretical Computer Science 87:47--77, 2005. On the maximum number of minimal dominating sets in graphs. F. Fomin, F. Grandoni, A. Pyatkin, and A. A. Stepanov. Electronic Notes in Discrete Mathematics 22: 157-162, 2005. On the complexity of fixed parameter clique and dominating set. F. Eisenbrand and F. Grandoni. Theoretical Computer Science, 326(1-3): 57-67, 2004. Detecting directed 4-cycles still faster. F. Eisenbrand and F. Grandoni. Information Processing Letters, 87(1):13-15, 2003. Conference Publications Subcubic equivalences between graph centrality problems, APSP and Diameter. A. Abboud, F. Grandoni, and V. Vassilevska Williams. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2015. To appear. On survivable set connectivity. P. Chalermsook, F. Grandoni, and B. Laekhanukit. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2015. To appear. A Mazing 2+ε Approximation for Unsplittable Flow on a Path. A. Anagnostopoulos, F. Grandoni, S. Leonardi, and A. Wiese. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 26-41, 2014. Constant integrality gap LP formulations of unsplittable flow on a path. A. Anagnostopoulos, F. Grandoni, S. Leonardi, and A. Wiese. In Conference on Integer Programming and Combinatorial Optimization (IPCO), 25-36, 2013. M. Cygan, F. Grandoni, D. Hermelin. In European Symposium on Algorithms (ESA), 361-372, 2013. How to sell hyperedges: the hypermatching assignment problem. M. Cygan, F. Grandoni, and M. Mastrolilli. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 342-351, 2013. On pairwise spanners. M. Cygan, F. Grandoni, and K. Telikepalli. In Symposium on Theoretical Aspects of Computer Science (STACS), 209-220, 2013. M. Cygan, F. Grandoni, S. Leonardi, M. Pilipczuk, and P. Sankowski. In European Symposium on Algorithms (ESA), 349-360, 2012. F. Grandoni. In European Symposium on Algorithms (ESA), 527-538, 2012. Improved distance sensitivity oracles via fast single-source replacement paths. F. Grandoni and V. Vassilevska Williams. In IEEE Symposium on Foundations of Computer Science (FOCS), 748-757, 2012. Approximation algorithms for union and intersection covering problems. M. Cygan, F. Grandoni, S. Leonardi, M. Mucha, M. Pilipczuk, and P. Sankowski. In Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 28-40, 2011. Pricing on paths: a PTAS for the highway problem. F. Grandoni and T. Rothvoß. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 675-684, 2011. Approximation algorithms for single and multi-commodity connected facility location. F. Grandoni and T. Rothvoß. In Conference on Integer Programming and Combinatorial Optimization (IPCO), 248-260, 2011. Online network design with outliers. A. Anagnostopoulos, F. Grandoni, S. Leonardi, and P. Sankowski. In International Colloquium on Automata, Languages and Programming (ICALP), 114-126, 2010. An improved LP-based approximation for Steiner tree. J. Byrka,  F. Grandoni, T. Rothvoß, and L. Sanità. In ACM Symposium on Theory of Computing (STOC), 583-592, 2010. Best Paper Award. Data structures resilient to memory faults: an experimental study of dictionaries. U. Ferraro-Petrillo,  F. Grandoni, and G. F. Italiano. In International Symposium on Experimental Algorithms (SEA), 398-410, 2010. Sharp separation and applications to exact and parameterized algorithms. F. V. Fomin, F. Grandoni, D. Lokshtanov, and S. Saurabh. In Latin American Theoretical Informatics Symposium (LATIN), 72-83, 2010. Utilitarian mechanism design for multi-objective optimization. F. Grandoni, P. Krysta, S. Leonardi, and C. Ventre. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 573-584, 2010. Network design via core detouring for problems without a core. F. Grandoni and T. Rothvoß. In International Colloquium on Automata, Languages and Programming (ICALP), 490-502, 2010. F. Grandoni and R. Zenklusen. In European Symposium on Algorithms (ESA), 536-548, 2010. F. Grandoni, R. Ravi, and M. Singh. In European Symposium on Algorithms (ESA), 95-106, 2009. A. Berger, V. Bonifaci, F. Grandoni, and G. Schäfer. In Conference on Integer Programming and Combinatorial Optimization (IPCO), 273-287, 2008. Approximating connected facility location problems via random facility sampling and core detouring. F. Eisenbrand, F. Grandoni, T. Rothvoß, and G. Schäfer. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 1174-1183, 2008. Faster Steiner tree computation in polynomial space. F. V. Fomin, F. Grandoni, and D. Kratsch. In European Symposium on Algorithms (ESA), 430-441, 2008. Set covering with our eyes closed. F. Grandoni, A. Gupta, S. Leonardi, P. Miettinen, P. Sankowski, M. Singh. In IEEE Symposium on Foundations of Computer Science (FOCS), 347-356, 2008. Optimal resilient dynamic dictionaries. G. S. Brodal, R. Fagerberg, I. Finocchi, F. Grandoni, G. F. Italiano, A. G. Jørgensen, G. Moruz, and T. Mølhave. In European Symposium on Algorithms (ESA), 347-358, 2007. Fast low degree connectivity of ad-hoc networks via percolation. E. De Santis, F. Grandoni, and A. Panconesi. In European Symposium on Algorithms (ESA), 206-217, 2007. Resilient search trees. I. Finocchi, F. Grandoni, and G. F. Italiano. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 547-555, 2007. Balanced cut approximation in random geometric graphs. J. Diaz, F. Grandoni, and A. Marchetti-Spaccamela. In International Symposium on Algorithms and Computation (ISAAC), 527-536, 2006. Optimal resilient sorting and searching in the presence of memory faults. I. Finocchi, F. Grandoni, and G. F. Italiano. In International Colloquium on Automata, Languages and Programming (ICALP), 286-298, 2006. Measure and conquer: a simple O(2^{0.288 n}) independent set algorithm. F. Fomin, F. Grandoni, and D. Kratsch. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 18-25, 2006. Solving connected dominating set faster than 2^n. F. Fomin, F. Grandoni, and D. Kratsch. In Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 152-163, 2006. Algorithms and constraint programming. F. Grandoni and G. F. Italiano. In Principles and Practice of Constraint Programming (CP), 2-14, 2006. Improved approximation for single-sink buy-at-bulk. F. Grandoni and G. F. Italiano. In International Symposium on Algorithms and Computation (ISAAC), 111-120, 2006. An improved approximation algorithm for virtual private network design. F. Eisenbrand and F. Grandoni. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 928--932, 2005. New approaches for virtual private network design. F. Eisenbrand, F. Grandoni, G. Oriolo, and M. Skutella. In International Colloquium on Automata, Languages and Programming (ICALP), 1151-1162, 2005. Designing reliable algorithms in unreliable memories. I. Finocchi, F. Grandoni, and G. F. Italiano. In European Symposium on Algorithms (ESA), 1-8, 2005. Measure and conquer: domination - a case study. F. Fomin, F. Grandoni, and D. Kratsch. In International Colloquium on Automata, Languages and Programming (ICALP), 191-203, 2005. Bounding the number of minimal dominating sets: a measure and conquer approach. F. Fomin, F. Grandoni, A. Pyatkin, and A. A. Stepanov. In International Symposium on Algorithms and Computation (ISAAC), 573-582, 2005. Distributed weighted vertex cover via maximal matchings. F. Grandoni, J. Könemann, and A. Panconesi. In International Computing and Combinatorics Conference (COCOON), 839-848, 2005. F. Grandoni, J. Könemann, A. Panconesi, and M. Sozio. In ACM Symposium on Principles of Distributed Computing (PODC), 118-125, 2005. . S. Chandran and F. Grandoni. In International Workshop on Parameterized  and Exact Computation (IWPEC), 61-70, 2004. Decremental clique problem. F. Grandoni and G. F. Italiano. In International Workshop on Graph-Theoretic Concepts in Computer Science (WG), 142-153, 2004. Improved algorithms for max-restricted path consistency. F. Grandoni and G. F. Italiano. In International Workshop on Graph-Theoretic Concepts in Computer Science (WG), 142-153, 2004. Other Publications Exact algorithms for maximum independent set. F. Grandoni. Entry of Encyclopedia of Algorithms. To appear. Exact algorithms for dominating set. F. V. Fomin, F. Grandoni, and D. Kratsch. Entry of Encyclopedia of Algorithms, 2008. Distributed approximation algorithms via LP-duality and randomization. D. Dubhashi, F. Grandoni, and A. Panconesi. Chapter 13 of “Handbook of Approximation Algorithms and Metaheuristics”. Taylor and Francis, 2007. Exact algorithms for hard graph problems. F. Grandoni. Ph.D. Thesis, Università di Roma Tor Vergata, Roma, Italy, March 2004.

 Updated 25/9/2014