Prof.
Fabrizio Grandoni Chair of Approximation Algorithms IDSIA, USISUPSI 
CONTACTSEmail: fabrizio "at" idsia "dot" chMail address: IDSIA, USISUPSI, Polo Universitarion Lugano, via la Santa 1, CH6962 LuganoViganello Office: Room 10, IDSIA, 3rd floor 
SHORT BIOI received a Master degree in Engineering (2000) and a Ph.D. in Computer Science (2004) from the University of Rome Tor Vergata. During my Ph.D. I visited MPII with a MarieCurie fellowship. After postdoc positions at MPII, University of Rome Sapienza and TU Berlin, in 2007 I joined the University of Rome Tor Vergata as an Assistant Professor. In 2011 I moved to IDSIA, USISUPSI, first as a Research Professor and then (from 2019) as a Professor. I made long visits (at least one month) at the University of Bergen (2006), EPFL (2008 and 2009), and Simons Institute for the Theory of Computing, Berkeley (2015 and 2016).I'm married with 2 children. Traveling is my second favorite activity. These are the (53) countries that I visited so far: Australia; Austria; Bahamas; Barbados; Belgium; BosniaHerzegovina; Canada; Chile; China; Croatia; Cuba; Czech Republic; Denmark, Egypt; Estonia; Finland; France; Germany; Great Britain; Greece; Hungary; Iceland; India; Ireland; Israel; Italy; Japan; Jordan; Latvia; Liechtenstein; Lithuania; Luxemburg; Malta; Monaco; Mongolia; Morocco; Netherlands; Norway; Peru; Poland; Portugal; Russia; San Marino; Seychelles; Slovenia; Spain; Sweden; Switzerland; Thailand; Tunisia; Turkey; USA; Vatican. 
RESEARCH INTERESTSMy research is focused on the design and (mostly theoretical) analysis of algorithms and data structures. My main area of research is approximation algorithms. I am also interested in efficient algorithms and data structures, dynamic algorithms, online algorithms, parameterized algorithms, and distributed algorithms. I currently have 110 publications (37 journals) with 97 coauthors. According to Google Scholar my papers received over 3500 citations and my hindex is 33. 
PRIZES and AWARDS

GRANTS and FELLOWSHIPSI'm currently the
In the past I had the following grants and fellowships:

TEACHINGSince 2019 I teach:

PC WORKI will, am or was the Chair of the following conferences: FUN16 (cochair), ESA20 (track A), HALG21. I will, am or was in the Steering Committee of the following conference: FUN (2018), HALG (20192022), ESA (20202024).
I will, am or was a PC member of the following 27 conferences: CIAC10, SWAT10, ESA11 (track A), APPROX11, MFCS11, SODA12, SWAT12, ICALP13 (Track A), WAOA13, FUN14, IPEC15, APPROX15, ICALP16 (Track A), SODA16, FSTTCS16, WAOA16, ESA16 (Track B), STOC16, ESA17 (Track A), SPAA17, SODA18, CSR18, APPROX18, FUN18, FOCS19, HALG20, SWAT20. 
SUPERVISION WORKI am or was the supervisor of the following Ph.D. students: Salvatore Ingala (20132017); Sumedha Uniyal (20132017); Waldo Galvez (20152019); Afrouz Jabal Ameli (2017). I hosted the following postdocs: Marek Cygan (2012); Bundit Laekhanukit (20142015); Arindam Khan (20152017); Krzysztof Sornat (2018); Sumedh Tirodkar (20182019); Kamyar Khodamoradi (20192020); Mohit Garg (2019). I hosted the following visiting Ph.D. students: Bundit Laekhanukit (2012); Joydeep Mukherijee (2014); Stefano Leucci (2015). 
REVIEWING WORK

