Fabrizio Grandoni
Fabrizio Grandoni
Professor, IDSIA, USI-SUPSI, Switzerland
Preverjeni e-poštni naslov na idsia.ch - Domača stran
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
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
Steiner tree approximation via iterative randomized rounding
J Byrka, F Grandoni, T Rothvoss, L Sanità
Journal of the ACM (JACM) 60 (1), 6, 2013
Measure and conquer: A simple O (2^0.288n) independent set algorithm
FV Fomin, F Grandoni, D Kratsch
SODA 6, 18-25, 2006
Measure and Conquer: Domination-A Case Study.
FV Fomin, F Grandoni, D Kratsch
ICALP 3580, 191-203, 2005
Subcubic equivalences between graph centrality problems, apsp, and diameter
A Abboud, F Grandoni, V Vassilevska Williams
ACM Transactions on Algorithms 19 (1), 1-30, 2023
On the complexity of fixed parameter clique and dominating set
F Eisenbrand, F Grandoni
Theoretical Computer Science 326 (1-3), 57-67, 2004
A note on the complexity of minimum dominating set
F Grandoni
Journal of Discrete Algorithms 4 (2), 209-214, 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
New approaches to multi-objective optimization
F Grandoni, R Ravi, M Singh, R Zenklusen
Mathematical Programming, 1-30, 2013
Some new techniques in design and analysis of exact (exponential) algorithms
FV Fomin, F Grandoni, D Kratsch
Bull. EATCS 87, 47-77, 2005
Solving Connected Dominating Set Faster than 2 n
FV Fomin, F Grandoni, D Kratsch
Algorithmica 52, 153-166, 2008
Refined memorization for vertex cover
L Sunil Chandran, F Grandoni
Information Processing Letters 93 (3), 125-131, 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
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
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
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
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
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
Distributed weighted vertex cover via maximal matchings
F Grandoni, J Könemann, A Panconesi
ACM Transactions on Algorithms (TALG) 5 (1), 6, 2008
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20