
Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time
A minimum path cover (MPC) of a directed acyclic graph (DAG) G = (V,E) i...
read it

Development of a dynamic type 2 diabetes risk prediction tool: a UK Biobank study
Diabetes affects over 400 million people and is among the leading causes...
read it

Genome assembly, a universal theoretical framework: unifying and generalizing the safe and complete algorithms
Genome assembly is a fundamental problem in Bioinformatics, requiring to...
read it

On the parameterized complexity of the Minimum Path Cover problem in DAGs
A minimum path cover (MPC) of a directed acyclic graph (DAG) G = (V,E) i...
read it

Safety in st Paths, Trails and Walks
Given a directed graph G and a pair of nodes s and t, an st bridge of G...
read it

Computing all st bridges and articulation points simplified
Given a directed graph G and a pair of nodes s and t, an st bridge of G...
read it

From omnitigs to macrotigs: a lineartime algorithm for safe walks – common to all closed arccoverings of a directed graph
A partial solution to a problem is called safe if it appears in all solu...
read it
Massimo Cairo
is this you? claim profile