Fabrizio Grandoni

Cited by

	All	Since 2016
Citations	3626	1531
h-index	33	20
i10-index	60	43

340

170

255

2005200620072008200920102011201220132014201520162017201820192020202134 124 90 147 215 244 222 198 264 237 252 227 314 295 301 329 62

Co-authors

Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Giuseppe F. ItalianoProfessor of Computer Science, LUISS University, Rome, ItalyVerified email at luiss.it
Thomas RothvossUniversity of WashingtonVerified email at math.mit.edu
Dieter Kratschprofesseur d'informatique, Universite de LorraineVerified email at univ-lorraine.fr
Stefano LeonardiProfessor of Computer Science, Sapienza University of RomeVerified email at dis.uniroma1.it
Andreas WieseAdjoint ProfessorVerified email at dii.uchile.cl
Friedrich EisenbrandEPFLVerified email at epfl.ch
Irene FinocchiProfessor of Computer Science, LUISS University, Rome, ItalyVerified email at luiss.it
Laura SanitàAssociate Professor, C&O Department - University of WaterlooVerified email at uwaterloo.ca
Alessandro PanconesiComputer Science - Sapienza, University of RomeVerified email at di.uniroma1.it
Virginia Vassilevska WilliamsMITVerified email at mit.edu
Jarek ByrkaUniversity of WroclawVerified email at cs.uni.wroc.pl
Marek CyganUniversity of WarsawVerified email at mimuw.edu.pl
Guido SchäferCWIVerified email at cwi.nl
Aris AnagnostopoulosAssociate Professor of Computer Science, Sapienza University of RomeVerified email at dis.uniroma1.it
Piotr SankowskiComputer Science, Warsaw UniversityVerified email at mimuw.edu.pl
Mohit SinghAssociate Professor, Georgia Institute of TechnologyVerified email at gatech.edu
Rico ZenklusenETH ZurichVerified email at math.ethz.ch
Jochen KoenemannUniversity of WaterlooVerified email at uwaterloo.ca
Arindam KhanAssistant Professor, Indian Institute of Science, BengaluruVerified email at iisc.ac.in

Fabrizio Grandoni

Professor, IDSIA, USI-SUPSI, Switzerland

Verified email at idsia.ch - Homepage

Algorithms and Data Structures


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
An improved LP-based approximation for Steiner tree J Byrka, F Grandoni, T Rothvoß, L Sanita Proceedings of the forty-second ACM symposium on Theory of computing, 583-592, 2010	312	2010
A measure & conquer approach for the analysis of exact algorithms FV Fomin, F Grandoni, D Kratsch Journal of the ACM (JACM) 56 (5), 1-32, 2009	249	2009
Steiner tree approximation via iterative randomized rounding J Byrka, F Grandoni, T Rothvoss, L Sanità Journal of the ACM (JACM) 60 (1), 6, 2013	195	2013
Measure and conquer: A simple O (20. 288 n) independent set algorithm FV Fomin, F Grandoni, D Kratsch SODA 6, 18-25, 2006	182	2006
Measure and conquer: Domination–a case study FV Fomin, F Grandoni, D Kratsch International Colloquium on Automata, Languages, and Programming, 191-203, 2005	176	2005
A note on the complexity of minimum dominating set F Grandoni Journal of Discrete Algorithms 4 (2), 209-214, 2006	131	2006
Subcubic equivalences between graph centrality problems, APSP and diameter A Abboud, F Grandoni, VV Williams Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014	124	2014
Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications FV Fomin, F Grandoni, AV Pyatkin, AA Stepanov ACM Transactions on Algorithms (TALG) 5 (1), 9, 2008	124	2008
On the complexity of fixed parameter clique and dominating set F Eisenbrand, F Grandoni Theoretical Computer Science 326 (1-3), 57-67, 2004	121	2004
Some new techniques in design and analysis of exact (exponential) algorithms FV Fomin, F Grandoni, D Kratsch Bulletin of the EATCS 87 (47-77), 0-288, 2005	100	2005
New approaches to multi-objective optimization F Grandoni, R Ravi, M Singh, R Zenklusen Mathematical Programming, 1-30, 2013	96*	2013
Solving connected dominating set faster than 2 n FV Fomin, F Grandoni, D Kratsch Algorithmica 52 (2), 153-166, 2008	91	2008
Budgeted matching and budgeted matroid intersection via the gasoline puzzle A Berger, V Bonifaci, F Grandoni, G Schäfer Mathematical Programming 128 (1-2), 355-372, 2011	80	2011
Optimal resilient sorting and searching in the presence of memory faults I Finocchi, F Grandoni, GF Italiano Theoretical computer science 410 (44), 4457-4470, 2009	71	2009
Refined memorization for vertex cover L Sunil Chandran, F Grandoni Information Processing Letters 93 (3), 125-131, 2005	71*	2005
Approximating connected facility location problems via random facility sampling and core detouring F Eisenbrand, F Grandoni, T Rothvoß, G Schäfer Proceeding of Nineteenth annual ACM-SIAM Symposium (SODA'08), 1174-1183, 2008	61	2008
Resilient dictionaries I Finocchi, F Grandoni, GF Italiano ACM Transactions on Algorithms (TALG) 6 (1), 1-19, 2009	53*	2009
New approaches for virtual private network design F Eisenbrand, F Grandoni, G Oriolo, M Skutella SIAM Journal on Computing 37 (3), 706-721, 2008	53	2008
New approaches for virtual private network design F Eisenbrand, F Grandoni, G Oriolo, M Skutella SIAM Journal on Computing 37 (3), 706-721, 2007	53	2007
Improved distance sensitivity oracles via fast single-source replacement paths F Grandoni, VV Williams 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 748-757, 2012	51	2012

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors