Fabrizio Grandoni

Cited by

	All	Since 2018
Citations	4424	1780
h-index	38	24
i10-index	74	55

480

240

120

360

200520062007200820092010201120122013201420152016201720182019202020212022202335 122 94 146 212 241 215 197 283 235 254 219 316 292 280 289 396 470 50

Public access

View all

43 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Dieter Kratschprofesseur d'informatique, Universite de LorraineVerified email at univ-lorraine.fr
Giuseppe F. ItalianoProfessor of Computer Science, LUISS University, Rome, ItalyVerified email at luiss.it
Thomas RothvossUniversity of WashingtonVerified email at math.mit.edu
Andreas WieseAdjoint ProfessorVerified email at dii.uchile.cl
Stefano LeonardiProfessor of Computer Science, Sapienza University of RomeVerified email at dis.uniroma1.it
Friedrich EisenbrandEPFLVerified email at epfl.ch
Laura SanitàAssociate Professor, Bocconi University of MilanVerified email at unibocconi.it
Jarek ByrkaUniversity of WroclawVerified email at cs.uni.wroc.pl
Irene FinocchiProfessor of Computer Science, LUISS University, Rome, ItalyVerified email at luiss.it
Alessandro PanconesiComputer Science - Sapienza, University of RomeVerified email at di.uniroma1.it
Virginia Vassilevska WilliamsMITVerified email at mit.edu
Arindam KhanAssistant Professor, Indian Institute of Science, BengaluruVerified email at iisc.ac.in
Waldo GálvezAssistant Professor at Institute of Engineering Sciences, Universidad de O'HigginsVerified email at uoh.cl
Marek CyganUniversity of WarsawVerified email at mimuw.edu.pl
Aris AnagnostopoulosProfessor of Computer Science at Sapienza University of RomeVerified email at diag.uniroma1.it
Guido SchäferCWIVerified email at cwi.nl
Piotr SankowskiIDEAS NCBR, MIM Solutions, Warsaw UniversityVerified email at mimuw.edu.pl
Mohit SinghAssociate Professor, Georgia Institute of TechnologyVerified email at gatech.edu
Chris SchwiegelshohnAarhus UniversityVerified email at cs.au.dk

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	350	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	286	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	254	2013
Measure and conquer: A simple O (2^0.288n) independent set algorithm FV Fomin, F Grandoni, D Kratsch SODA 6, 18-25, 2006	195	2006
Measure and Conquer: Domination-A Case Study. FV Fomin, F Grandoni, D Kratsch ICALP 3580, 191-203, 2005	182	2005
Subcubic equivalences between graph centrality problems, APSP and diameter A Abboud, F Grandoni, VV Williams ACM Transactions on Algorithms (TALG), 2022	150	2022
A note on the complexity of minimum dominating set F Grandoni Journal of Discrete Algorithms 4 (2), 209-214, 2006	150	2006
On the complexity of fixed parameter clique and dominating set F Eisenbrand, F Grandoni Theoretical Computer Science 326 (1-3), 57-67, 2004	150	2004
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	140	2008
Some new techniques in design and analysis of exact (exponential) algorithms FV Fomin, F Grandoni, D Kratsch Bull. EATCS 87, 47-77, 2005	104	2005
New approaches to multi-objective optimization F Grandoni, R Ravi, M Singh, R Zenklusen Mathematical Programming, 1-30, 2013	101*	2013
Solving Connected Dominating Set Faster than 2ⁿ FV Fomin, F Grandoni, D Kratsch Algorithmica 52, 153-166, 2008	93	2008
Refined memorization for vertex cover L Sunil Chandran, F Grandoni Information Processing Letters 93 (3), 125-131, 2005	75*	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	70	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	67	2008
Truly subcubic algorithms for language edit distance and RNA folding via fast bounded-difference min-plus product K Bringmann, F Grandoni, B Saha, VV Williams SIAM Journal on Computing 48 (2), 481-512, 2019	65	2019
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	61	2011
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	60	2012
Distributed weighted vertex cover via maximal matchings F Grandoni, J Könemann, A Panconesi ACM Transactions on Algorithms (TALG) 5 (1), 6, 2008	57	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	57	2008

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

Follow

Cited by

Co-authors