Fabrizio Montecchiani

1.2k total citations
69 papers, 424 citations indexed

About

Fabrizio Montecchiani is a scholar working on Computer Vision and Pattern Recognition, Computer Graphics and Computer-Aided Design and Computational Theory and Mathematics. According to data from OpenAlex, Fabrizio Montecchiani has authored 69 papers receiving a total of 424 indexed citations (citations by other indexed papers that have themselves been cited), including 40 papers in Computer Vision and Pattern Recognition, 37 papers in Computer Graphics and Computer-Aided Design and 28 papers in Computational Theory and Mathematics. Recurrent topics in Fabrizio Montecchiani's work include Computational Geometry and Mesh Generation (37 papers), Data Visualization and Analytics (25 papers) and Advanced Graph Theory Research (20 papers). Fabrizio Montecchiani is often cited by papers focused on Computational Geometry and Mesh Generation (37 papers), Data Visualization and Analytics (25 papers) and Advanced Graph Theory Research (20 papers). Fabrizio Montecchiani collaborates with scholars based in Italy, Germany and Greece. Fabrizio Montecchiani's co-authors include Walter Didimo, Giuseppe Liotta, Emilio Di Giacomo, Luca Grilli, Ioannis G. Tollis, Michael A. Bekos, Michael Kaufmann, William Evans, Franz J. Brandenburg and Thérèse Biedl and has published in prestigious journals such as SHILAP Revista de lepidopterología, Expert Systems with Applications and IEEE Access.

In The Last Decade

Fabrizio Montecchiani

59 papers receiving 396 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Fabrizio Montecchiani Italy 12 225 118 106 103 82 69 424
Panayiotis Bozanis Greece 12 67 0.3× 20 0.2× 70 0.7× 15 0.1× 156 1.9× 55 454
Afonso Ferreira France 11 43 0.2× 23 0.2× 12 0.1× 57 0.6× 74 0.9× 52 414
Amitabha Bagchi India 12 62 0.3× 13 0.1× 184 1.7× 53 0.5× 131 1.6× 57 526
Ashwinkumar Badanidiyuru United States 9 36 0.2× 23 0.2× 20 0.2× 207 2.0× 247 3.0× 18 498
Xiao He China 12 69 0.3× 6 0.1× 46 0.4× 26 0.3× 197 2.4× 58 408
Elizeu Santos‐Neto Canada 13 126 0.6× 7 0.1× 33 0.3× 12 0.1× 128 1.6× 25 561
Tal Grinshpoun Israel 11 30 0.1× 19 0.2× 5 0.0× 15 0.1× 85 1.0× 47 337
Ramakrishna Thurimella United States 11 23 0.1× 20 0.2× 8 0.1× 222 2.2× 129 1.6× 40 432
Xuedi Qin China 9 332 1.5× 11 0.1× 9 0.1× 7 0.1× 297 3.6× 15 586
Guy Jacobson United States 9 35 0.2× 7 0.1× 14 0.1× 31 0.3× 160 2.0× 15 328

Countries citing papers authored by Fabrizio Montecchiani

Since Specialization
Citations

This map shows the geographic impact of Fabrizio Montecchiani'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 Montecchiani with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Fabrizio Montecchiani more than expected).

Fields of papers citing papers by Fabrizio Montecchiani

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Fabrizio Montecchiani. 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 Montecchiani. The network helps show where Fabrizio Montecchiani may publish in the future.

Co-authorship network of co-authors of Fabrizio Montecchiani

