Fabrizio Grandoni

Cited by

	All	Since 2015
Citations	3497	1664
h-index	33	23
i10-index	59	44

320

160

240

200520062007200820092010201120122013201420152016201720182019202043 124 88 147 212 246 223 195 270 230 251 227 318 300 302 263

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
Friedrich EisenbrandEPFLVerified email at epfl.ch
Andreas WieseAdjoint ProfessorVerified email at dii.uchile.cl
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
Jarek ByrkaUniversity of WroclawVerified email at cs.uni.wroc.pl
Virginia Vassilevska WilliamsMITVerified email at mit.edu
Marek CyganUniversity of WarsawVerified email at mimuw.edu.pl
Aris AnagnostopoulosAssociate Professor of Computer Science, Sapienza University of RomeVerified email at dis.uniroma1.it
Guido SchäferCWIVerified email at cwi.nl
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
L. Sunil ChandranProfessor of Computer Science and Automation, Indian Institute of Science, Bangalore, India.Verified 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 Sanità Proceedings of the forty-second ACM symposium on Theory of computing, 583-592, 2010	308	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	240	2009
Measure and conquer: a simple O (2 0.288 n) independent set algorithm FV Fomin, F Grandoni, D Kratsch Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006	181	2006
Steiner tree approximation via iterative randomized rounding J Byrka, F Grandoni, T Rothvoss, L Sanità Journal of the ACM (JACM) 60 (1), 6, 2013	180	2013
Measure and conquer: domination–a case study FV Fomin, F Grandoni, D Kratsch International Colloquium on Automata, Languages, and Programming, 191-203, 2005	174	2005
A note on the complexity of minimum dominating set F Grandoni Journal of Discrete Algorithms 4 (2), 209-214, 2006	128	2006
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	122	2008
On the complexity of fixed parameter clique and dominating set F Eisenbrand, F Grandoni Theoretical Computer Science 326 (1-3), 57-67, 2004	119	2004
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	116	2014
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	93*	2013
Solving Connected Dominating Set Faster than 2ⁿ FV Fomin, F Grandoni, D Kratsch Algorithmica 52 (2), 153-166, 2008	92	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	75	2011
Refined memorization for vertex cover L Sunil Chandran, F Grandoni Information Processing Letters 93 (3), 125-131, 2005	74*	2005
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	69	2009
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	59	2008
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
Resilient dictionaries I Finocchi, F Grandoni, GF Italiano ACM Transactions on Algorithms (TALG) 6 (1), 1-19, 2009	52*	2009
Connected facility location via random facility sampling and core detouring F Eisenbrand, F Grandoni, T Rothvoß, G Schäfer Journal of Computer and System Sciences 76 (8), 709-726, 2010	51	2010

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