2026 Fabrizio Grandoni: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	38	10343	10052	183	182	158	5354

Overview

Fabrizio Grandoni is affiliated with the Dalle Molle Institute for Artificial Intelligence Research in Switzerland. Their research focuses primarily within the fields of Computer Science and Engineering.

The main fields of study covered in their publications include:

Computer Science
Engineering

The subfields of study in which they have contributed are:

Computational Theory and Mathematics
Computer Networks and Communications
Industrial and Manufacturing Engineering
Computer Graphics and Computer-Aided Design
Artificial Intelligence

Grandoni's work spans several key topics, including:

Complexity and Algorithms in Graphs
Optimization and Search Problems
Advanced Graph Theory Research
Optimization and Packing Problems
Computational Geometry and Mesh Generation
Interconnection Networks and Systems
Vehicle Routing Optimization Methods

They have authored papers in various publication venues. The most frequent venues are:

arXiv (Cornell University)
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
ACM Transactions on Algorithms
SIAM Journal on Computing
Theory of Computing Systems

Selected recent papers by Fabrizio Grandoni include:

"Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More" (2021), published at Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
"Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter" (2022), published in ACM Transactions on Algorithms
"O(log²k/log log k)-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm" (2022), published in SIAM Journal on Computing
"Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree" (2023), published in SIAM Journal on Computing
"Fully Dynamic (Δ +1)-Coloring in O(1) Update Time" (2022), published in ACM Transactions on Algorithms

Frequent collaborators of Fabrizio Grandoni include:

Afrouz Jabal Ameli (13 coauthored works)
Waldo Gálvez (7 coauthored works)
Chris Schwiegelshohn (6 coauthored works)
Andreas Wiese (5 coauthored works)
Jarosław Byrka (5 coauthored works)

Best Publications

An improved LP-based approximation for steiner tree

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

372
Citations
A measure & conquer approach for the analysis of exact algorithms

Fedor V. Fomin;Fabrizio Grandoni;Dieter Kratsch

311
Citations
Steiner Tree Approximation via Iterative Randomized Rounding

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

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

Fedor V. Fomin;Fabrizio Grandoni;Dieter Kratsch

191
Citations
Measure and conquer: domination – a case study

Fedor V. Fomin;Fabrizio Grandoni;Dieter Kratsch

185
Citations
Resilient dictionaries

Irene Finocchi;Fabrizio Grandoni;Giuseppe F. Italiano

174
Citations
On the complexity of fixed parameter clique and dominating set

Friedrich Eisenbrand;Fabrizio Grandoni

169
Citations
A note on the complexity of minimum dominating set

Fabrizio Grandoni

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

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

145
Citations
Subcubic equivalences between graph centrality problems, APSP and diameter

Amir Abboud;Fabrizio Grandoni;Virginia Vassilevska Williams

141
Citations
Solving Connected Dominating Set Faster than 2 n

Fedor V. Fomin;Fabrizio Grandoni;Dieter Kratsch

132
Citations
Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms

Fedor V. Fomin;Fabrizio Grandoni;Dieter Kratsch

122
Citations
Budgeted matching and budgeted matroid intersection via the gasoline puzzle

André Berger;Vincenzo Bonifaci;Fabrizio Grandoni;Guido Schäfer

102
Citations
Refined memorization for vertex cover

L. Sunil Chandran;Fabrizio Grandoni

67
Citations
New approaches to multi-objective optimization

Fabrizio Grandoni;R. Ravi;Mohit Singh;Rico Zenklusen

67
Citations
Approximating connected facility location problems via random facility sampling and core detouring

Friedrich Eisenbrand;Fabrizio Grandoni;Thomas Rothvoß;Guido Schäfer

67
Citations
Optimal Resilient Sorting and Searching in the Presence of Memory Faults

Irene Finocchi;Fabrizio Grandoni;Giuseppe F. Italiano

66
Citations
Bounding the number of minimal dominating sets: a measure and conquer approach

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

63
Citations
Improved Distance Sensitivity Oracles via Fast Single-Source Replacement Paths

Fabrizio Grandoni;Virginia Vassilevska Williams

62
Citations
Connected facility location via random facility sampling and core detouring

Friedrich Eisenbrand;Fabrizio Grandoni;Thomas Rothvoí;Guido Schäfer

60
Citations
Oblivious dimension reduction for k-means: beyond subspaces and the Johnson-Lindenstrauss lemma

Luca Becchetti;Marc Bury;Vincent Cohen-Addad;Fabrizio Grandoni

39
Citations
Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product

Karl Bringmann;Fabrizio Grandoni;Barna Saha;Virginia Vassilevska Williams

20
Citations

Frequent Co-Authors

Stefano Leonardi Sapienza University of Rome

Giuseppe F. Italiano Guido Carli Free International University for Social Studies

Fedor V. Fomin University of Bergen

Dieter Kratsch University of Lorraine

Marek Cygan University of Warsaw

Alessandro Panconesi Sapienza University of Rome

Martin Skutella Technical University of Berlin

Saket Saurabh Institute of Mathematical Sciences

Daniel Lokshtanov University of California, Santa Barbara

Anupam Gupta Carnegie Mellon University

External Links

Google Scholar page

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

Related Online Degrees & Career Pathways

Exploring computer science in the USA opens doors to a range of online degrees and career pathways. If you’re looking to accelerate your studies, a 2-year computer science degree online offers a fast-track option to break into tech roles with speed and flexibility. These programs can be ideal for those seeking to switch careers or upskill quickly.

For those interested in how technology can address environmental challenges, pursuing an environmental engineering degree online provides a strong foundation in both engineering and sustainability. Similarly, if building and automating systems fascinates you, the cheapest online mechanical engineering degree programs provide accessible options without compromising on core industry skills.

If you are passionate about the fundamentals underlying technology, specifically the physical laws governing computation and electronics, consider exploring online physics degrees. Overall, online study routes can help you tailor your educational journey, making it possible to enter high-demand STEM fields while balancing work or personal commitments.