research
∙
11/17/2022
Minimum Path Cover in Parameterized Linear Time
A minimum path cover (MPC) of a directed acyclic graph (DAG) G = (V,E) i...
share
research
∙
10/14/2022
Cut paths and their remainder structure, with applications
In a strongly connected graph G = (V,E), a cut arc (also called strong b...
research
∙
07/05/2022
Width Helps and Hinders Splitting Flows
Minimum flow decomposition (MFD) is the NP-hard problem of finding a sma...
research
∙
07/12/2021
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...
research
∙
04/20/2021
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...
research
∙
11/25/2020
Genome assembly, a universal theoretical framework: unifying and generalizing the safe and complete algorithms
Genome assembly is a fundamental problem in Bioinformatics, requiring to...
research
∙
07/15/2020
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...
research
∙
07/09/2020
Safety in s-t Paths, Trails and Walks
Given a directed graph G and a pair of nodes s and t, an s-t bridge of G...
research
∙
06/26/2020
Computing all s-t bridges and articulation points simplified
Given a directed graph G and a pair of nodes s and t, an s-t bridge of G...
research
∙
02/24/2020