default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlessio Conte
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j21]Giulia Punzi, Alessio Conte, Roberto Grossi, Romeo Rizzi:
Refined Bounds on the Number of Eulerian Tours in Undirected Graphs. Algorithmica 86(1): 194-217 (2024)- [j20]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): 135:1-135:43 (2024) - [j19]Haodi Zhong, Grigorios Loukides, Alessio Conte, Solon P. Pissis:
Ego-Network Segmentation via (Weighted) Jaccard Median. IEEE Trans. Knowl. Data Eng. 36(9): 4646-4663 (2024) - [c49]Caroline Brosse, Alessio Conte, Vincent Limouzy, Giulia Punzi, Davide Rucci:
Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space. IWOCA 2024: 382-395 - [c48]Alessio Conte, Davide Rucci:
Are k-cores meaningful for temporal graph analysis? SAC 2024: 1453-1460 - [c47]Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Veronica Guerrini, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis:
Utility-Oriented String Mining. SDM 2024: 190-198 - [c46]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: 14:1-14:21 - [c45]Giovanni Buzzega, Alessio Conte, Roberto Grossi, Giulia Punzi:
McDag: Indexing Maximal Common Subsequences in Practice. WABI 2024: 21:1-21:18 - [i13]Caroline Brosse, Alessio Conte, Vincent Limouzy, Giulia Punzi, Davide Rucci:
Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space. CoRR abs/2402.18265 (2024) - [i12]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 abs/2405.13613 (2024) - 2023
- [j18]Veronica Guerrini, Alessio Conte, Roberto Grossi, Gianni Liti, Giovanna Rosone, Lorenzo Tattini:
phyBWT2: phylogeny reconstruction via eBWT positional clustering. Algorithms Mol. Biol. 18(1): 11 (2023) - [j17]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): 5948-5963 (2023) - [c44]Davide Bacciu, Alessio Conte, Francesco Landolfi:
Generalizing Downsampling from Regular Data to Graphs. AAAI 2023: 6718-6727 - [c43]Alessio Conte, Nicola Cotumaccio, Travis Gagie, Giovanni Manzini, Nicola Prezza, Marinella Sciortino:
Computing matching statistics on Wheeler DFAs. DCC 2023: 150-159 - [c42]Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno:
A Compact DAG for Storing and Searching Maximal Common Subsequences. ISAAC 2023: 21:1-21:15 - [c41]Giulia Punzi, Alessio Conte, Roberto Grossi, Andrea Marino:
An Efficient Algorithm for Assessing the Number of st-Paths in Large Graphs. SDM 2023: 289-297 - [c40]Alessio Conte, Roberto Grossi, Davide Rucci:
CAGE: Cache-Aware Graphlet Enumeration. SPIRE 2023: 129-142 - [i11]Alessio Conte, Nicola Cotumaccio, Travis Gagie, Giovanni Manzini, Nicola Prezza, Marinella Sciortino:
Computing matching statistics on Wheeler DFAs. CoRR abs/2301.05338 (2023) - [i10]Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno:
A Compact DAG for Storing and Searching Maximal Common Subsequences. CoRR abs/2307.13695 (2023) - 2022
- [j16]Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno:
Enumeration of Maximal Common Subsequences Between Two Strings. Algorithmica 84(3): 757-783 (2022) - [j15]Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca Versari:
Proximity Search for Maximal Subgraph Enumeration. SIAM J. Comput. 51(5): 1580-1625 (2022) - [j14]Alessio Conte, Etsuji Tomita:
On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms. Theor. Comput. Sci. 899: 1-24 (2022) - [j13]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): 9:1-9:49 (2022) - [c39]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: 16:1-16:17 - [c38]Haodi Zhong, Grigorios Loukides, Alessio Conte, Solon P. Pissis:
Jaccard Median for Ego-network Segmentation. ICDM 2022: 1353-1358 - [c37]Veronica Guerrini, Alessio Conte, Roberto Grossi, Gianni Liti, Giovanna Rosone, Lorenzo Tattini:
phyBWT: Alignment-Free Phylogeny via eBWT Positional Clustering. WABI 2022: 23:1-23:19 - [i9]Davide Bacciu, Alessio Conte, Francesco Landolfi:
Graph Pooling with Maximum-Weight k-Independent Sets. CoRR abs/2208.03523 (2022) - 2021
- [j12]Alessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, Kunihiro Wasa:
Maximal strongly connected cliques in directed graphs: Algorithms and bounds. Discret. Appl. Math. 303: 237-252 (2021) - [j11]Davide Bacciu, Alessio Conte, Roberto Grossi, Francesco Landolfi, Andrea Marino:
K-plex cover pooling for graph neural networks. Data Min. Knowl. Discov. 35(5): 2200-2220 (2021) - [j10]Alessio Conte, Donatella Firmani, Maurizio Patrignani, Riccardo Torlone:
A meta-algorithm for finding large k-plexes. Knowl. Inf. Syst. 63(7): 1745-1769 (2021) - [j9]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): 8:1-8:34 (2021) - [c36]Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi:
Beyond the BEST Theorem: Fast Assessment of Eulerian Trails. FCT 2021: 162-175 - [c35]Huiping Chen, Alessio Conte, Roberto Grossi, Grigorios Loukides, Solon P. Pissis, Michelle Sweering:
On Breaking Truss-Based Communities. KDD 2021: 117-126 - [c34]Alessio Conte, Etsuji Tomita:
Overall and Delay Complexity of the CLIQUES and Bron-Kerbosch Algorithms. WALCOM 2021: 195-207 - 2020
- [j8]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: 139096-139109 (2020) - [j7]Luca Versari, Iulia-Maria Comsa, Alessio Conte, Roberto Grossi:
Zuckerli: A New Compressed Representation for Graphs. IEEE Access 8: 219233-219243 (2020) - [j6]Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari:
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs. Algorithmica 82(6): 1547-1573 (2020) - [j5]Alessio Conte, Roberto Grossi, Andrea Marino:
Large-scale clique cover of real-world networks. Inf. Comput. 270 (2020) - [j4]Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa:
Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph. Theor. Comput. Sci. 818: 2-11 (2020) - [c33]Mai Alzamel, Alessio Conte, Shuhei Denzumi, Roberto Grossi, Costas S. Iliopoulos, Kazuhiro Kurita, Kunihiro Wasa:
Finding the Anticover of a String. CPM 2020: 2:1-2:11 - [c32]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: 924-929 - [c31]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: 25:1-25:14 - [c30]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 - [i8]Luca Versari, Iulia M. Comsa, Alessio Conte, Roberto Grossi:
Zuckerli: A New Compressed Representation for Graphs. CoRR abs/2009.01353 (2020) - [i7]Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari:
Efficient Estimation of Graph Trussness. CoRR abs/2010.00967 (2020)
2010 – 2019
- 2019
- [j3]Alessio Conte, Roberto Grossi, Andrea Marino, Lorenzo Tattini, Luca Versari:
A fast discovery algorithm for large common connected induced subgraphs. Discret. Appl. Math. 268: 210-222 (2019) - [j2]Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari:
Listing Maximal Subgraphs Satisfying Strongly Accessible Properties. SIAM J. Discret. Math. 33(2): 587-613 (2019) - [c29]Alessio Conte, Donatella Firmani, Maurizio Patrignani, Riccardo Torlone:
Shared-Nothing Distributed Enumeration of 2-Plexes. CIKM 2019: 2469-2472 - [c28]Alessio Conte, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno:
Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs. IWOCA 2019: 148-159 - [c27]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: 73:1-73:14 - [c26]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: 627-644 - [c25]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: 175-188 - [c24]Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno:
Polynomial-Delay Enumeration of Maximal Common Subsequences. SPIRE 2019: 189-202 - [c23]Alessio Conte, Takeaki Uno:
New polynomial delay bounds for maximal subgraph enumeration by proximity search. STOC 2019: 1179-1190 - [i6]Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
String Sanitization: A Combinatorial Approach. CoRR abs/1906.11030 (2019) - [i5]Alessio Conte, Andrea Marino, Roberto Grossi, Takeaki Uno, Luca Versari:
Proximity Search For Maximal Subgraph Enumeration. CoRR abs/1912.13446 (2019) - 2018
- [b1]Alessio Conte:
Enumeration Algorithms for Real-World Networks: Efficiency and Beyond. University of Pisa, Italy, 2018 - [j1]Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi:
Efficient enumeration of graph orientations with sources. Discret. Appl. Math. 246: 22-37 (2018) - [c22]Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari:
Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search. COCOON 2018: 328-340 - [c21]Alessio Conte, Daniele De Sensi, Roberto Grossi, Andrea Marino, Luca Versari:
Discovering $k$-Trusses in Large-Scale Networks. HPEC 2018: 1-6 - [c20]Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Takeaki Uno, Hiroki Arimura:
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. IWOCA 2018: 201-213 - [c19]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: 1272-1281 - [c18]Alessio Conte, Gaspare Ferraro, Roberto Grossi, Andrea Marino, Kunihiko Sadakane, Takeaki Uno:
Node Similarity with q -Grams for Real-World Labeled Networks. KDD 2018: 1282-1291 - [c17]Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari:
Listing Subgraphs by Cartesian Decomposition. MFCS 2018: 84:1-84:16 - [c16]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 - [c15]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: 100-110 - [i4]Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari:
Listing Maximal Subgraphs in Strongly Accessible Set Systems. CoRR abs/1803.03659 (2018) - [i3]Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Hiroki Arimura, Takeaki Uno:
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. CoRR abs/1806.04307 (2018) - 2017
- [c14]Alessio Conte, Roberto Grossi, Andrea Marino, Lorenzo Tattini, Luca Versari:
A Fast Algorithm for Large Common Connected Induced Subgraphs. AlCoB 2017: 62-74 - [c13]Alessandro Baroni, Alessio Conte, Maurizio Patrignani, Salvatore Ruggieri:
Efficiently Clustering Very Large Attributed Graphs. ASONAM 2017: 369-376 - [c12]Alessio Conte, Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno:
Listing Acyclic Subgraphs and Subgraphs of Bounded Girth in Directed Graphs. COCOA (2) 2017: 169-181 - [c11]Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa:
Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph. COCOON 2017: 150-161 - [c10]Alessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, Kunihiro Wasa:
On Maximal Cliques with Connectivity Constraints in Directed Graphs. ISAAC 2017: 23:1-23:13 - [c9]Alessio Conte, Donatella Firmani, Caterina Mordente, Maurizio Patrignani, Riccardo Torlone:
Fast Enumeration of Large k-Plexes. KDD 2017: 115-124 - [c8]Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca Versari:
Listing Maximal Independent Sets with Minimal Space and Bounded Delay. SPIRE 2017: 144-160 - [i2]Alessandro Baroni, Alessio Conte, Maurizio Patrignani, Salvatore Ruggieri:
Efficiently Clustering Very Large Attributed Graphs. CoRR abs/1703.08590 (2017) - 2016
- [c7]Alessio Conte, Roberto De Virgilio, Antonio Maccioni, Maurizio Patrignani, Riccardo Torlone:
Finding All Maximal Cliques in Very Large Social Networks. EDBT 2016: 173-184 - [c6]Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari:
Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques. ICALP 2016: 148:1-148:15 - [c5]Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari:
Directing Road Networks by Listing Strong Orientations. IWOCA 2016: 83-95 - [c4]Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi:
Listing Acyclic Orientations of Graphs with Single and Multiple Sources. LATIN 2016: 319-333 - [c3]Alessio Conte, Roberto Grossi, Andrea Marino:
Clique covering of large real-world networks. SAC 2016: 1134-1139 - [c2]Alessio Conte, Roberto De Virgilio, Antonio Maccioni, Maurizio Patrignani, Riccardo Torlone:
Community Detection in Social Networks: Breaking the Taboos. SEBD 2016: 118-125 - 2015
- [c1]Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi:
Enumerating Cyclic Orientations of a Graph. IWOCA 2015: 88-99 - [i1]Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi:
Enumerating Cyclic Orientations of a Graph. CoRR abs/1506.05977 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
