- Home
- Best Scientists - Computer Science
- Fabrizio Grandoni

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
31
Citations
4,122
142
World Ranking
9890
National Ranking
182

- Algorithm
- Combinatorics
- Discrete mathematics

His primary areas of study are Discrete mathematics, Algorithm, Combinatorics, Dominating set and Approximation algorithm. The concepts of his Algorithm study are interwoven with issues in Binary logarithm and Measure. The various areas that he examines in his Measure study include Upper and lower bounds, Bounded function and Backtracking.

His Combinatorics study combines topics in areas such as k-minimum spanning tree and Single node. His Dominating set research incorporates elements of Improved algorithm, Graph theory, Ordered set and Exact algorithm. Fabrizio Grandoni has researched Approximation algorithm in several fields, including Randomized algorithm, Combinatorial optimization, Matroid and Steiner tree problem.

- An improved LP-based approximation for steiner tree (241 citations)
- A measure & conquer approach for the analysis of exact algorithms (201 citations)
- Steiner Tree Approximation via Iterative Randomized Rounding (163 citations)

His primary scientific interests are in Combinatorics, Discrete mathematics, Approximation algorithm, Algorithm and Mathematical optimization. His study in Discrete mathematics is interdisciplinary in nature, drawing from both k-minimum spanning tree and Graph. His Approximation algorithm research is multidisciplinary, relying on both Network planning and design, Combinatorial optimization and Steiner tree problem.

The Algorithm study combines topics in areas such as Measure, Upper and lower bounds and Bounded function. In the subject of general Mathematical optimization, his work in Optimization problem, Minimum-cost flow problem and Flow network is often linked to Bandwidth allocation, thereby combining diverse domains of study. The study incorporates disciplines such as Graph theory and Exact algorithm in addition to Dominating set.

- Combinatorics (50.99%)
- Discrete mathematics (39.07%)
- Approximation algorithm (38.41%)

- Combinatorics (50.99%)
- Approximation algorithm (38.41%)
- Algorithm (23.18%)

Fabrizio Grandoni mostly deals with Combinatorics, Approximation algorithm, Algorithm, Reduction and Constant. His research integrates issues of Bounded function and Knapsack problem in his study of Combinatorics. His studies deal with areas such as Tree, Discrete mathematics, Steiner tree problem and Interval as well as Approximation algorithm.

Particularly relevant to Graph is his body of work in Discrete mathematics. His Algorithm research is multidisciplinary, incorporating elements of Degree and Conjecture. His work carried out in the field of Reduction brings together such families of science as Cover and Graph.

- Oblivious dimension reduction for k-means: beyond subspaces and the Johnson-Lindenstrauss lemma (17 citations)
- Dynamic set cover: improved algorithms and lower bounds (15 citations)
- O(log2k / log log k)-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithm (14 citations)

- Algorithm
- Combinatorics
- Time complexity

His main research concerns Combinatorics, Graph, Approximation algorithm, Algorithm and Matching. In his works, Fabrizio Grandoni undertakes multidisciplinary study on Combinatorics and High probability. Tree, Network planning and design and Discrete mathematics is closely connected to Reduction in his research, which is encompassed under the umbrella topic of Graph.

His Approximation algorithm study combines topics from a wide range of disciplines, such as Tree and Steiner tree problem. He combines subjects such as Cardinality and Upper and lower bounds with his study of Algorithm. He has included themes like Dynamic problem, Set cover problem, Complement and Randomized algorithm in his Upper and lower bounds study.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

An improved LP-based approximation for steiner tree

Jaroslaw Byrka;Fabrizio Grandoni;Thomas Rothvoß;Laura Sanità.

symposium on the theory of computing **(2010)**

342 Citations

A measure & conquer approach for the analysis of exact algorithms

Fedor V. Fomin;Fabrizio Grandoni;Dieter Kratsch.

Journal of the ACM **(2009)**

278 Citations

Steiner Tree Approximation via Iterative Randomized Rounding

Jarosław Byrka;Fabrizio Grandoni;Thomas Rothvoss;Laura Sanità.

Journal of the ACM **(2013)**

243 Citations

Measure and conquer: a simple O(20.288n) independent set algorithm

Fedor V. Fomin;Fabrizio Grandoni;Dieter Kratsch.

symposium on discrete algorithms **(2006)**

190 Citations

Measure and conquer: domination – a case study

Fedor V. Fomin;Fabrizio Grandoni;Dieter Kratsch.

international colloquium on automata languages and programming **(2005)**

183 Citations

Resilient dictionaries

Irene Finocchi;Fabrizio Grandoni;Giuseppe F. Italiano.

ACM Transactions on Algorithms **(2009)**

173 Citations

On the complexity of fixed parameter clique and dominating set

Friedrich Eisenbrand;Fabrizio Grandoni.

Theoretical Computer Science **(2004)**

146 Citations

A note on the complexity of minimum dominating set

Fabrizio Grandoni.

Journal of Discrete Algorithms **(2006)**

144 Citations

Subcubic equivalences between graph centrality problems, APSP and diameter

Amir Abboud;Fabrizio Grandoni;Virginia Vassilevska Williams.

symposium on discrete algorithms **(2015)**

138 Citations

Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications

Fedor V. Fomin;Fabrizio Grandoni;Artem V. Pyatkin;Alexey A. Stepanov.

ACM Transactions on Algorithms **(2008)**

135 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Guido Carli Free International University for Social Studies

Sapienza University of Rome

University of Bergen

University of Lorraine

Sapienza University of Rome

Institute of Mathematical Sciences

Technical University of Berlin

University of California, Santa Barbara

Carnegie Mellon University

Carnegie Mellon University

Imperial College London

New Jersey Institute of Technology

University of Malaya

University of Minnesota

University of Oklahoma

United States Geological Survey

University of the West of England

Karolinska Institute

Liverpool John Moores University

Philipp University of Marburg

Northwestern University

Cincinnati Children's Hospital Medical Center

Hudson Institute of Medical Research

London School of Hygiene & Tropical Medicine

Queen's University

Kyoto University

Something went wrong. Please try again later.