| 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 | 42 | 2016 |
| Finding All Maximal Cliques in Very Large Social Networks. A Conte, R De Virgilio, A Maccioni, M Patrignani, R Torlone EDBT, 173-184, 2016 | 26 | 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 | 17 | 2017 |
| 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 | 13 | 2018 |
| 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 | 11 | 2017 |
| 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 | 10 | 2019 |
| 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 | 10 | 2017 |
| 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 | 10 | 2016 |
| 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 | 8 | 2017 |
| 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 | 7 | 2019 |
| Efficient enumeration of graph orientations with sources A Conte, R Grossi, A Marino, R Rizzi Discrete Applied Mathematics 246, 22-37, 2018 | 6 | 2018 |
| 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 | 6 | 2016 |
| 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 | 5 | 2016 |
| Enumerating Cyclic Orientations of a Graph A Conte, R Grossi, A Marino, R Rizzi Combinatorial Algorithms: 26th International Workshop, IWOCA 2015, Verona …, 2016 | 5 | 2016 |
| Listing acyclic subgraphs and subgraphs of bounded girth in directed graphs A Conte, K Kurita, K Wasa, T Uno International Conference on Combinatorial Optimization and Applications, 169-181, 2017 | 4 | 2017 |
| On maximal cliques with connectivity constraints in directed graphs A Conte, MM Kanté, T Uno, K Wasa 28th International Symposium on Algorithms and Computation (ISAAC 2017), 2017 | 4 | 2017 |
| 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 | 3 | 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 | 3 | 2018 |
| Finding maximal common subgraphs via time-space efficient reverse search A Conte, R Grossi, A Marino, L Versari International Computing and Combinatorics Conference, 328-340, 2018 | 3 | 2018 |
| A fast algorithm for large common connected induced subgraphs A Conte, R Grossi, A Marino, L Tattini, L Versari International Conference on Algorithms for Computational Biology, 62-74, 2017 | 3 | 2017 |
Roberto GrossiProfessor of Computer Science, University of Pisa, ItalyVerified email at di.unipi.it
