Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
A (sub)graph isomorphism algorithm for matching large graphs
2004874 citationsL.P. Cordella, Pasquale Foggia et al.IEEE Transactions on Pattern Analysis and Machine Intelligenceprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of M. Vento'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 M. Vento with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites M. Vento more than expected).
This network shows the impact of papers produced by M. Vento. 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 M. Vento. The network helps show where M. Vento may publish in the future.
Co-authorship network of co-authors of M. Vento
This figure shows the co-authorship network connecting the top 25 collaborators of M. Vento.
A scholar is included among the top collaborators of M. Vento 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 M. Vento. M. Vento is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Brun, Luc & M. Vento. (2005). Graph-Based Representations in Pattern Recognition: 5th IAPR International Workshop, GbRPR 2005, Poitiers, France, April 11-13, 2005, Proceedings (Lecture Notes in Computer Science). Springer eBooks.3 indexed citations
7.
Cordella, L.P., Pasquale Foggia, Carlo Sansone, & M. Vento. (2004). A (sub)graph isomorphism algorithm for matching large graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence. 26(10). 1367–1372.874 indexed citations breakdown →
Foggia, Pasquale, Carlo Sansone, & M. Vento. (2001). A Performance Comparison of Five Algorithms for Graph Isomorphism.76 indexed citations
14.
Jolion, Jean-Michel, Walter G. Kropatsch, & M. Vento. (2001). 3rd IAPR TC-15 Workshop on Graph-based Representations in Pattern Recognition.25 indexed citations
15.
Cordella, L.P., Pasquale Foggia, Carlo Sansone, & M. Vento. (2001). An Improved Algorithm for Matching Large Graphs.200 indexed citations
Stefano, Claudio De, Carlo Sansone, & M. Vento. (1995). Comparing Generalization and Recognition Capability of Learning Vector Quantization and Multi-layer Perceptron Architectures. 1123–1130.5 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.