World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
38
Citations
5354
World Ranking
10341
National Ranking
183

Fabrizio Grandoni publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Fabrizio Grandoni sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 249 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 559 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 423 scientists 242–251 publications: 408 scientists 252–261 publications: 377 scientists 262–271 publications: 301 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 158 publications — 30th percentile

30% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Fabrizio Grandoni D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Fabrizio Grandoni sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 983 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 968 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 763 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 518 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 38 D-Index — 30th percentile

30% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

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à

  • A measure & conquer approach for the analysis of exact algorithms

    Fedor V. Fomin;Fabrizio Grandoni;Dieter Kratsch

  • Steiner Tree Approximation via Iterative Randomized Rounding

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

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

    Fedor V. Fomin;Fabrizio Grandoni;Dieter Kratsch

  • Measure and conquer: domination – a case study

    Fedor V. Fomin;Fabrizio Grandoni;Dieter Kratsch

  • Resilient dictionaries

    Irene Finocchi;Fabrizio Grandoni;Giuseppe F. Italiano

  • On the complexity of fixed parameter clique and dominating set

    Friedrich Eisenbrand;Fabrizio Grandoni

  • A note on the complexity of minimum dominating set

    Fabrizio Grandoni

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

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

  • Subcubic equivalences between graph centrality problems, APSP and diameter

    Amir Abboud;Fabrizio Grandoni;Virginia Vassilevska Williams

  • Solving Connected Dominating Set Faster than 2 n

    Fedor V. Fomin;Fabrizio Grandoni;Dieter Kratsch

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

    Fedor V. Fomin;Fabrizio Grandoni;Dieter Kratsch

  • Budgeted matching and budgeted matroid intersection via the gasoline puzzle

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

  • Refined memorization for vertex cover

    L. Sunil Chandran;Fabrizio Grandoni

  • New approaches to multi-objective optimization

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

  • Approximating connected facility location problems via random facility sampling and core detouring

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

  • Optimal Resilient Sorting and Searching in the Presence of Memory Faults

    Irene Finocchi;Fabrizio Grandoni;Giuseppe F. Italiano

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

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

  • Improved Distance Sensitivity Oracles via Fast Single-Source Replacement Paths

    Fabrizio Grandoni;Virginia Vassilevska Williams

  • Connected facility location via random facility sampling and core detouring

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

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

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

  • 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

Frequent Co-Authors

Stefano Leonardi
Stefano Leonardi Sapienza University of Rome
Giuseppe F. Italiano
Giuseppe F. Italiano Guido Carli Free International University for Social Studies
Fedor V. Fomin
Fedor V. Fomin University of Bergen
Dieter Kratsch
Dieter Kratsch University of Lorraine
Marek Cygan
Marek Cygan University of Warsaw
Alessandro Panconesi
Alessandro Panconesi Sapienza University of Rome
Martin Skutella
Martin Skutella Technical University of Berlin
Saket Saurabh
Saket Saurabh Institute of Mathematical Sciences
Daniel Lokshtanov
Daniel Lokshtanov University of California, Santa Barbara
Stefan Kratsch
Stefan Kratsch Humboldt-Universität zu Berlin

External Links

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

Report an issue

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:

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.

Best Scientists Citing Fabrizio Grandoni

Trending Scientists

Recently Published Articles