| D2K: scalable community detection in massive networks via small-diameter k-plexes A Conte, T De Matteis, D De Sensi, R Grossi, A Marino, L Versari Proceedings of the 24th ACM SIGKDD International Conference on Knowledge …, 2018 | 76 | 2018 |
| Sublinear-space bounded-delay enumeration for massive network analytics: Maximal cliques A Conte, R Grossi, A Marino, L Versari 43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016 | 70 | 2016 |
| Fast enumeration of large k-plexes A Conte, D Firmani, C Mordente, M Patrignani, R Torlone Proceedings of the 23rd ACM SIGKDD international conference on knowledge …, 2017 | 60 | 2017 |
| Finding all maximal cliques in very large social networks A Conte, R De Virgilio, A Maccioni, M Patrignani, R Torlone Advances in Database Technology-EDBT 2016, 173-184, 2016 | 44 | 2016 |
| New polynomial delay bounds for maximal subgraph enumeration by proximity search A Conte, T Uno Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 33 | 2019 |
| Efficiently clustering very large attributed graphs A Baroni, A Conte, M Patrignani, S Ruggieri Proceedings of the 2017 IEEE/ACM International Conference on Advances in …, 2017 | 27 | 2017 |
| Large-scale clique cover of real-world networks A Conte, R Grossi, A Marino Information and Computation 270, 104464, 2020 | 20 | 2020 |
| Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs A Conte, R Grossi, A Marino, L Versari Algorithmica 82 (6), 1547-1573, 2020 | 19 | 2020 |
| Listing maximal subgraphs satisfying strongly accessible properties A Conte, R Grossi, A Marino, L Versari SIAM Journal on Discrete Mathematics 33 (2), 587-613, 2019 | 17 | 2019 |
| Truly scalable k-truss and max-truss algorithms for community detection in graphs A Conte, D De Sensi, R Grossi, A Marino, L Versari IEEE Access 8, 139096-139109, 2020 | 15 | 2020 |
| Directing road networks by listing strong orientations A Conte, R Grossi, A Marino, R Rizzi, L Versari International Workshop on Combinatorial Algorithms, 83-95, 2016 | 15 | 2016 |
| Answering (unions of) conjunctive queries using random access and random-order enumeration N Carmeli, S Zeevi, C Berkholz, A Conte, B Kimelfeld, N Schweikardt ACM Transactions on Database Systems (TODS) 47 (3), 1-49, 2022 | 13 | 2022 |
| String sanitization: A combinatorial approach G Bernardini, H Chen, A Conte, R Grossi, G Loukides, N Pisanti, SP Pissis, ... Machine Learning and Knowledge Discovery in Databases: European Conference …, 2020 | 13 | 2020 |
| Discovering -Trusses in Large-Scale Networks A Conte, D De Sensi, R Grossi, A Marino, L Versari 2018 IEEE high performance extreme computing conference (HPEC), 1-6, 2018 | 13 | 2018 |
| Node similarity with q-grams for real-world labeled networks A Conte, G Ferraro, R Grossi, A Marino, K Sadakane, T Uno Proceedings of the 24th ACM SIGKDD International Conference on Knowledge …, 2018 | 13 | 2018 |
| Listing maximal independent sets with minimal space and bounded delay A Conte, R Grossi, A Marino, T Uno, L Versari String Processing and Information Retrieval: 24th International Symposium …, 2017 | 13 | 2017 |
| Proximity search for maximal subgraph enumeration A Conte, R Grossi, A Marino, T Uno, L Versari SIAM Journal on Computing 51 (5), 1580-1625, 2022 | 12 | 2022 |
| Combinatorial algorithms for string sanitization G Bernardini, H Chen, A Conte, R Grossi, G Loukides, N Pisanti, SP Pissis, ... ACM Transactions on Knowledge Discovery from Data (TKDD) 15 (1), 1-34, 2020 | 12 | 2020 |
| Zuckerli: A new compressed representation for graphs L Versari, IM Comsa, A Conte, R Grossi IEEE Access 8, 219233-219243, 2020 | 12 | 2020 |
| Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph A Conte, MM Kanté, Y Otachi, T Uno, K Wasa International Computing and Combinatorics Conference, 150-161, 2017 | 12 | 2017 |
Roberto GrossiProfessor of Computer Science, University of Pisa, Italy在 unipi.it 的电子邮件经过验证
