Alessio Conte

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