Alessio Conte

552 total citations
33 papers, 199 citations indexed

About

Alessio Conte is a scholar working on Artificial Intelligence, Computer Networks and Communications and Statistical and Nonlinear Physics. According to data from OpenAlex, Alessio Conte has authored 33 papers receiving a total of 199 indexed citations (citations by other indexed papers that have themselves been cited), including 19 papers in Artificial Intelligence, 15 papers in Computer Networks and Communications and 13 papers in Statistical and Nonlinear Physics. Recurrent topics in Alessio Conte's work include Complex Network Analysis Techniques (13 papers), Advanced Graph Theory Research (9 papers) and Algorithms and Data Compression (8 papers). Alessio Conte is often cited by papers focused on Complex Network Analysis Techniques (13 papers), Advanced Graph Theory Research (9 papers) and Algorithms and Data Compression (8 papers). Alessio Conte collaborates with scholars based in Italy, Japan and France. Alessio Conte's co-authors include Andrea Marino, Roberto Grossi, Maurizio Patrignani, Riccardo Torlone, Daniele De Sensi, Luca Versari, Donatella Firmani, Tiziano De Matteis, Takeaki Uno and Antonio Maccioni and has published in prestigious journals such as IEEE Access, IEEE Transactions on Knowledge and Data Engineering and SIAM Journal on Computing.

In The Last Decade

Alessio Conte

28 papers receiving 188 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Alessio Conte Italy 7 94 86 77 74 46 33 199
Darren Strash United States 7 83 0.9× 69 0.8× 67 0.9× 72 1.0× 34 0.7× 18 200
Yon Dourisboure Italy 5 76 0.8× 70 0.8× 120 1.6× 64 0.9× 29 0.6× 5 216
Anand Louis United States 7 97 1.0× 66 0.8× 64 0.8× 24 0.3× 37 0.8× 15 197
Ali Pinar United States 3 83 0.9× 32 0.4× 148 1.9× 70 0.9× 43 0.9× 4 205
Dong Wen Australia 9 106 1.1× 41 0.5× 74 1.0× 85 1.1× 109 2.4× 37 233
Pinghui Wang China 7 141 1.5× 18 0.2× 93 1.2× 119 1.6× 26 0.6× 25 233
Rupkumar Mahapatra India 8 58 0.6× 59 0.7× 45 0.6× 23 0.3× 32 0.7× 17 201
Song Bian China 4 119 1.3× 19 0.2× 52 0.7× 34 0.5× 75 1.6× 4 209
Paolo Giulio Franciosa Italy 7 54 0.6× 62 0.7× 12 0.2× 67 0.9× 38 0.8× 26 162
Can Lu Hong Kong 8 139 1.5× 41 0.5× 52 0.7× 114 1.5× 156 3.4× 13 282

Countries citing papers authored by Alessio Conte

Since Specialization
Citations

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

Fields of papers citing papers by Alessio Conte

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Alessio Conte

