Alessio Conte

Davide Rucci

Proceedings of the String Processing and Information Retrieval, 2023

An Efficient Algorithm for Assessing the Number of <i>st</i>-Paths in Large Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2023 SIAM International Conference on Data Mining, 2023

A Compact DAG for Storing and Searching Maximal Common Subsequences.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Computing matching statistics on Wheeler DFAs.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2023

Generalizing Downsampling from Regular Data to Graphs.

[BibT_eX]

[DOI]

Davide Bacciu

Francesco Landolfi

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2022

On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms.

[BibT_eX]

[DOI]

Etsuji Tomita

Theor. Comput. Sci., 2022

Proximity Search for Maximal Subgraph Enumeration.

[BibT_eX]

[DOI]

SIAM J. Comput., 2022

Graph Pooling with Maximum-Weight k-Independent Sets.

[BibT_eX]

[DOI]

Davide Bacciu

Francesco Landolfi

CoRR, 2022

Enumeration of Maximal Common Subsequences Between Two Strings.

[BibT_eX]

[DOI]

Algorithmica, 2022

phyBWT: Alignment-Free Phylogeny via eBWT Positional Clustering.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Workshop on Algorithms in Bioinformatics, 2022

Jaccard Median for Ego-network Segmentation.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Data Mining, 2022

On Strings Having the Same Length- k Substrings.

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021

Combinatorial Algorithms for String Sanitization.

[BibT_eX]

[DOI]

ACM Trans. Knowl. Discov. Data, 2021

A meta-algorithm for finding large k-plexes.

[BibT_eX]

[DOI]

Knowl. Inf. Syst., 2021

K-plex cover pooling for graph neural networks.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2021

Maximal strongly connected cliques in directed graphs: Algorithms and bounds.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

On Breaking Truss-Based Communities.

[BibT_eX]

[DOI]

Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

Beyond the BEST Theorem: Fast Assessment of Eulerian Trails.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

2020

Efficient enumeration of maximal <i>k</i>-degenerate induced subgraphs of a chordal graph.

[BibT_eX]

[DOI]

Yota Otachi

Theor. Comput. Sci., 2020

Large-scale clique cover of real-world networks.

[BibT_eX]

[DOI]

Inf. Comput., 2020

Efficient Estimation of Graph Trussness.

[BibT_eX]

[DOI]

CoRR, 2020

Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2020

Zuckerli: A New Compressed Representation for Graphs.

[BibT_eX]

[DOI]

IEEE Access, 2020

Truly Scalable K-Truss and Max-Truss Algorithms for Community Detection in Graphs.

[BibT_eX]

[DOI]

IEEE Access, 2020

Radiomics and artificial intelligence analysis of CT data for the identification of prognostic features in multiple myeloma.

[BibT_eX]

[DOI]

Proceedings of the Medical Imaging 2020: Computer-Aided Diagnosis, 2020

Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs.

[BibT_eX]

[DOI]

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Hide and Mine in Strings: Hardness and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 20th IEEE International Conference on Data Mining, 2020

Finding the Anticover of a String.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

2019

Listing Maximal Subgraphs Satisfying Strongly Accessible Properties.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

A fast discovery algorithm for large common connected induced subgraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

New polynomial delay bounds for maximal subgraph enumeration by proximity search.

[BibT_eX]

[DOI]

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Polynomial-Delay Enumeration of Maximal Common Subsequences.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2019

Online Algorithms on Antipowers and Antiperiods.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2019

String Sanitization: A Combinatorial Approach.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2019

Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs.

[BibT_eX]

[DOI]

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

Shared-Nothing Distributed Enumeration of 2-Plexes.

[BibT_eX]

[DOI]

Proceedings of the 28th ACM International Conference on Information and Knowledge Management, 2019

2018

Enumeration Algorithms for Real-World Networks: Efficiency and Beyond.

[BibT_eX]

[DOI]

PhD thesis, 2018

Efficient enumeration of graph orientations with sources.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Listing Maximal Subgraphs in Strongly Accessible Set Systems.

[BibT_eX]

[DOI]

CoRR, 2018

Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

Cliques are Too Strict for Representing Communities: Finding Large k-plexes in Real Networks.

[BibT_eX]

[DOI]

Proceedings of the 26th Italian Symposium on Advanced Database Systems, 2018

Listing Subgraphs by Cartesian Decomposition.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

D2K: Scalable Community Detection in Massive Networks via Small-Diameter k-Plexes.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

Node Similarity with q -Grams for Real-World Labeled Networks.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

Discovering $k$-Trusses in Large-Scale Networks.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE High Performance Extreme Computing Conference, 2018

Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

Listing Maximal Independent Sets with Minimal Space and Bounded Delay.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2017

Fast Enumeration of Large k-Plexes.

[BibT_eX]

[DOI]

Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017

On Maximal Cliques with Connectivity Constraints in Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph.

[BibT_eX]

[DOI]

Yota Otachi

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

Listing Acyclic Subgraphs and Subgraphs of Bounded Girth in Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2017

Efficiently Clustering Very Large Attributed Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017, Sydney, Australia, July 31, 2017

A Fast Algorithm for Large Common Connected Induced Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Computational Biology, 2017

2016

Community Detection in Social Networks: Breaking the Taboos.

[BibT_eX]

Proceedings of the 24th Italian Symposium on Advanced Database Systems, 2016

Clique covering of large real-world networks.

[BibT_eX]

[DOI]