(INVITED) TALKS and EVENTS ORGANIZATIONI was or will be an invited/plenary speaker at the following conferences and workshops: DIMACS/Princeton Approximation Algorithms (USA, 2011); ROBOKUM (Germany, 2012); ABC (Germany, 2016); ALGO (Austria, 2017); ICTCS (Italy, 2021). I organized the "7th Workshop on Flexible Network Design" in Lugano (Switzerland, 2014). I was invited to participate and give talks at workshops in the following places: Aussois (France, 2005); Bertinoro (Italy, 2005); Bertinoro (Italy, 2006); Kolkata (India, 2006); Dortmund (Germany, 2007); Warwick (Great Britain, 2008); Bertinoro (Italy, 2009); Pisa (Italy, 2009); Chicago (USA, 2009); Dagstuhl (Germany, 2010 twice); Rome (Italy, 2011); Holetown (Barbados, 2011); Warsaw (Poland, 2012); Cargese (France, 2013); Toronto (Canada, 2013); Lausanne (Switzerland, 2013); Bertinoro (Italy, 2014); Lugano (Switzerland, 2014); Warsaw (Poland, 2014); Berkeley (USA, 2015); Pittsburgh (USA, 2015); Bonn (Germany, 2015); Berkeley (USA, 2016); Amsterdam (Netherlands, 2016); Banff (Canada, 2017); Shonan (Japan, 2017); Berkeley (USA, 2017); Bonn (Germany, 2018); Bordeaux (France, 2018); Maryland (USA, 2018); Bertinoro (Italy, 2019); Cargese (France, 2019); Venezia (Italy, 2019). 
MISCELLANEAThese are a few articles in Italian newspapers that mention my work: Corriere della Sera 15092011, Sole 24 Ore 03082011, Sole 24 Ore 04082010, Corriere della Sera 29032010. I obtained the Italian Scientific Habilitation to Full Professorship in Computer Science for the Science Track (INF/01) in 2013, and for the Engineering Track (INGINF/05) in 2015. In 2010 I received a Letter
of Commendation (in Italian) of the Rector of the
University of Rome Tor Vergata for my scientific merits. I am a founding member of the Interest Group on Algorithmic Foundations of Information Technology (IGAFIT, 2014). I initiated and currently coorganize the IDSIA lunch seminars PIDSIA (Pizza at IDSIA). Since 2019 I belong to the network of "advocates" who help
to implement the recommendations
of the ad hoc committee to combat harassment and discrimination
at TCS conferences. 
PUBLICATIONSThese are the preprints of my published papers. 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 some cases, these works may not be reposted without the explicit permission of the copyright holder. JournalsFaster
replacement paths and distance sensitivity oracles.
F. Grandoni and V. Vassilevska Williams. ACM
Transactions on Algorithms, 16(1): 15:115:25, 2020. The matching augmentation problem: a 7/4approximation algorithm. J. Cheriyan, J. Dippel, F. Grandoni, A. Khan, and V.V. Narayan. Mathematical Programming, 182(1): 315354, 2020. Truly subcubic algorithms for language edit distance and RNAfolding via fast boundeddifference minplus product. K. Bringmann, F. Grandoni, B. Saha, and V. Vassilevska Williams. SIAM Journal on Computing, 48(2): 481512, 2019. Special issue devoted to the best papers of FOCS'16. A
mazing 2+ε
approximation for unsplittable flow on a path.
A. Anagnostopoulos, F. Grandoni, S. Leonardi, and A. Wiese.
ACM Transactions on Algorithms,
14(4): 55:155:23, 2018. Tight
kernel bounds for problems on graphs with small degeneracy.
M. Cygan, F. Grandoni, D. HermelinA. Anagnostopoulos, F.
Grandoni, S. Leonardi, and A. Wiese. ACM
Transactions on Algorithms, 13(3): 43:143:22, 2017.
Online network design with outliers. A. Anagnostopoulos, F. Grandoni, S. Leonardi, and P. Sankowski.Algorithmica, 76(1), 88109, 2016. Pricing on paths: a PTAS for the highway problem. F. Grandoni and T. Rothvoß. SIAM Journal on Computing, 45(2), 216231, 2016. An LProunding $2\sqrt{2}$approximation for restricted maximum acyclic subgraph. F. Grandoni, T. Kociumaka, and M. Wlodarczyk. Information Processing Letters, 115: 182185, 2015. Utilitarian mechanism design for multiobjective optimization. F. Grandoni, P. Krysta, S. Leonardi, and C. Ventre. SIAM Journal on Computing, 43(4), 12631290, 2014. New approaches to multiobjective optimization. F. Grandoni, R. Ravi, M. Singh, and R. Zenklusen. Mathematical Programming, 146(12): 525554, 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. FerraroPetrilllo, 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): 584604, 2013. Set covering with our eyes closed. F. Grandoni, A. Gupta, S. Leonardi, P. Miettinen, P. Sankowski, and M. Singh. SIAM Journal on Computing, 42(3): 808830, 2013. Sharp separation and applications to exact and parameterized algorithms. F. V. Fomin, F. Grandoni, D. Lokshtanov, and S. Saurabh. Algorithmica, 63(3): 692706, 2012. Budgeted matching and budgeted matroid intersection via the gasoline puzzle. A. Berger, V. Bonifaci, F. Grandoni, and G. Schäfer. Mathematical Programming, 128(12): 355372, 2011. From uncertainty to nonlinearity: Solving virtual private network via singlesink buyatbulk. F. Grandoni, T. Rothvoß, and L. Sanità. Mathematics of Operations Research, 36(2): 185204, 2011. Stable routing under the spanning tree protocol. F. Grandoni, G. Nicosia, G. Oriolo, and L. Sanità. Operations Research Letters, 38(5): 399404, 2010. Low degree connectivity of adhoc networks via percolation. E. De Santis, F. Grandoni, and A. Panconesi. Advances in Applied Probability, 42(2): 559576, 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: 709726, 2010. Balanced cut approximation in random geometric graphs. J. Diaz, F. Grandoni, and A. MarchettiSpaccamela. Theoretical Computer Science, 410(2729): 27252731, 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): 44574470, 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. EATCSIPEC Nerode Prize. Solving connected dominating set faster than 2^n. F. V. Fomin, F. Grandoni, and D. Kratsch. Algorithmica, 52(2): 153166, 2008. Combinatorial bounds via measure and conquer: bounding minimal dominating sets and applications. 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): 361365, 2008. Distributed weighted vertex cover via maximal matchings. F. Grandoni, J. Könemann, and A. Panconesi. ACM Transactions on Algorithms, 5(1), 2008. A primaldual bicriteria distributed algorithm for capacitated vertex cover. F. Grandoni, J. Könemann, A. Panconesi, and M. Sozio. SIAM Journal on Computing, 38(3): 825840, 2008. New
approaches for virtual private network design.
F. Eisenbrand, F. Grandoni, G. Oriolo, and M. Skutella. SIAM
Journal on Computing, 37(3): 706721, 2007. Designing reliable algorithms in unreliable memories. I. Finocchi, F. Grandoni, and G. F. Italiano. Computer Science Review, 1(2): 7787, 2007. A linear time algorithm to list the minimal separators of chordal graphs. L. S. Chandran and F. Grandoni. Discrete Mathematics, 306(3): 351358, 2006. A note on the complexity of minimum dominating set. F. Grandoni. Journal of Discrete Algorithms, 4(2): 209214, 2006. Refined memorization for vertex cover. L. S. Chandran and F. Grandoni. Information Processing Letters, 93(3):123131, 2005. A tight (3/2+)ome 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:4777, 2005. On the complexity of fixed parameter clique and dominating set. F. Eisenbrand and F. Grandoni. Theoretical Computer Science, 326(13): 5767, 2004. Detecting directed 4cycles still faster. F. Eisenbrand and F. Grandoni. Information Processing Letters, 87(1):1315, 2003. ConferencesOnline
Edge Coloring Algorithms via the Nibble Method.
S. Bhattacharya, F. Grandoni, D.
Wajc. ACMSIAM
Symposium on Discrete Algorithms (SODA), 2021. To appear. Allpairs
LCA in DAGs: breaking through the O(n^2.5) barrier.
F. Grandoni, G.
Italiano, A. Lukasiewicz, N. Parotsidis, P. Uznanski. ACMSIAM
Symposium on Discrete Algorithms (SODA), 2021. To appear. A
tight (3/2+ε)
approximation for skewed strip packing.
W. Galvez, F. Grandoni, A. Jabal Ameli, K. Jansen, A. Khan, M.
Rau. APPROX/RANDOM,
44:144:18, 2020. Breaching
the 2approximation barrier for connectivity augmentation: a
reduction to Steiner tree. J. Byrka, F. Grandoni,
A. Jabal Ameli. ACM
Symposium on Theory of Computing (STOC), 815825, 2020. On
the cycle augmentation problem: hardness and approximation
algorithms. W. Galvez, F. Grandoni, A. Jabal
Ameli, and K. Sornat. Workshop
on Approximation and Online Algorithms (WAOA),
138153, 2019. Parameterized
approximation schemes for independent set of rectangles and
geometric knapsack. F. Grandoni, S. Kratsch, and
A. Wiese. European
Symposium on Algorithms (ESA), 53:153:16,
2019. Packing
cars into narrow roads: PTASs for limited supply highway.
F. Grandoni and A. Wiese. European
Symposium on Algorithms (ESA), 54:154:14, 2019. Dynamic set cover: improved algorithms and lower bounds. A. Abboud, R. Addanki, F. Grandoni, D. Panigrahi, B. Saha. ACM Symposium on Theory of Computing (STOC), 114125, 2019. Oblivious dimension reduction for kmeans: beyond subspaces and the JohnsonLindenstrauss lemma. L. Becchetti, M. Bury, V. CohenAddad, F. Grandoni, C. Schwiegelshohn. ACM Symposium on Theory of Computing (STOC), 10391050, 2019. O(log^2 k/loglog k) approximation algorithm for directed Steiner tree: a tight quasipolynomialtime algorithm. F. Grandoni, B. Laekhanukit, S. Li. ACM Symposium on Theory of Computing (STOC), 253264, 2019. (1+ε)Approximate incremental matching in constant deterministic amortized time. F. Grandoni, S. Leonardi, P. Sankowski, C. Schwiegelshohn, S. Solomon. ACMSIAM Symposium on Discrete Algorithms (SODA), 18861898, 2019. Improved approximation for tree augmentation: saving by rewiring. F. Grandoni, C. Kalaitzis, and R. Zenklusen. ACM Symposium on Theory of Computing (STOC), 632645, 2018. A (5/3+ε)approximation for unsplittable flow on a path: placing small tasks into boxes. F. Grandoni, T. Mömke, A. Wiese, and H. Zhou. ACM Symposium on Theory of Computing (STOC), 607619, 2018. Approximating geometric knapsack via Lpackings. W. Galvez, F. Grandoni, S. Heydrich, S. Ingala, and A. Khan, A. Wiese. IEEE Symposium on Foundations of Computer Science (FOCS), 260271, 2017. Preserving distances in very faulty graphs. G. Bodwin, F. Grandoni, M. Parter, and V. Vassilevska Williams. International Colloquium on Automata, Languages and Programming (ICALP), 73:173:14, 2017. When the optimum is also blind: a new perspective on universal optimization. M. Adamczyk, F. Grandoni, S. Leonardi, and M. Wlodarczyk. International Colloquium on Automata, Languages and Programming (ICALP), 35:135:15, 2017. Surviving in directed graphs: a quasipolynomialtime polylogarithmic approximation for twoconnected directed Steiner tree. F. Grandoni and B. Laekhanukit. ACM Symposium on Theory of Computing (STOC), 420428, 2017. To augment or not to augment: solving unsplittable flow on a path by creating slack. F. Grandoni, T. Mömke, A. Wiese, and H. Zhou. ACMSIAM Symposium on Discrete Algorithms (SODA), 24112422, 2017. Improved pseudopolynomialtime approximation for strip packing. W. Galvez, F. Grandoni, S. Ingala, and A. Khan. Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 9:19:14, 2016. Truly subcubic algorithms for language edit distance and RNAfolding via fast boundeddifference minplus product. K. Bringmann, F. Grandoni, B. Saha, and V. Vassilevska Williams. IEEE Symposium on Foundations of Computer Science (FOCS), 375384, 2016. Improved approximation algorithms for unsplittable flow on a path with time windows. F. Grandoni, S. Ingala, and S. Uniyal. Workshop on Approximation and Online Algorithms (WAOA), 1324, 2015. Improved purely additive faulttolerant spanners. D. Bilò, F. Grandoni, L. Gualà, S. Leucci, and G. Proietti. European Symposium on Algorithms (ESA), 167178, 2015. Improved approximation algorithms for stochastic matching. M. Adamczyk, F. Grandoni, and J. Mukherjee. European Symposium on Algorithms (ESA), 112, 2015. On conflictfree multicoloring. A. Bärtschi and F. Grandoni. Algorithms and Data Structures Symposium (WADS), 103114, 2015. Subcubic equivalences between graph centrality problems, APSP and Diameter. A. Abboud, F. Grandoni, and V. Vassilevska Williams. ACMSIAM Symposium on Discrete Algorithms (SODA), 16811697, 2015. On survivable set connectivity. P. Chalermsook, F. Grandoni, and B. Laekhanukit. ACMSIAM Symposium on Discrete Algorithms (SODA), 2536, 2015. A Mazing 2+ε Approximation for Unsplittable Flow on a Path. A. Anagnostopoulos, F. Grandoni, S. Leonardi, and A. Wiese. ACMSIAM Symposium on Discrete Algorithms (SODA), 2641, 2014. Constant integrality gap LP formulations of unsplittable flow on a path. A. Anagnostopoulos, F. Grandoni, S. Leonardi, and A. Wiese. Conference on Integer Programming and Combinatorial Optimization (IPCO), 2536, 2013. Tight kernel bounds for problems on graphs with small degeneracy  (Extended Abstract). M. Cygan, F. Grandoni, D. Hermelin. European Symposium on Algorithms (ESA), 361372, 2013. How to sell hyperedges: the hypermatching assignment problem. M. Cygan, F. Grandoni, and M. Mastrolilli. ACMSIAM Symposium on Discrete Algorithms (SODA), 342351, 2013. On pairwise spanners. M. Cygan, F. Grandoni, and K. Telikepalli. Symposium on Theoretical Aspects of Computer Science (STACS), 209220, 2013. A pathdecomposition theorem with applications to pricing and covering on trees. M. Cygan, F. Grandoni, S. Leonardi, M. Pilipczuk, and P. Sankowski. European Symposium on Algorithms (ESA), 349360, 2012. On minpower Steiner tree. F. Grandoni. European Symposium on Algorithms (ESA), 527538, 2012. Improved distance sensitivity oracles via fast singlesource replacement paths. F. Grandoni and V. Vassilevska Williams. In IEEE Symposium on Foundations of Computer Science (FOCS), 748757, 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), 2840, 2011. Pricing on paths: a PTAS for the highway problem. F. Grandoni and T. Rothvoß. In ACMSIAM Symposium on Discrete Algorithms (SODA), 675684, 2011. Approximation algorithms for single and multicommodity connected facility location. F. Grandoni and T. Rothvoß. Conference on Integer Programming and Combinatorial Optimization (IPCO), 248260, 2011. Online network design with outliers. A. Anagnostopoulos, F. Grandoni, S. Leonardi, and P. Sankowski. International Colloquium on Automata, Languages and Programming (ICALP), 114126, 2010. An improved LPbased approximation for Steiner tree. J. Byrka, F. Grandoni, T. Rothvoß, and L. Sanità. ACM Symposium on Theory of Computing (STOC), 583592, 2010. Best Paper Award. Data structures resilient to memory faults: an experimental study of dictionaries. U. FerraroPetrillo, F. Grandoni, and G. F. Italiano. International Symposium on Experimental Algorithms (SEA), 398410, 2010. Sharp separation and applications to exact and parameterized algorithms. F. V. Fomin, F. Grandoni, D. Lokshtanov, and S. Saurabh. Latin American Theoretical Informatics Symposium (LATIN), 7283, 2010. Utilitarian mechanism design for multiobjective optimization. F. Grandoni, P. Krysta, S. Leonardi, and C. Ventre. ACMSIAM Symposium on Discrete Algorithms (SODA), 573584, 2010. Network design via core detouring for problems without a core. F. Grandoni and T. Rothvoß. International Colloquium on Automata, Languages and Programming (ICALP), 490502, 2010. Approximation schemes for multibudgeted independence systems. F. Grandoni and R. Zenklusen. European Symposium on Algorithms (ESA), 536548, 2010. Iterative rounding for multiobjective optimization problems. F. Grandoni, R. Ravi, and M. Singh. European Symposium on Algorithms (ESA), 95106, 2009. Budgeted matching and budgeted matroid intersection via the gasoline puzzle. A. Berger, V. Bonifaci, F. Grandoni, and G. Schäfer. Conference on Integer Programming and Combinatorial Optimization (IPCO), 273287, 2008. Approximating connected facility location problems via random facility sampling and core detouring. F. Eisenbrand, F. Grandoni, T. Rothvoß, and G. Schäfer. ACMSIAM Symposium on Discrete Algorithms (SODA), 11741183, 2008. Faster Steiner tree computation in polynomial space. F. V. Fomin, F. Grandoni, and D. Kratsch. European Symposium on Algorithms (ESA), 430441, 2008. Set covering with our eyes closed. F. Grandoni, A. Gupta, S. Leonardi, P. Miettinen, P. Sankowski, M. Singh. IEEE Symposium on Foundations of Computer Science (FOCS), 347356, 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. European Symposium on Algorithms (ESA), 347358, 2007. Fast low degree connectivity of adhoc networks via percolation. E. De Santis, F. Grandoni, and A. Panconesi. European Symposium on Algorithms (ESA), 206217, 2007. Resilient search trees. I. Finocchi, F. Grandoni, and G. F. Italiano. ACMSIAM Symposium on Discrete Algorithms (SODA), 547555, 2007. Balanced cut approximation in random geometric graphs. J. Diaz, F. Grandoni, and A. MarchettiSpaccamela. International Symposium on Algorithms and Computation (ISAAC), 527536, 2006. Optimal resilient sorting and searching in the presence of memory faults. I. Finocchi, F. Grandoni, and G. F. Italiano. International Colloquium on Automata, Languages and Programming (ICALP), 286298, 2006. Measure and conquer: a simple O(2^{0.288 n}) independent set algorithm. F. Fomin, F. Grandoni, and D. Kratsch. ACMSIAM Symposium on Discrete Algorithms (SODA), 1825, 2006. Solving connected dominating set faster than 2^n. F. Fomin, F. Grandoni, and D. Kratsch. Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 152163, 2006. Algorithms and constraint programming. F. Grandoni and G. F. Italiano. Principles and Practice of Constraint Programming (CP), 214, 2006. Improved approximation for singlesink buyatbulk. F. Grandoni and G. F. Italiano. International Symposium on Algorithms and Computation (ISAAC), 111120, 2006. An improved approximation algorithm for virtual private network design. F. Eisenbrand and F. Grandoni. ACMSIAM Symposium on Discrete Algorithms (SODA), 928932, 2005. New approaches for virtual private network design. F. Eisenbrand, F. Grandoni, G. Oriolo, and M. Skutella. International Colloquium on Automata, Languages and Programming (ICALP), 11511162, 2005. Designing reliable algorithms in unreliable memories. I. Finocchi, F. Grandoni, and G. F. Italiano. European Symposium on Algorithms (ESA), 18, 2005. Measure and conquer: domination  a case study. F. Fomin, F. Grandoni, and D. Kratsch. International Colloquium on Automata, Languages and Programming (ICALP), 191203, 2005. Bounding the number of minimal dominating sets: a measure and conquer approach. F. Fomin, F. Grandoni, A. Pyatkin, and A. A. Stepanov. International Symposium on Algorithms and Computation (ISAAC), 573582, 2005. Distributed weighted vertex cover via maximal matchings. F. Grandoni, J. Könemann, and A. Panconesi. International Computing and Combinatorics Conference (COCOON), 839848, 2005. Primaldual based distributed algorithms for vertex cover with semihard capacities. F. Grandoni, J. Könemann, A. Panconesi, and M. Sozio. ACM Symposium on Principles of Distributed Computing (PODC), 118125, 2005. Refined memorisation for vertex cover. L.S. Chandran and F. Grandoni. International Workshop on Parameterized and Exact Computation (IWPEC), 6170, 2004. Decremental clique problem. F. Grandoni and G. F. Italiano. International Workshop on GraphTheoretic Concepts in Computer Science (WG), 142153, 2004. Improved algorithms for maxrestricted path consistency. F. Grandoni and G. F. Italiano. International Workshop on GraphTheoretic Concepts in Computer Science (WG), 142153, 2004. OtherExact algorithms for maximum independent set. F. Grandoni. Entry of Encyclopedia of Algorithms, 680683, 2016. Exact algorithms for dominating set. F. V. Fomin, F. Grandoni, and D. Kratsch. Entry of Encyclopedia of Algorithms, 2008. Distributed approximation algorithms via LPduality and randomization. D. Dubhashi, F. Grandoni, and A. Panconesi. Chapter 13 of “Handbook of Approximation Algorithms and Metaheuristics”. Taylor and Francis, 2007. 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: 157162, 2005. Exact algorithms for hard graph problems. F. Grandoni. Ph.D. Thesis. University of Rome Tor Vergata. 2004.

updated 15th January 2021 