Fabrizio Grandoni
Fabrizio Grandoni
Professor, IDSIA, USI-SUPSI, Switzerland
Verified email at idsia.ch - Homepage
TitleCited byYear
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
2842010
A measure & conquer approach for the analysis of exact algorithms
FV Fomin, F Grandoni, D Kratsch
Journal of the ACM (JACM) 56 (5), 25, 2009
2232009
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
1932006
Measure and conquer: domination–a case study
FV Fomin, F Grandoni, D Kratsch
International Colloquium on Automata, Languages, and Programming, 191-203, 2005
1762005
Steiner tree approximation via iterative randomized rounding
J Byrka, F Grandoni, T Rothvoss, L Sanità
Journal of the ACM (JACM) 60 (1), 6, 2013
1402013
A note on the complexity of minimum dominating set
F Grandoni
Journal of Discrete Algorithms 4 (2), 209-214, 2006
1262006
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
1142008
On the complexity of fixed parameter clique and dominating set
F Eisenbrand, F Grandoni
Theoretical Computer Science 326 (1-3), 57-67, 2004
1062004
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
992014
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
992005
Solving Connected Dominating Set Faster than 2 n
FV Fomin, F Grandoni, D Kratsch
Algorithmica 52 (2), 153-166, 2008
912008
New approaches to multi-objective optimization
F Grandoni, R Ravi, M Singh, R Zenklusen
Mathematical Programming, 1-30, 2013
82*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
682011
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
682009
Refined memorization for vertex cover
L Sunil Chandran, F Grandoni
Information Processing Letters 93 (3), 125-131, 2005
67*2005
Approximating connected facility location problems via random facility sampling and core detouring
F Eisenbrand, F Grandoni, T Rothvoß, G Schäfer
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete …, 2008
552008
Resilient dictionaries
I Finocchi, F Grandoni, GF Italiano
ACM Transactions on Algorithms (TALG) 6 (1), 1, 2009
52*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
522008
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
482010
Resilient search trees
I Finocchi, F Grandoni, GF Italiano
Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete …, 2007
482007
The system can't perform the operation now. Try again later.
Articles 1–20