Alessio Conte

From MaRDI portal
Person:1627157

Available identifiers

zbMath Open conte.alessioMaRDI QIDQ1627157

List of research outcomes

PublicationDate of PublicationType
Refined bounds on the number of Eulerian tours in undirected graphs2024-01-09Paper
Finding the Anticover of a String2023-02-07Paper
Proximity Search for Maximal Subgraph Enumeration2022-11-15Paper
https://portal.mardi4nfdi.de/entity/Q50924362022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50891892022-07-18Paper
Beyond the BEST theorem: fast assessment of Eulerian trails2022-05-20Paper
Enumeration of maximal common subsequences between two strings2022-03-22Paper
On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms2021-12-22Paper
K-plex cover pooling for graph neural networks2021-11-01Paper
Overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms2021-10-04Paper
Maximal strongly connected cliques in directed graphs: algorithms and bounds2021-09-15Paper
https://portal.mardi4nfdi.de/entity/Q50051882021-08-04Paper
Listing Maximal Independent Sets with Minimal Space and Bounded Delay2021-02-16Paper
https://portal.mardi4nfdi.de/entity/Q51362402020-11-25Paper
Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs2020-04-14Paper
Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph2020-04-07Paper
Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs2020-02-25Paper
New polynomial delay bounds for maximal subgraph enumeration by proximity search2020-01-30Paper
Large-scale clique cover of real-world networks2020-01-17Paper
A fast discovery algorithm for large common connected induced subgraphs2019-09-19Paper
Listing Maximal Subgraphs Satisfying Strongly Accessible Properties2019-04-24Paper
Tight lower bounds for the number of inclusion-minimal \(st\)-cuts2018-11-22Paper
Finding maximal common subgraphs via time-space efficient reverse search2018-10-04Paper
Efficient enumeration of subgraphs and induced subgraphs with bounded girth2018-09-06Paper
Efficient enumeration of graph orientations with sources2018-06-27Paper
Listing acyclic subgraphs and subgraphs of bounded girth in directed graphs2018-03-26Paper
https://portal.mardi4nfdi.de/entity/Q45982912017-12-19Paper
Efficient enumeration of maximal \(k\)-degenerate subgraphs in a chordal graph2017-10-23Paper
Directing Road Networks by Listing Strong Orientations2016-09-29Paper
Listing Acyclic Orientations of Graphs with Single and Multiple Sources2016-05-03Paper
Enumerating Cyclic Orientations of a Graph2016-04-04Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Alessio Conte