Fabrizio Grandoni

3.9k total citations
84 papers, 1.4k citations indexed

About

Fabrizio Grandoni is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Fabrizio Grandoni has authored 84 papers receiving a total of 1.4k indexed citations (citations by other indexed papers that have themselves been cited), including 57 papers in Computational Theory and Mathematics, 46 papers in Computer Networks and Communications and 13 papers in Artificial Intelligence. Recurrent topics in Fabrizio Grandoni's work include Complexity and Algorithms in Graphs (50 papers), Advanced Graph Theory Research (41 papers) and Optimization and Search Problems (26 papers). Fabrizio Grandoni is often cited by papers focused on Complexity and Algorithms in Graphs (50 papers), Advanced Graph Theory Research (41 papers) and Optimization and Search Problems (26 papers). Fabrizio Grandoni collaborates with scholars based in Switzerland, Italy and Germany. Fabrizio Grandoni's co-authors include Fedor V. Fomin, Dieter Kratsch, Thomas Rothvoß, Laura Sanità, Jarosław Byrka, Friedrich Eisenbrand, Giuseppe F. Italiano, Irene Finocchi, Félicita Di Giandomenico and Andrea Bondavalli and has published in prestigious journals such as Journal of the ACM, IEEE Transactions on Computers and Mathematical Programming.

In The Last Decade

Fabrizio Grandoni

75 papers receiving 1.3k citations

Peers

Fabrizio Grandoni

CTM

CNC

EEE

IME

F. Bruce Shepherd Canada

Harald Räcke United States

Guy Kortsarz United States

Yair Bartal Israel

Reuven Bar-Yehuda Israel

Julia Chuzhoy United States

András Frank Hungary

Friedhelm Meyer auf der Heide Germany

Mohammad Taghi Hajiaghayi United States

Harry B. Hunt United States

F. Bruce Shepherd Canada

Fabrizio Grandoni

868 ×1.0

CTM

1.2k ×1.7

CNC

174 ×0.8

320 ×1.5

EEE

119 ×1.0

IME

Citations per year, relative to Fabrizio Grandoni Fabrizio Grandoni (= 1×) peers F. Bruce Shepherd

Countries citing papers authored by Fabrizio Grandoni

Since Specialization

Citations

This map shows the geographic impact of Fabrizio Grandoni's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Fabrizio Grandoni with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Fabrizio Grandoni more than expected).

Fields of papers citing papers by Fabrizio Grandoni

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Fabrizio Grandoni. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Fabrizio Grandoni. The network helps show where Fabrizio Grandoni may publish in the future.

Co-authorship network of co-authors of Fabrizio Grandoni

This figure shows the co-authorship network connecting the top 25 collaborators of Fabrizio Grandoni. A scholar is included among the top collaborators of Fabrizio Grandoni based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Fabrizio Grandoni. Fabrizio Grandoni is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Grandoni, Fabrizio, et al.. (2021). Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 4 indexed citations

Grandoni, Fabrizio, et al.. (2020). A Tight (3/2+ε) Approximation for Skewed Strip Packing. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3 indexed citations

Grandoni, Fabrizio, Stefano Leonardi, Piotr Sankowski, Chris Schwiegelshohn, & Shay Solomon. (2019). (1 + ε-Approximate incremental matching in constant deterministic amortized time. Symposium on Discrete Algorithms. 1886–1898. 2 indexed citations

Anagnostopoulos, Aris, Fabrizio Grandoni, Stefano Leonardi, & Andreas Wiese. (2014). A mazing 2+ε approximation for unsplittable flow on a path. Symposium on Discrete Algorithms. 26–41. 8 indexed citations

Petrillo, Umberto Ferraro, Fabrizio Grandoni, & Giuseppe F. Italiano. (2013). Data structures resilient to memory faults. ACM Journal of Experimental Algorithmics. 18. 4 indexed citations

Anagnostopoulos, Aris, Fabrizio Grandoni, Stefano Leonardi, & Andreas Wiese. (2013). A Mazing 2+∊ Approximation for Unsplittable Flow on a Path. IRIS Research product catalog (Sapienza University of Rome). 26–41. 13 indexed citations

Eisenbrand, Friedrich, Fabrizio Grandoni, Thomas Rothvoß, & Guido Schäfer. (2010). Connected facility location via random facility sampling and core detouring. Journal of Computer and System Sciences. 76(8). 709–726. 28 indexed citations

Grandoni, Fabrizio, Gaia Nicosia, Gianpaolo Oriolo, & Laura Sanità. (2010). Stable routing under the Spanning Tree Protocol. Operations Research Letters. 38(5). 399–404. 2 indexed citations

Finocchi, Irene, Fabrizio Grandoni, & Giuseppe F. Italiano. (2009). Optimal resilient sorting and searching in the presence of memory faults. Theoretical Computer Science. 410(44). 4457–4470. 21 indexed citations

10.

Dı́az, Josep, Fabrizio Grandoni, & Alberto Marchetti-Spaccamela. (2009). Balanced cut approximation in random geometric graphs. Theoretical Computer Science. 410(27-29). 2725–2731. 3 indexed citations

11.

Grandoni, Fabrizio, Volker Kaibel, Gianpaolo Oriolo, & Martin Skutella. (2008). A short proof of the VPN Tree Routing Conjecture on ring networks. Operations Research Letters. 36(3). 361–365. 12 indexed citations

12.

Finocchi, Irene, Fabrizio Grandoni, & Giuseppe F. Italiano. (2007). Resilient search trees. Symposium on Discrete Algorithms. 547–553. 13 indexed citations

13.

Fomin, Fedor V., Fabrizio Grandoni, & Dieter Kratsch. (2006). Measure and conquer: a simple O(20.288n) independent set algorithm. Symposium on Discrete Algorithms. 18–25. 59 indexed citations

14.

Chandran, L. Sunil & Fabrizio Grandoni. (2006). A linear time algorithm to list the minimal separators of chordal graphs. Discrete Mathematics. 306(3). 351–358. 10 indexed citations

15.

Fomin, Fedor V., Fabrizio Grandoni, & Dieter Kratsch. (2005). Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms. Bulletin of the European Association for Theoretical Computer Science. 87. 47–77. 51 indexed citations

16.

Eisenbrand, Friedrich & Fabrizio Grandoni. (2005). An improved approximation algorithm for virtual private network design. Symposium on Discrete Algorithms. 928–932. 12 indexed citations

17.

Grandoni, Fabrizio. (2005). A note on the complexity of minimum dominating set. Journal of Discrete Algorithms. 4(2). 209–214. 65 indexed citations

18.

Eisenbrand, Friedrich & Fabrizio Grandoni. (2004). On the complexity of fixed parameter clique and dominating set. Theoretical Computer Science. 326(1-3). 57–67. 61 indexed citations

19.

Giandomenico, Félicita Di, Silvano Chiaradonna, Andrea Bondavalli, & Fabrizio Grandoni. (2000). Evaluation of Integrated Error Processing and Fault Diagnosis in Multiprocessor Systems. Parallel and Distributed Processing Techniques and Applications. 1145–1151. 1 indexed citations

20.

Giandomenico, Félicita Di, et al.. (1987). A Gracefully Degradable Algorithm for Byzantine Agreement.. 188–200. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact