Sfoglia per Autore
Truly scalable K-Truss and max-truss algorithms for community detection in graphs
2020-01-01 Conte, A.; De Sensi, D.; Grossi, R.; Marino, A.; Versari, L.
Hide and Mine in Strings: Hardness and Algorithms
2020-01-01 Bernardini, Giulia; Conte, Alessio; Gourdel, Garance; Grossi, Roberto; Loukides, Grigorios; Pisanti, Nadia; Pissis, Solon; Punzi, Giulia; Stougie, Leen; Michelle Sweering, And
Enumeration of s-d separators in DAGs with application to reliability analysis in temporal graphs
2020-01-01 Conte, A.; Crescenzi, P.; Marino, A.; Punzi, G.
Zuckerli: A New Compressed Representation for Graphs
2020-01-01 Versari, L.; Comsa, I. -M.; Conte, A.; Grossi, R.
K-plex Cover Pooling for Graph Neural Networks
2020-01-01 Bacciu, Davide; Conte, Alessio; Grossi, Roberto; Landolfi, Francesco; Marino, Andrea
Large-scale clique cover of real-world networks
2020-01-01 Conte, A.; Grossi, R.; Marino, A.
A meta-algorithm for finding large k-plexes
2021-01-01 Conte, A.; Firmani, D.; Patrignani, M.; Torlone, R.
Overall and Delay Complexity of the CLIQUES and Bron-Kerbosch Algorithms
2021-01-01 Conte, A.; Tomita, E.
K-plex cover pooling for graph neural networks
2021-01-01 Bacciu, D.; Conte, A.; Grossi, R.; Landolfi, F.; Marino, A.
Beyond the BEST Theorem: Fast Assessment of Eulerian Trails
2021-01-01 Conte, A.; Grossi, R.; Loukides, G.; Pisanti, N.; Pissis, S. P.; Punzi, G.
On Breaking Truss-Based Communities
2021-01-01 Chen, H.; Conte, A.; Grossi, R.; Loukides, G.; Pissis, S. P.; Sweering, M.
Combinatorial Algorithms for String Sanitization
2021-01-01 Bernardini, G.; Chen, H.; Conte, A.; Grossi, R.; Loukides, G.; Pisanti, N.; Pissis, S. P.; Rosone, G.; Sweering, M.
On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms
2022-01-01 Conte, A.; Tomita, E.
PROXIMITY SEARCH FOR MAXIMAL SUBGRAPH ENUMERATION
2022-01-01 Conte, A; Grossi, R; Marino, A; Uno, T; Versari, L
Jaccard Median for Ego-network Segmentation
2022-01-01 Zhong, Hd; Loukides, G; Conte, A; Pissis, Sp
phyBWT: Alignment-Free Phylogeny via eBWT Positional Clustering
2022-01-01 Guerrini, V.; Conte, A.; Grossi, R.; Liti, G.; Rosone, G.; Tattini, L.
Enumeration of Maximal Common Subsequences Between Two Strings
2022-01-01 Conte, A.; Grossi, R.; Punzi, G.; Uno, T.
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
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
Hide and Mine in Strings: Hardness, Algorithms, and Experiments
2022-01-01 Bernardini, Giulia; Conte, Alessio; Gourdel, Garance; Grossi, Roberto; Loukides, Grigorios; Pisanti, Nadia; Pissis, Solon; Punzi, Giulia; Stougie, Leen; Sweering, Michelle
Titolo | Data di pubblicazione | Autore(i) | File |
---|---|---|---|
Truly scalable K-Truss and max-truss algorithms for community detection in graphs | 1-gen-2020 | Conte, A.; De Sensi, D.; Grossi, R.; Marino, A.; Versari, L. | |
Hide and Mine in Strings: Hardness and Algorithms | 1-gen-2020 | Bernardini, Giulia; Conte, Alessio; Gourdel, Garance; Grossi, Roberto; Loukides, Grigorios; Pisanti, Nadia; Pissis, Solon; Punzi, Giulia; Stougie, Leen; Michelle Sweering, And | |
Enumeration of s-d separators in DAGs with application to reliability analysis in temporal graphs | 1-gen-2020 | Conte, A.; Crescenzi, P.; Marino, A.; Punzi, G. | |
Zuckerli: A New Compressed Representation for Graphs | 1-gen-2020 | Versari, L.; Comsa, I. -M.; Conte, A.; Grossi, R. | |
K-plex Cover Pooling for Graph Neural Networks | 1-gen-2020 | Bacciu, Davide; Conte, Alessio; Grossi, Roberto; Landolfi, Francesco; Marino, Andrea | |
Large-scale clique cover of real-world networks | 1-gen-2020 | Conte, A.; Grossi, R.; Marino, A. | |
A meta-algorithm for finding large k-plexes | 1-gen-2021 | Conte, A.; Firmani, D.; Patrignani, M.; Torlone, R. | |
Overall and Delay Complexity of the CLIQUES and Bron-Kerbosch Algorithms | 1-gen-2021 | Conte, A.; Tomita, E. | |
K-plex cover pooling for graph neural networks | 1-gen-2021 | Bacciu, D.; Conte, A.; Grossi, R.; Landolfi, F.; Marino, A. | |
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. | |
On Breaking Truss-Based Communities | 1-gen-2021 | Chen, H.; Conte, A.; Grossi, R.; Loukides, G.; Pissis, S. P.; Sweering, M. | |
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. | |
On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms | 1-gen-2022 | Conte, A.; Tomita, E. | |
PROXIMITY SEARCH FOR MAXIMAL SUBGRAPH ENUMERATION | 1-gen-2022 | Conte, A; Grossi, R; Marino, A; Uno, T; Versari, L | |
Jaccard Median for Ego-network Segmentation | 1-gen-2022 | Zhong, Hd; Loukides, G; Conte, A; Pissis, Sp | |
phyBWT: Alignment-Free Phylogeny via eBWT Positional Clustering | 1-gen-2022 | Guerrini, V.; Conte, A.; Grossi, R.; Liti, G.; Rosone, G.; Tattini, L. | |
Enumeration of Maximal Common Subsequences Between Two Strings | 1-gen-2022 | Conte, A.; Grossi, R.; Punzi, G.; Uno, T. | |
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 | |
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 | |
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 |
Legenda icone
- file ad accesso aperto
- file disponibili sulla rete interna
- file disponibili agli utenti autorizzati
- file disponibili solo agli amministratori
- file sotto embargo
- nessun file disponibile