CONTE, ALESSIO Statistiche

CONTE, ALESSIO  

DIPARTIMENTO DI INFORMATICA  

Mostra records
Risultati 1 - 20 di 66 (tempo di esecuzione: 0.059 secondi).
Titolo Data di pubblicazione Autore(i) File
An Efficient Algorithm for Assessing the Number of st-Paths in Large Graphs 1-gen-2023 Punzi, Giulia; Conte, Alessio; Grossi, Roberto; Marino, Andrea
CAGE: Cache-Aware Graphlet Enumeration 1-gen-2023 Conte, Alessio; Grossi, Roberto; Rucci, Davide
Computing matching statistics on Wheeler DFAs 1-gen-2023 Conte, A.; Cotumaccio, N.; Gagie, T.; Manzini, G.; Prezza, N.; Sciortino, M.
Generalizing Downsampling from Regular Data to Graphs 1-gen-2023 Bacciu, Davide; Conte, Alessio; Landolfi, Francesco
phyBWT2: phylogeny reconstruction via eBWT positional clustering 1-gen-2023 Guerrini, V.; Conte, A.; Grossi, R.; Liti, G.; Rosone, G.; Tattini, L.
Refined Bounds on the Number of Eulerian Tours in Undirected Graphs 1-gen-2023 Punzi, G; Conte, A; Grossi, R; Rizzi, R
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration 1-gen-2022 Carmeli, N; Zeevi, S; Berkholz, C; Conte, A; Kimelfeld, B; Schweikardt, N
Enumeration of Maximal Common Subsequences Between Two Strings 1-gen-2022 Conte, A.; Grossi, R.; Punzi, G.; Uno, T.
Hide and Mine in Strings: Hardness, Algorithms, and Experiments 1-gen-2022 Bernardini, Giulia; Conte, Alessio; Gourdel, Garance; Grossi, Roberto; Loukides, Grigorios; Pisanti, Nadia; Pissis, Solon; Punzi, Giulia; Stougie, Leen; Sweering, Michelle
Jaccard Median for Ego-network Segmentation 1-gen-2022 Zhong, Hd; Loukides, G; Conte, A; Pissis, Sp
On Strings Having the Same Length- k Substrings 1-gen-2022 Bernardini, Giulia; Conte, Alessio; Gabory, Esteban; Grossi, Roberto; Loukides, Grigorios; Pissis, Solon P.; Punzi, Giulia; Sweering, Michelle
On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms 1-gen-2022 Conte, A.; Tomita, E.
phyBWT: Alignment-Free Phylogeny via eBWT Positional Clustering 1-gen-2022 Guerrini, V.; Conte, A.; Grossi, R.; Liti, G.; Rosone, G.; Tattini, L.
PROXIMITY SEARCH FOR MAXIMAL SUBGRAPH ENUMERATION 1-gen-2022 Conte, A; Grossi, R; Marino, A; Uno, T; Versari, L
A meta-algorithm for finding large k-plexes 1-gen-2021 Conte, A.; Firmani, D.; Patrignani, M.; Torlone, R.
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.
Combinatorial Algorithms for String Sanitization 1-gen-2021 Bernardini, G.; Chen, H.; Conte, A.; Grossi, R.; Loukides, G.; Pisanti, N.; Pissis, S. P.; Rosone, G.; Sweering, M.
K-plex cover pooling for graph neural networks 1-gen-2021 Bacciu, D.; Conte, A.; Grossi, R.; Landolfi, F.; Marino, A.
On Breaking Truss-Based Communities 1-gen-2021 Chen, H.; Conte, A.; Grossi, R.; Loukides, G.; Pissis, S. P.; Sweering, M.
Overall and Delay Complexity of the CLIQUES and Bron-Kerbosch Algorithms 1-gen-2021 Conte, A.; Tomita, E.