Follow
Alessio Conte
Title
Cited by
Cited by
Year
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
542016
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
392018
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
352017
Finding all maximal cliques in very large social networks
A Conte, R De Virgilio, A Maccioni, M Patrignani, R Torlone
19th International Conference on Extending Database Technology, EDBT 2016 …, 2016
322016
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
262019
Efficiently clustering very large attributed graphs
A Baroni, A Conte, M Patrignani, S Ruggieri
2017 IEEE/ACM International Conference on Advances in Social Networks …, 2017
232017
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
122019
Listing maximal independent sets with minimal space and bounded delay
A Conte, R Grossi, A Marino, T Uno, L Versari
International Symposium on String Processing and Information Retrieval, 144-160, 2017
122017
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
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
112016
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
102018
String sanitization: A combinatorial approach
G Bernardini, H Chen, A Conte, R Grossi, G Loukides, N Pisanti, SP Pissis, ...
Joint European Conference on Machine Learning and Knowledge Discovery in …, 2019
92019
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
82020
Large-scale clique cover of real-world networks
A Conte, R Grossi, A Marino
Information and Computation 270, 104464, 2020
82020
Efficient enumeration of graph orientations with sources
A Conte, R Grossi, A Marino, R Rizzi
Discrete Applied Mathematics 246, 22-37, 2018
82018
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
82016
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
72018
Listing acyclic orientations of graphs with single and multiple sources
A Conte, R Grossi, A Marino, R Rizzi
LATIN 2016: Theoretical Informatics, 319-333, 2016
72016
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
62020
Hide and mine in strings: Hardness and algorithms
G Bernardini, A Conte, G Gourdel, R Grossi, G Loukides, N Pisanti, ...
2020 IEEE International Conference on Data Mining (ICDM), 924-929, 2020
52020
The system can't perform the operation now. Try again later.
Articles 1–20