Search Results - "CONTE, ALESSIO"

On Strings Having the Same Length-k Substrings.

Authors: Bernardini, Giulia Conte, Alessio Gabory, Esteban et al.

Source: Theory of Computing Systems. Jun2026, Vol. 70 Issue 2, p1-31. 31p.

MCDAG: indexing maximal common subsequences for k strings.

Authors: Buzzega, Giovanni Conte, Alessio Grossi, Roberto et al.

Source: Algorithms for Molecular Biology. 4/19/2025, Vol. 20 Issue 1, p1-21. 21p.

DRMAAtic: dramatically improve your cluster potential.

Authors: Conte, Alessio Del Ghafouri, Hamidreza Clementel, Damiano et al.

Source: Bioinformatics Advances. 2025, Vol. 5 Issue 1, p1-8. 8p.

Listing maximal H-free subgraphs.

Authors: Conte, Alessio Grossi, Roberto Kanté, Mamadou Moustapha et al.

Source: Discrete Applied Mathematics. Dec2025, Vol. 377, p18-31. 14p.

Subjects: Graph theory, Subgraphs, Data modeling, Data scrubbing, Algorithms

On Breaking Truss-based and Core-based Communities.

Authors: Chen, Huiping Conte, Alessio Grossi, Roberto et al.

Source: ACM Transactions on Knowledge Discovery from Data; Jul2024, Vol. 18 Issue 6, p1-43, 43p

Output-sensitive enumeration of maximal cliques in temporal graphs.

Authors: Brunelli, Filippo Conte, Alessio Grossi, Roberto et al.

Source: Discrete Applied Mathematics. Jul2025, Vol. 369, p66-77. 12p.

Subjects: Polynomial time algorithms, Task analysis, Algorithms, Definitions

phyBWT2: phylogeny reconstruction via eBWT positional clustering.

Authors: Guerrini, Veronica Conte, Alessio Grossi, Roberto et al.

Source: Algorithms for Molecular Biology. 8/3/2023, Vol. 18 Issue 1, p1-26. 26p.

Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size.

Authors: Conte, Alessio Grossi, Roberto Kobayashi, Yasuaki et al.

Source: Algorithmica; Sep2025, Vol. 87 Issue 9, p1247-1273, 27p

K-plex cover pooling for graph neural networks.

Authors: Bacciu, Davide Conte, Alessio Grossi, Roberto et al.

Source: Data Mining & Knowledge Discovery; Sep2021, Vol. 35 Issue 5, p2200-2220, 21p

A meta-algorithm for finding large k-plexes.

Authors: Conte, Alessio Firmani, Donatella Patrignani, Maurizio et al.

Source: Knowledge & Information Systems; Jul2021, Vol. 63 Issue 7, p1745-1769, 25p

CAGI6 ID panel challenge: assessment of phenotype and variant predictions in 415 children with neurodevelopmental disorders (NDDs).

Authors: Aspromonte, Maria Cristina Del Conte, Alessio Zhu, Shaowen et al.

Source: Human Genetics. Mar2025, Vol. 144 Issue 2/3, p227-242. 16p.

Genetic variants and phenotypic data curated for the CAGI6 intellectual disability panel challenge.

Authors: Aspromonte, Maria Cristina Del Conte, Alessio Polli, Roberta et al.

Source: Human Genetics. Mar2025, Vol. 144 Issue 2/3, p309-326. 18p.

Combinatorial Algorithms for String Sanitization.

Authors: BERNARDINI, GIULIA HUIPING CHEN CONTE, ALESSIO et al.

Source: ACM Transactions on Knowledge Discovery from Data; Jan2021, Vol. 15 Issue 1, p1-34, 34p

Refined Bounds on the Number of Eulerian Tours in Undirected Graphs.

Authors: Punzi, Giulia Conte, Alessio Grossi, Roberto et al.

Source: Algorithmica; Jan2024, Vol. 86 Issue 1, p194-217, 24p

PROXIMITY SEARCH FOR MAXIMAL SUBGRAPH ENUMERATION.

Authors: CONTE, ALESSIO GROSSI, ROBERTO MARINO, ANDREA et al.

Source: SIAM Journal on Computing. 2022, Vol. 51 Issue 5, p1580-1625. 46p.

Subjects: Bipartite graphs, Parent-child relationships, Directed graphs, Subgraphs, Polynomials

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

Authors: Conte, Alessio Tomita, Etsuji

Source: Theoretical Computer Science. Jan2022, Vol. 899, p1-24. 24p.

Subjects: Algorithms

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

Authors: Conte, Alessio Kanté, Mamadou Moustapha Uno, Takeaki et al.

Source: Discrete Applied Mathematics. Nov2021, Vol. 303, p237-252. 16p.

Subjects: Graph algorithms, Directed graphs, Undirected graphs, Algorithms, Vector spaces, Subgraphs

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

Authors: CARMELI, NOFAR ZEEVI, SHAI BERKHOLZ, CHRISTOPH et al.

Source: ACM Transactions on Database Systems; Sep2022, Vol. 47 Issue 3, p80-128, 49p

Enumeration of Maximal Common Subsequences Between Two Strings.

Authors: Conte, Alessio Grossi, Roberto Punzi, Giulia et al.

Source: Algorithmica; Mar2022, Vol. 84 Issue 3, p757-783, 27p

This result is not displayed to guests.
Login for full access.