CONTE, ALESSIO Statistiche
CONTE, ALESSIO
DIPARTIMENTO DI INFORMATICA
A Unifying Taxonomy of Pattern Matching in Degenerate Strings and Founder Graphs
2024-01-01 Ascone, Rocco; Bernardini, Giulia; Conte, Alessio; Equi, Massimo; Gabory, Esteban; Grossi, Roberto; Pisanti, Nadia
Are k-cores meaningful for temporal graph analysis?
2024-01-01 Conte, A.; Rucci, D.
Ego-Network Segmentation via (Weighted) Jaccard Median
2024-01-01 Zhong, Haodi; Loukides, Grigorios; Conte, Alessio; Pissis, Solon P.
McDag: Indexing Maximal Common Subsequences in Practice
2024-01-01 Buzzega, Giovanni; Conte, Alessio; Grossi, Roberto; Punzi, Giulia
On Breaking Truss-based and Core-based Communities
2024-01-01 Chen, Huiping; Conte, Alessio; Grossi, Roberto; Loukides, Grigorios; Pissis, Solon P.; Sweering, Michelle
Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space
2024-01-01 Brosse, Caroline; Conte, Alessio; Limouzy, Vincent; Punzi, Giulia; Rucci, Davide
Refined Bounds on the Number of Eulerian Tours in Undirected Graphs
2024-01-01 Punzi, G; Conte, A; Grossi, R; Rizzi, R
Utility-Oriented String Mining
2024-01-01 Bernardini, G.; Chen, H.; Conte, A.; Grossi, R.; Guerrini, V.; Loukides, G.; Pisanti, N.; Pissis, S. P.
A Compact DAG for Storing and Searching Maximal Common Subsequences
2023-01-01 Conte, Alessio; Grossi, Roberto; Punzi, Giulia; Uno, Takeaki
An Efficient Algorithm for Assessing the Number of st-Paths in Large Graphs
2023-01-01 Punzi, Giulia; Conte, Alessio; Grossi, Roberto; Marino, Andrea
CAGE: Cache-Aware Graphlet Enumeration
2023-01-01 Conte, Alessio; Grossi, Roberto; Rucci, Davide
Computing matching statistics on Wheeler DFAs
2023-01-01 Conte, A.; Cotumaccio, N.; Gagie, T.; Manzini, G.; Prezza, N.; Sciortino, M.
Generalizing Downsampling from Regular Data to Graphs
2023-01-01 Bacciu, Davide; Conte, Alessio; Landolfi, Francesco
Hide and Mine in Strings: Hardness, Algorithms, and Experiments
2023-01-01 Bernardini, Giulia; Conte, Alessio; Gourdel, Garance; Grossi, Roberto; Loukides, Grigorios; Pisanti, Nadia; Pissis, Solon; Punzi, Giulia; Stougie, Leen; Sweering, Michelle
phyBWT2: phylogeny reconstruction via eBWT positional clustering
2023-01-01 Guerrini, V.; Conte, A.; Grossi, R.; Liti, G.; Rosone, G.; Tattini, L.
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration
2022-01-01 Carmeli, N; Zeevi, S; Berkholz, C; Conte, A; Kimelfeld, B; Schweikardt, N
Enumeration of Maximal Common Subsequences Between Two Strings
2022-01-01 Conte, A.; Grossi, R.; Punzi, G.; Uno, T.
Jaccard Median for Ego-network Segmentation
2022-01-01 Zhong, Hd; Loukides, G; Conte, A; Pissis, Sp
On Strings Having the Same Length- k Substrings
2022-01-01 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
2022-01-01 Conte, A.; Tomita, E.
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| A Unifying Taxonomy of Pattern Matching in Degenerate Strings and Founder Graphs | 1-gen-2024 | Ascone, Rocco; Bernardini, Giulia; Conte, Alessio; Equi, Massimo; Gabory, Esteban; Grossi, Roberto; Pisanti, Nadia | |
| Are k-cores meaningful for temporal graph analysis? | 1-gen-2024 | Conte, A.; Rucci, D. | |
| Ego-Network Segmentation via (Weighted) Jaccard Median | 1-gen-2024 | Zhong, Haodi; Loukides, Grigorios; Conte, Alessio; Pissis, Solon P. | |
| McDag: Indexing Maximal Common Subsequences in Practice | 1-gen-2024 | Buzzega, Giovanni; Conte, Alessio; Grossi, Roberto; Punzi, Giulia | |
| On Breaking Truss-based and Core-based Communities | 1-gen-2024 | Chen, Huiping; Conte, Alessio; Grossi, Roberto; Loukides, Grigorios; Pissis, Solon P.; Sweering, Michelle | |
| Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space | 1-gen-2024 | Brosse, Caroline; Conte, Alessio; Limouzy, Vincent; Punzi, Giulia; Rucci, Davide | |
| Refined Bounds on the Number of Eulerian Tours in Undirected Graphs | 1-gen-2024 | Punzi, G; Conte, A; Grossi, R; Rizzi, R | |
| Utility-Oriented String Mining | 1-gen-2024 | Bernardini, G.; Chen, H.; Conte, A.; Grossi, R.; Guerrini, V.; Loukides, G.; Pisanti, N.; Pissis, S. P. | |
| A Compact DAG for Storing and Searching Maximal Common Subsequences | 1-gen-2023 | Conte, Alessio; Grossi, Roberto; Punzi, Giulia; Uno, Takeaki | |
| 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 | |
| Hide and Mine in Strings: Hardness, Algorithms, and Experiments | 1-gen-2023 | Bernardini, Giulia; Conte, Alessio; Gourdel, Garance; Grossi, Roberto; Loukides, Grigorios; Pisanti, Nadia; Pissis, Solon; Punzi, Giulia; Stougie, Leen; Sweering, Michelle | |
| phyBWT2: phylogeny reconstruction via eBWT positional clustering | 1-gen-2023 | Guerrini, V.; Conte, A.; Grossi, R.; Liti, G.; Rosone, G.; Tattini, L. | |
| 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. | |
| 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. |