Fabrizio Grandoni

Cited by

	All	Since 2020
Citations	5263	2021
h-index	41	25
i10-index	81	55

460

230

115

345

20052006200720082009201020112012201320142015201620172018201920202021202220232024202537 121 96 144 212 242 215 199 287 238 257 221 313 297 284 282 392 416 415 447 64

Public access

View all

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

Fabrizio Grandoni

Professor, IDSIA, USI-SUPSI, Switzerland

Verified email at idsia.ch - Homepage

Approximation Algorithms Combinatorial Optimization


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	395	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	326	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	315	2013
Measure and conquer: A simple O (2^0.288n) independent set algorithm FV Fomin, F Grandoni, D Kratsch SODA 6, 18-25, 2006	201	2006
Measure and conquer: Domination–a case study FV Fomin, F Grandoni, D Kratsch Automata, Languages and Programming: 32nd International Colloquium, ICALP …, 2005	182	2005
On the complexity of fixed parameter clique and dominating set F Eisenbrand, F Grandoni Theoretical Computer Science 326 (1-3), 57-67, 2004	181	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	172	2014
A note on the complexity of minimum dominating set F Grandoni Journal of Discrete Algorithms 4 (2), 209-214, 2006	167	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	150	2008
New approaches to multi-objective optimization F Grandoni, R Ravi, M Singh, R Zenklusen Mathematical Programming, 1-30, 2013	129*	2013
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	112	2011
Some new techniques in design and analysis of exact (exponential) algorithms FV Fomin, F Grandoni, D Kratsch Bull. EATCS 87, 47-77, 2005	108	2005
Solving Connected Dominating Set Faster than 2ⁿ FV Fomin, F Grandoni, D Kratsch Algorithmica 52, 153-166, 2008	97	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	94	2019
Refined memorization for vertex cover L Sunil Chandran, F Grandoni Information Processing Letters 93 (3), 125-131, 2005	85*	2005
Oblivious dimension reduction for k-means: beyond subspaces and the Johnson-Lindenstrauss lemma L Becchetti, M Bury, V Cohen-Addad, F Grandoni, C Schwiegelshohn Proceedings of the 51st annual ACM SIGACT symposium on theory of computing …, 2019	84	2019
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	74	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	70	2008
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	66	2012
Improved approximation algorithms for stochastic matching M Adamczyk, F Grandoni, J Mukherjee Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015	65	2015

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