Alessio Conte
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
44
Venues
24
Active years
2015–2026
Best venue rank
A*
Where they publish
- CIWOCA5 papers
- CSPIRE4 papers
- A*KDD4 papers
- CWABI3 papers
- BMFCS3 papers
- MulticonferenceSAC2 papers
- ASDM2 papers
- BISAAC2 papers
- BCPM2 papers
- A*ICDM2 papers
- NationalCOCOON2 papers
- A*PODS1 paper
- A*ICDE1 paper
- A*AAAI1 paper
- BDCC1 paper
- BFCT1 paper
- BWALCOM1 paper
- ACIKM1 paper
- A*STOC1 paper
- BWG1 paper
- CCOCOA1 paper
- BEDBT1 paper
- A*ICALP1 paper
- BLATIN1 paper
Papers
44 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | PODS | Enumeration Theory through the Lens of Database Challenges. | Florent Capelli, Nofar Carmeli, Alessio Conte, Benny Kimelfeld, Reinhard Pichler, Nikolaos Tziavelis |
| 2025 | ICDE | Indexing Strings with Utilities. | Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Veronica Guerrini, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis |
| 2024 | IWOCA | Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space. | Caroline Brosse, Alessio Conte, Vincent Limouzy, Giulia Punzi, Davide Rucci |
| 2024 | SAC | Are k-cores meaningful for temporal graph analysis? | Alessio Conte, Davide Rucci |
| 2024 | SDM | Utility-Oriented String Mining. | Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Veronica Guerrini, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis |
| 2024 | WABI | A Unifying Taxonomy of Pattern Matching in Degenerate Strings and Founder Graphs. | Rocco Ascone, Giulia Bernardini, Alessio Conte, Massimo Equi, Estban Gabory, Roberto Grossi, Nadia Pisanti |
| 2024 | WABI | McDag: Indexing Maximal Common Subsequences in Practice. | Giovanni Buzzega, Alessio Conte, Roberto Grossi, Giulia Punzi |
| 2023 | AAAI | Generalizing Downsampling from Regular Data to Graphs. | Davide Bacciu, Alessio Conte, Francesco Landolfi |
| 2023 | DCC | Computing matching statistics on Wheeler DFAs. | Alessio Conte, Nicola Cotumaccio, Travis Gagie, Giovanni Manzini, Nicola Prezza, Marinella Sciortino |
| 2023 | ISAAC | A Compact DAG for Storing and Searching Maximal Common Subsequences. | Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno |
| 2023 | SDM | An Efficient Algorithm for Assessing the Number of | Giulia Punzi, Alessio Conte, Roberto Grossi, Andrea Marino |
| 2023 | SPIRE | CAGE: Cache-Aware Graphlet Enumeration. | Alessio Conte, Roberto Grossi, Davide Rucci |
| 2022 | CPM | On Strings Having the Same Length- k Substrings. | Giulia Bernardini, Alessio Conte, Estban Gabory, Roberto Grossi, Grigorios Loukides, Solon P. Pissis, Giulia Punzi, Michelle Sweering |
| 2022 | ICDM | Jaccard Median for Ego-network Segmentation. | Haodi Zhong, Grigorios Loukides, Alessio Conte, Solon P. Pissis |
| 2022 | WABI | phyBWT: Alignment-Free Phylogeny via eBWT Positional Clustering. | Veronica Guerrini, Alessio Conte, Roberto Grossi, Gianni Liti, Giovanna Rosone, Lorenzo Tattini |
| 2021 | FCT | Beyond the BEST Theorem: Fast Assessment of Eulerian Trails. | Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi |
| 2021 | KDD | On Breaking Truss-Based Communities. | Huiping Chen, Alessio Conte, Roberto Grossi, Grigorios Loukides, Solon P. Pissis, Michelle Sweering |
| 2021 | WALCOM | Overall and Delay Complexity of the CLIQUES and Bron-Kerbosch Algorithms. | Alessio Conte, Etsuji Tomita |
| 2020 | CPM | Finding the Anticover of a String. | Mai Alzamel, Alessio Conte, Shuhei Denzumi, Roberto Grossi, Costas S. Iliopoulos, Kazuhiro Kurita, Kunihiro Wasa |
| 2020 | ICDM | Hide and Mine in Strings: Hardness and Algorithms. | Giulia Bernardini, Alessio Conte, Garance Gourdel, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi, Leen Stougie, Michelle Sweering |
| 2020 | MFCS | Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs. | Alessio Conte, Pierluigi Crescenzi, Andrea Marino, Giulia Punzi |
| 2019 | CIKM | Shared-Nothing Distributed Enumeration of 2-Plexes. | Alessio Conte, Donatella Firmani, Maurizio Patrignani, Riccardo Torlone |
| 2019 | IWOCA | Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs. | Alessio Conte, Mamadou Moustapha Kant, Andrea Marino, Takeaki Uno |
| 2019 | MFCS | Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs. | Alessio Conte, Roberto Grossi, Mamadou Moustapha Kant, Andrea Marino, Takeaki Uno, Kunihiro Wasa |
| 2019 | STOC | New polynomial delay bounds for maximal subgraph enumeration by proximity search. | Alessio Conte, Takeaki Uno |
| 2019 | SPIRE | Online Algorithms on Antipowers and Antiperiods. | Mai Alzamel, Alessio Conte, Daniele Greco, Veronica Guerrini, Costas S. Iliopoulos, Nadia Pisanti, Nicola Prezza, Giulia Punzi, Giovanna Rosone |
| 2019 | SPIRE | Polynomial-Delay Enumeration of Maximal Common Subsequences. | Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno |
| 2018 | COCOON | Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search. | Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari |
| 2018 | IWOCA | Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. | Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Takeaki Uno, Hiroki Arimura |
| 2018 | KDD | Node Similarity with q -Grams for Real-World Labeled Networks. | Alessio Conte, Gaspare Ferraro, Roberto Grossi, Andrea Marino, Kunihiko Sadakane, Takeaki Uno |
| 2018 | KDD | D2K: Scalable Community Detection in Massive Networks via Small-Diameter k-Plexes. | Alessio Conte, Tiziano De Matteis, Daniele De Sensi, Roberto Grossi, Andrea Marino, Luca Versari |
| 2018 | MFCS | Listing Subgraphs by Cartesian Decomposition. | Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari |
| 2018 | WG | Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts. | Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Takeaki Uno, Luca Versari |
| 2017 | COCOA | Listing Acyclic Subgraphs and Subgraphs of Bounded Girth in Directed Graphs. | Alessio Conte, Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno |
| 2017 | COCOON | Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph. | Alessio Conte, Mamadou Moustapha Kant, Yota Otachi, Takeaki Uno, Kunihiro Wasa |
| 2017 | ISAAC | On Maximal Cliques with Connectivity Constraints in Directed Graphs. | Alessio Conte, Mamadou Moustapha Kant, Takeaki Uno, Kunihiro Wasa |
| 2017 | KDD | Fast Enumeration of Large k-Plexes. | Alessio Conte, Donatella Firmani, Caterina Mordente, Maurizio Patrignani, Riccardo Torlone |
| 2017 | SPIRE | Listing Maximal Independent Sets with Minimal Space and Bounded Delay. | Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca Versari |
| 2016 | EDBT | Finding All Maximal Cliques in Very Large Social Networks. | Alessio Conte, Roberto De Virgilio, Antonio Maccioni, Maurizio Patrignani, Riccardo Torlone |
| 2016 | ICALP | Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques. | Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari |
| 2016 | IWOCA | Directing Road Networks by Listing Strong Orientations. | Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari |
| 2016 | LATIN | Listing Acyclic Orientations of Graphs with Single and Multiple Sources. | Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi |
| 2016 | SAC | Clique covering of large real-world networks. | Alessio Conte, Roberto Grossi, Andrea Marino |
| 2015 | IWOCA | Enumerating Cyclic Orientations of a Graph. | Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi |