Alessio Conte

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 81

Top Topics

Conjunctive Queries

Community Detection

Top Venues

Publications

Haodi Zhong, Grigorios Loukides, Alessio Conte, Solon P. Pissis
Ego-Network Segmentation via (Weighted) Jaccard Median. IEEE Trans. Knowl. Data Eng. 36 (9) (2024)
Rocco Ascone, Giulia Bernardini, Alessio Conte, Massimo Equi, Estéban Gabory, Roberto Grossi, Nadia Pisanti
A Unifying Taxonomy of Pattern Matching in Degenerate Strings and Founder Graphs. WABI (2024)
Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Veronica Guerrini, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis
Utility-Oriented String Mining. SDM (2024)
Giulia Punzi, Alessio Conte, Roberto Grossi, Romeo Rizzi
Refined Bounds on the Number of Eulerian Tours in Undirected Graphs. Algorithmica 86 (1) (2024)
Alessio Conte, Davide Rucci
Are k-cores meaningful for temporal graph analysis? SAC (2024)
Caroline Brosse, Alessio Conte, Vincent Limouzy, Giulia Punzi, Davide Rucci
Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space. IWOCA (2024)
Caroline Brosse, Alessio Conte, Vincent Limouzy, Giulia Punzi, Davide Rucci
Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space. CoRR (2024)
Huiping Chen, Alessio Conte, Roberto Grossi, Grigorios Loukides, Solon P. Pissis, Michelle Sweering
On Breaking Truss-based and Core-based Communities. ACM Trans. Knowl. Discov. Data 18 (6) (2024)
Giovanni Buzzega, Alessio Conte, Roberto Grossi, Giulia Punzi
McDag: Indexing Maximal Common Subsequences in Practice. WABI (2024)
Alessio Conte, Roberto Grossi, Yasuaki Kobayashi, Kazuhiro Kurita, Davide Rucci, Takeaki Uno, Kunihiro Wasa
Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size. CoRR (2024)
Giulia Bernardini, Alessio Conte, Garance Gourdel, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi, Leen Stougie, Michelle Sweering
Hide and Mine in Strings: Hardness, Algorithms, and Experiments. IEEE Trans. Knowl. Data Eng. 35 (6) (2023)
Giulia Punzi, Alessio Conte, Roberto Grossi, Andrea Marino
-Paths in Large Graphs. SDM (2023)
Alessio Conte, Nicola Cotumaccio, Travis Gagie, Giovanni Manzini, Nicola Prezza, Marinella Sciortino
Computing matching statistics on Wheeler DFAs. DCC (2023)
Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno
A Compact DAG for Storing and Searching Maximal Common Subsequences. ISAAC (2023)
Veronica Guerrini, Alessio Conte, Roberto Grossi, Gianni Liti, Giovanna Rosone, Lorenzo Tattini
phyBWT2: phylogeny reconstruction via eBWT positional clustering. Algorithms Mol. Biol. 18 (1) (2023)
Davide Bacciu, Alessio Conte, Francesco Landolfi
Generalizing Downsampling from Regular Data to Graphs. AAAI (2023)
Alessio Conte, Roberto Grossi, Davide Rucci
CAGE: Cache-Aware Graphlet Enumeration. SPIRE (2023)
Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno
A Compact DAG for Storing and Searching Maximal Common Subsequences. CoRR (2023)
Alessio Conte, Nicola Cotumaccio, Travis Gagie, Giovanni Manzini, Nicola Prezza, Marinella Sciortino
Computing matching statistics on Wheeler DFAs. CoRR (2023)
Haodi Zhong, Grigorios Loukides, Alessio Conte, Solon P. Pissis
Jaccard Median for Ego-network Segmentation. ICDM (2022)
Davide Bacciu, Alessio Conte, Francesco Landolfi
Graph Pooling with Maximum-Weight k-Independent Sets. CoRR (2022)
Alessio Conte, Etsuji Tomita
On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms. Theor. Comput. Sci. 899 (2022)
Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca Versari
Proximity Search for Maximal Subgraph Enumeration. SIAM J. Comput. 51 (5) (2022)
Giulia Bernardini, Alessio Conte, Estéban Gabory, Roberto Grossi, Grigorios Loukides, Solon P. Pissis, Giulia Punzi, Michelle Sweering
On Strings Having the Same Length- k Substrings. CPM (2022)
Veronica Guerrini, Alessio Conte, Roberto Grossi, Gianni Liti, Giovanna Rosone, Lorenzo Tattini
phyBWT: Alignment-Free Phylogeny via eBWT Positional Clustering. WABI (2022)
Nofar Carmeli, Shai Zeevi, Christoph Berkholz, Alessio Conte, Benny Kimelfeld, Nicole Schweikardt
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration. ACM Trans. Database Syst. 47 (3) (2022)
Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno
Enumeration of Maximal Common Subsequences Between Two Strings. Algorithmica 84 (3) (2022)
Huiping Chen, Alessio Conte, Roberto Grossi, Grigorios Loukides, Solon P. Pissis, Michelle Sweering
On Breaking Truss-Based Communities. KDD (2021)
Alessio Conte, Etsuji Tomita
Overall and Delay Complexity of the CLIQUES and Bron-Kerbosch Algorithms. WALCOM (2021)
Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi
Beyond the BEST Theorem: Fast Assessment of Eulerian Trails. FCT (2021)
Alessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, Kunihiro Wasa
Maximal strongly connected cliques in directed graphs: Algorithms and bounds. Discret. Appl. Math. 303 (2021)
Alessio Conte, Donatella Firmani, Maurizio Patrignani, Riccardo Torlone
A meta-algorithm for finding large k-plexes. Knowl. Inf. Syst. 63 (7) (2021)
Davide Bacciu, Alessio Conte, Roberto Grossi, Francesco Landolfi, Andrea Marino
K-plex cover pooling for graph neural networks. Data Min. Knowl. Discov. 35 (5) (2021)
Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone, Michelle Sweering
Combinatorial Algorithms for String Sanitization. ACM Trans. Knowl. Discov. Data 15 (1) (2021)
Luca Versari, Iulia-Maria Comsa, Alessio Conte, Roberto Grossi
Zuckerli: A New Compressed Representation for Graphs. IEEE Access 8 (2020)
Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa
-degenerate induced subgraphs of a chordal graph. Theor. Comput. Sci. 818 (2020)
Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs. Algorithmica 82 (6) (2020)
Alessio Conte, Pierluigi Crescenzi, Andrea Marino, Giulia Punzi
Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs. MFCS (2020)
Alessio Conte, Roberto Grossi, Andrea Marino
Large-scale clique cover of real-world networks. Inf. Comput. 270 (2020)
Giulia Bernardini, Alessio Conte, Garance Gourdel, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi, Leen Stougie, Michelle Sweering
Hide and Mine in Strings: Hardness and Algorithms. ICDM (2020)
Daniela Schenone, Rita Lai, Michele Cea, Federica Rossi, Lorenzo Torri, Bianca Bignotti, Giulia Succio, Stefano Gualco, Alessio Conte, Alida Dominietto, Anna Maria Massone, Michele Piana, Cristina Campi, Francesco Frassoni, Gianmario Sambuceti, Alberto Tagliafico
Radiomics and artificial intelligence analysis of CT data for the identification of prognostic features in multiple myeloma. Medical Imaging: Computer-Aided Diagnosis (2020)
Luca Versari, Iulia M. Comsa, Alessio Conte, Roberto Grossi
Zuckerli: A New Compressed Representation for Graphs. CoRR (2020)
Alessio Conte, Daniele De Sensi, Roberto Grossi, Andrea Marino, Luca Versari
Truly Scalable K-Truss and Max-Truss Algorithms for Community Detection in Graphs. IEEE Access 8 (2020)
Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari
Efficient Estimation of Graph Trussness. CoRR (2020)
Mai Alzamel, Alessio Conte, Shuhei Denzumi, Roberto Grossi, Costas S. Iliopoulos, Kazuhiro Kurita, Kunihiro Wasa
Finding the Anticover of a String. CPM (2020)
Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno
Polynomial-Delay Enumeration of Maximal Common Subsequences. SPIRE (2019)
Alessio Conte, Roberto Grossi, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno, Kunihiro Wasa
Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs. MFCS (2019)
Alessio Conte, Andrea Marino, Roberto Grossi, Takeaki Uno, Luca Versari
Proximity Search For Maximal Subgraph Enumeration. CoRR (2019)
Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone
String Sanitization: A Combinatorial Approach. ECML/PKDD (1) (2019)
Alessio Conte, Takeaki Uno
New polynomial delay bounds for maximal subgraph enumeration by proximity search. STOC (2019)
Alessio Conte, Donatella Firmani, Maurizio Patrignani, Riccardo Torlone
Shared-Nothing Distributed Enumeration of 2-Plexes. CIKM (2019)
Alessio Conte, Roberto Grossi, Andrea Marino, Lorenzo Tattini, Luca Versari
A fast discovery algorithm for large common connected induced subgraphs. Discret. Appl. Math. 268 (2019)
Alessio Conte, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno
Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs. IWOCA (2019)
Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari
Listing Maximal Subgraphs Satisfying Strongly Accessible Properties. SIAM J. Discret. Math. 33 (2) (2019)
Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone
String Sanitization: A Combinatorial Approach. CoRR (2019)
Mai Alzamel, Alessio Conte, Daniele Greco, Veronica Guerrini, Costas S. Iliopoulos, Nadia Pisanti, Nicola Prezza, Giulia Punzi, Giovanna Rosone
Online Algorithms on Antipowers and Antiperiods. SPIRE (2019)
Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Hiroki Arimura, Takeaki Uno
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. CoRR (2018)
Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari
Listing Maximal Subgraphs in Strongly Accessible Set Systems. CoRR (2018)
Alessio Conte, Tiziano De Matteis, Daniele De Sensi, Roberto Grossi, Andrea Marino, Luca Versari
D2K: Scalable Community Detection in Massive Networks via Small-Diameter k-Plexes. KDD (2018)
Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari
Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search. COCOON (2018)
Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Takeaki Uno, Hiroki Arimura
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. IWOCA (2018)
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Takeaki Uno, Luca Versari
Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts. WG (2018)
Alessio Conte, Donatella Firmani, Caterina Mordente, Maurizio Patrignani, Riccardo Torlone
Cliques are Too Strict for Representing Communities: Finding Large k-plexes in Real Networks. SEBD (2018)
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi
Efficient enumeration of graph orientations with sources. Discret. Appl. Math. 246 (2018)
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari
Listing Subgraphs by Cartesian Decomposition. MFCS (2018)
Alessio Conte, Daniele De Sensi, Roberto Grossi, Andrea Marino, Luca Versari
Discovering $k$-Trusses in Large-Scale Networks. HPEC (2018)
Alessio Conte, Gaspare Ferraro, Roberto Grossi, Andrea Marino, Kunihiko Sadakane, Takeaki Uno
Node Similarity with q -Grams for Real-World Labeled Networks. KDD (2018)
Alessandro Baroni, Alessio Conte, Maurizio Patrignani, Salvatore Ruggieri
Efficiently Clustering Very Large Attributed Graphs. ASONAM (2017)
Alessio Conte, Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno
Listing Acyclic Subgraphs and Subgraphs of Bounded Girth in Directed Graphs. COCOA (2) (2017)
Alessio Conte, Roberto Grossi, Andrea Marino, Lorenzo Tattini, Luca Versari
A Fast Algorithm for Large Common Connected Induced Subgraphs. AlCoB (2017)
Alessandro Baroni, Alessio Conte, Maurizio Patrignani, Salvatore Ruggieri
Efficiently Clustering Very Large Attributed Graphs. CoRR (2017)
Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa
Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph. COCOON (2017)
Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca Versari
Listing Maximal Independent Sets with Minimal Space and Bounded Delay. SPIRE (2017)
Alessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, Kunihiro Wasa
On Maximal Cliques with Connectivity Constraints in Directed Graphs. ISAAC (2017)
Alessio Conte, Donatella Firmani, Caterina Mordente, Maurizio Patrignani, Riccardo Torlone
Fast Enumeration of Large k-Plexes. KDD (2017)
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi
Listing Acyclic Orientations of Graphs with Single and Multiple Sources. LATIN (2016)
Alessio Conte, Roberto De Virgilio, Antonio Maccioni, Maurizio Patrignani, Riccardo Torlone
Community Detection in Social Networks: Breaking the Taboos. SEBD (2016)
Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari
Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques. ICALP (2016)
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari
Directing Road Networks by Listing Strong Orientations. IWOCA (2016)
Alessio Conte, Roberto De Virgilio, Antonio Maccioni, Maurizio Patrignani, Riccardo Torlone
Finding All Maximal Cliques in Very Large Social Networks. EDBT (2016)
Alessio Conte, Roberto Grossi, Andrea Marino
Clique covering of large real-world networks. SAC (2016)
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi
Enumerating Cyclic Orientations of a Graph. IWOCA (2015)
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi
Enumerating Cyclic Orientations of a Graph. CoRR (2015)