| 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 | 383 | 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 | 314 | 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 | 294 | 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 Automata, Languages and Programming: 32nd International Colloquium, ICALP …, 2005 | 181 | 2005 |
| On the complexity of fixed parameter clique and dominating set F Eisenbrand, F Grandoni Theoretical Computer Science 326 (1-3), 57-67, 2004 | 173 | 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 | 168 | 2014 |
| A note on the complexity of minimum dominating set F Grandoni Journal of Discrete Algorithms 4 (2), 209-214, 2006 | 162 | 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 | 149 | 2008 |
| New approaches to multi-objective optimization F Grandoni, R Ravi, M Singh, R Zenklusen Mathematical Programming, 1-30, 2013 | 121* | 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 | 108 | 2011 |
| Some new techniques in design and analysis of exact (exponential) algorithms FV Fomin, F Grandoni, D Kratsch Bull. EATCS 87, 47-77, 2005 | 107 | 2005 |
| Solving Connected Dominating Set Faster than 2 n FV Fomin, F Grandoni, D Kratsch Algorithmica 52, 153-166, 2008 | 96 | 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 | 87 | 2019 |
| Refined memorization for vertex cover L Sunil Chandran, F Grandoni Information Processing Letters 93 (3), 125-131, 2005 | 81* | 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 | 77 | 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 | 73 | 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 | 68 | 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 | 64 | 2012 |
| Improved approximation algorithms for stochastic matching M Adamczyk, F Grandoni, J Mukherjee Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015 | 62 | 2015 |
Fedor V. FominProfessor of Computer Science, University of Bergen在 uib.no 的电子邮件经过验证