This figure shows the co-authorship network connecting the top 25 collaborators of Alessio Conte. A scholar is included among the top collaborators of Alessio Conte 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 Alessio Conte. Alessio Conte 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.
Chen, Huiping, et al.. (2024). On Breaking Truss-based and Core-based Communities. ACM Transactions on Knowledge Discovery from Data. 18(6). 1–43.
2.
Conte, Alessio, et al.. (2024). Are k-cores meaningful for temporal graph analysis?. CINECA IRIS Institutial research information system (University of Pisa). 1453–1460.
3.
Bacciu, Davide, et al.. (2023). Generalizing Downsampling from Regular Data to Graphs. Proceedings of the AAAI Conference on Artificial Intelligence. 37(6). 6718–6727. 2 indexed citations
4.
Conte, Alessio, et al.. (2023). Computing matching statistics on Wheeler DFAs. PubMed. 2023. 150–159.
5.
Conte, Alessio, et al.. (2023). phyBWT2: phylogeny reconstruction via eBWT positional clustering. Algorithms for Molecular Biology. 18(1). 11–11.
6.
Berkholz, Christoph, et al.. (2022). Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration. ACM Transactions on Database Systems. 47(3). 1–49. 4 indexed citations
7.
Conte, Alessio, Roberto Grossi, Andrea Marino, Takeaki Uno, & Luca Versari. (2022). Proximity Search for Maximal Subgraph Enumeration. SIAM Journal on Computing. 51(5). 1580–1625. 5 indexed citations
8.
Conte, Alessio, Roberto Grossi, Grigorios Loukides, et al.. (2022). Hide and Mine in Strings: Hardness, Algorithms, and Experiments. IEEE Transactions on Knowledge and Data Engineering. 1–1. 1 indexed citations
9.
Chen, Huiping, Alessio Conte, Roberto Grossi, et al.. (2021). Combinatorial Algorithms for String Sanitization. ArTS Archivio della ricerca di Trieste (University of Trieste https://www.units.it/). 3 indexed citations
10.
Versari, Luca, et al.. (2020). Zuckerli: A New Compressed Representation for Graphs. CINECA IRIS Institutial research information system (University of Pisa). 4 indexed citations
11.
Conte, Alessio, Daniele De Sensi, Roberto Grossi, Andrea Marino, & Luca Versari. (2020). Truly Scalable K-Truss and Max-Truss Algorithms for Community Detection in Graphs. IEEE Access. 8. 139096–139109. 8 indexed citations
12.
Tomita, Etsuji & Alessio Conte. (2020). Another time-complexity analysis for the maximal clique enumeration algorithm CLIQUES. IEICE technical report. Speech. 120(2020). 1–8. 1 indexed citations
13.
Conte, Alessio, et al.. (2020). Fast Assessment of Eulerian Trails. 1 indexed citations
14.
Conte, Alessio, Roberto Grossi, Andrea Marino, Lorenzo Tattini, & Luca Versari. (2019). A fast discovery algorithm for large common connected induced subgraphs. Discrete Applied Mathematics. 268. 210–222. 1 indexed citations
15.
Conte, Alessio & Takeaki Uno. (2019). New polynomial delay bounds for maximal subgraph enumeration by proximity search. CINECA IRIS Institutial research information system (University of Pisa). 1179–1190. 6 indexed citations
16.
Conte, Alessio, Roberto Grossi, Andrea Marino, & Luca Versari. (2019). Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs. Algorithmica. 82(6). 1547–1573. 12 indexed citations
17.
Conte, Alessio, Donatella Firmani, Maurizio Patrignani, & Riccardo Torlone. (2019). Shared-Nothing Distributed Enumeration of 2-Plexes. CINECA IRIS Institutial research information system (University of Pisa). 2469–2472. 2 indexed citations
18.
Conte, Alessio, Daniele De Sensi, Roberto Grossi, Andrea Marino, & Luca Versari. (2018). Discovering <tex>$k$</tex>-Trusses in Large-Scale Networks. CINECA IRIS Institutial research information system (University of Pisa). 16. 1–6. 5 indexed citations
19.
Conte, Alessio, et al.. (2017). Fast Enumeration of Large k-Plexes. CINECA IRIS Institutial research information system (University of Pisa). 115–124. 38 indexed citations
20.
Conte, Alessio, Roberto De Virgilio, Antonio Maccioni, Maurizio Patrignani, & Riccardo Torlone. (2016). Finding All Maximal Cliques in Very Large Social Networks. CINECA IRIS Institutial research information system (University of Pisa). 19 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 Darren Strash Breakdown of academic impact, for papers by Yon Dourisboure Breakdown of academic impact, for papers by Anand Louis Breakdown of academic impact, for papers by Ali Pinar Breakdown of academic impact, for papers by Dong Wen Breakdown of academic impact, for papers by Pinghui Wang Breakdown of academic impact, for papers by Rupkumar Mahapatra Breakdown of academic impact, for papers by Song Bian Breakdown of academic impact, for papers by Paolo Giulio Franciosa Breakdown of academic impact, for papers by Can Lu
Rankless by CCL
2026