This figure shows the co-authorship network connecting the top 25 collaborators of Fabrizio Montecchiani. A scholar is included among the top collaborators of Fabrizio Montecchiani 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 Montecchiani. Fabrizio Montecchiani is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Giacomo, Emilio Di, Walter Didimo, Giuseppe Liotta, et al.. (2025). Bounds on the edge-length ratio of 2-outerplanar graphs. Computational Geometry. 129. 102192–102192.
2.
Kobourov, Stephen, Maarten Löffler, Fabrizio Montecchiani, et al.. (2025). The influence of dimensions on the complexity of computing decision trees. Artificial Intelligence. 343. 104322–104322. 2 indexed citations
3.
Eades, Peter, Seok-Hee Hong, Giuseppe Liotta, et al.. (2024). Introducing fairness in network visualization. Information Sciences. 691. 121642–121642.
4.
Chaplick, Steven, Giordano Da Lozzo, Emilio Di Giacomo, Giuseppe Liotta, & Fabrizio Montecchiani. (2024). Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees. Algorithmica. 86(8). 2413–2447. 1 indexed citations
5.
Angelini, Patrizio, et al.. (2023). Recognizing Map Graphs of Bounded Treewidth. Algorithmica. 86(2). 613–637. 1 indexed citations
6.
Kobourov, Stephen, Maarten Löffler, Fabrizio Montecchiani, et al.. (2023). The Influence of Dimensions on the Complexity of Computing Decision Trees. Proceedings of the AAAI Conference on Artificial Intelligence. 37(7). 8343–8350. 6 indexed citations
7.
Didimo, Walter, Luca Grilli, Giuseppe Liotta, & Fabrizio Montecchiani. (2022). Efficient and trustworthy decision making through human-in-the-loop visual analytics: A case study on tax risk assessment. SHILAP Revista de lepidopterología.
8.
Bekos, Michael A., et al.. (2019). Planar Graphs of Bounded Degree Have Bounded Queue Number. SIAM Journal on Computing. 48(5). 1487–1502. 4 indexed citations
9.
Bae, Sang Won, Jinhee Chun, Peter Eades, et al.. (2018). Gap-planar graphs. Theoretical Computer Science. 745. 36–52. 9 indexed citations
10.
Bekos, Michael A., et al.. (2017). On RAC drawings of 1-planar graphs. Theoretical Computer Science. 689. 48–57. 6 indexed citations
11.
Giacomo, Emilio Di, Giuseppe Liotta, & Fabrizio Montecchiani. (2017). Drawing subcubic planar graphs with four slopes and optimal angular resolution. Theoretical Computer Science. 714. 51–73. 3 indexed citations
12.
Giacomo, Emilio Di, Walter Didimo, William Evans, et al.. (2017). New results on edge partitions of 1-plane graphs. Theoretical Computer Science. 713. 78–84. 2 indexed citations
13.
Biedl, Thérèse, Giuseppe Liotta, & Fabrizio Montecchiani. (2016). On Visibility Representations of Non-Planar Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 8 indexed citations
14.
Lenhart, William, Giuseppe Liotta, & Fabrizio Montecchiani. (2016). On partitioning the edges of 1-plane graphs. Theoretical Computer Science. 662. 59–65. 2 indexed citations
15.
Brandenburg, Franz J., et al.. (2016). Recognizing and drawing IC-planar graphs. Theoretical Computer Science. 636. 1–16. 18 indexed citations
16.
Evans, William, Giuseppe Liotta, & Fabrizio Montecchiani. (2016). Simultaneous visibility representations of plane st-graphs using L-shapes. Theoretical Computer Science. 645. 100–111. 3 indexed citations
17.
Angelini, Patrizio, Giordano Da Lozzo, Walter Didimo, et al.. (2015). Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs. Computational Geometry. 50. 34–48. 2 indexed citations
18.
Giacomo, Emilio Di, Walter Didimo, Fabrizio Montecchiani, et al.. (2015). Fan-planarity: Properties and complexity. Theoretical Computer Science. 589. 76–86. 9 indexed citations
19.
Giacomo, Emilio Di, Walter Didimo, Michael Kaufmann, Giuseppe Liotta, & Fabrizio Montecchiani. (2014). Upward-rightward planar drawings. 145–150. 1 indexed citations
20.
Giacomo, Emilio Di, Walter Didimo, Giuseppe Liotta, & Fabrizio Montecchiani. (2013). Area requirement of graph drawings with few crossings per edge. Computational Geometry. 46(8). 909–916. 12 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

Breakdown of academic impact, for papers by Panayiotis Bozanis Breakdown of academic impact, for papers by Afonso Ferreira Breakdown of academic impact, for papers by Amitabha Bagchi Breakdown of academic impact, for papers by Ashwinkumar Badanidiyuru Breakdown of academic impact, for papers by Xiao He Breakdown of academic impact, for papers by Elizeu Santos‐Neto Breakdown of academic impact, for papers by Tal Grinshpoun Breakdown of academic impact, for papers by Ramakrishna Thurimella Breakdown of academic impact, for papers by Xuedi Qin Breakdown of academic impact, for papers by Guy Jacobson
Rankless by CCL
2026