CINECA IRIS Institutional Research Information System

CONTE, ALESSIO Statistiche

CONTE, ALESSIO  

DIPARTIMENTO DI INFORMATICA  

Mostra records
Risultati 1 - 20 di 58 (tempo di esecuzione: 0.027 secondi).
Titolo Data di pubblicazione Autore(i) File
A fast algorithm for large common connected induced subgraphs 1-gen-2017 Conte, Alessio; Grossi, Roberto; Marino, Andrea; Tattini, Lorenzo; Versari, Luca
A fast discovery algorithm for large common connected induced subgraphs 1-gen-2019 Conte, A.; Grossi, R.; Marino, A.; Tattini, L.; Versari, L.
A meta-algorithm for finding large k-plexes 1-gen-2021 Conte, A.; Firmani, D.; Patrignani, M.; Torlone, R.
BC-Cliques: Code to enumerate black connected cliques in the graph obtained by computing the product between two labeled graphs 1-gen-2018 Conte, Alessio; Grossi, Roberto; Marino, Andrea; Versari, Luca
Beyond the BEST Theorem: Fast Assessment of Eulerian Trails 1-gen-2021 Conte, A.; Grossi, R.; Loukides, G.; Pisanti, N.; Pissis, S. P.; Punzi, G.
Clique covering of large real-world networks 1-gen-2016 Conte, Alessio; Grossi, Roberto; Marino, Andrea
Cliques are Too Strict for Representing Communities: Finding Large k-plexes in Real Networks 1-gen-2018 Conte, Alessio; Firmani, Donatella; Mordente, Caterina; Patrignani, Maurizio; Torlone, Riccardo
ColorCoding: Implementation of some algorithms for graph similarity based on the color-coding method by Alon-Yuster-Zwick 1-gen-2018 Conte, Alessio; Ferraro, Gaspare; Grossi, Roberto; Marino, Andrea; Sadakane, Kunihiko; Uno, Takeaki
Combinatorial Algorithms for String Sanitization 1-gen-2020 Bernardini, G.; Chen, H.; Conte, A.; Grossi, R.; Loukides, G.; Pisanti, N.; Pissis, S. P.; Rosone, G.; Sweering, M.
D2K: Scalable Community Detection in Massive Networks via Small-Diameter K-Plexes 1-gen-2018 Conte, Alessio; DE MATTEIS, Tiziano; DE SENSI, Daniele; Grossi, Roberto; Marino, Andrea; Versari, Luca
Directing road networks by listing strong orientations 1-gen-2016 Conte, Alessio; Grossi, Roberto; Marino, Andrea; Rizzi, Romeo; Versari, Luca
Discovering K-Trusses in Large-Scale Networks 1-gen-2018 Conte, Alessio; DE SENSI, Daniele; Grossi, Roberto; Marino, Andrea; Versari, Luca
ECC: Heuristic algorithms for computing an Edge Clique Cover of a graph 1-gen-2019 Conte, Alessio; Grossi, Roberto; Marino, Andrea
Efficient enumeration of graph orientations with sources 1-gen-2018 Conte, Alessio; Grossi, Roberto; Marino, Andrea; Rizzi, Romeo
Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph 1-gen-2018 Conte, A.; Kante, M. M.; Otachi, Y.; Uno, T.; Wasa, K.
Efficient enumeration of maximal k-degenerate subgraphs in a chordal graph 1-gen-2017 Conte, Alessio; Kanté, Mamadou Moustapha; Otachi, Yota; Uno, Takeaki; Wasa, Kunihiro
Efficient enumeration of subgraphs and induced subgraphs with bounded girth 1-gen-2018 Kurita, Kazuhiro; Wasa, Kunihiro; Conte, Alessio; Uno, Takeaki; Arimura, Hiroki
Efficiently Clustering Very Large Attributed Graphs 1-gen-2017 Baroni, Alessandro; Conte, Alessio; Patrignani, Maurizio; Ruggieri, Salvatore
Enumerating Cyclic Orientations of a Graph 1-gen-2015 Conte, Alessio; Grossi, Roberto; Marino, Andrea; Rizzi, Romeo
Enumeration of Maximal Common Subsequences Between Two Strings 1-gen-2022 Conte, A.; Grossi, R.; Punzi, G.; Uno, T.