Follow
Alessio Conte
Title
Cited by
Cited by
Year
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
712018
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
662016
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
502017
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
382016
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
332019
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
302017
Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs
A Conte, R Grossi, A Marino, L Versari
Algorithmica 82, 1547-1573, 2020
162020
Large-scale clique cover of real-world networks
A Conte, R Grossi, A Marino
Information and Computation 270, 104464, 2020
162020
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
162019
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
142016
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
132020
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
132018
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
132018
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
132017
Review of the bron-kerbosch algorithm and variations
A Conte
School of Computing Science, University of Glasgow, 1-9, 2013
132013
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
122020
Zuckerli: A new compressed representation for graphs
L Versari, IM Comsa, A Conte, R Grossi
IEEE Access 8, 219233-219243, 2020
112020
Efficient enumeration of graph orientations with sources
A Conte, R Grossi, A Marino, R Rizzi
Discrete Applied Mathematics 246, 22-37, 2018
112018
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
112017
Clique covering of large real-world networks
A Conte, R Grossi, A Marino
Proceedings of the 31st Annual ACM Symposium on Applied Computing, 1134-1139, 2016
112016
The system can't perform the operation now. Try again later.
Articles 1–20