research
∙
08/17/2023
Minimum Path Cover: The Power of Parameterization
Computing a minimum path cover (MPC) of a directed acyclic graph (DAG) i...
share
research
∙
01/30/2023
A Safety Framework for Flow Decomposition Problems via Integer Linear Programming
Many important problems in Bioinformatics (e.g., assembly or multi-assem...
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...
research
∙
08/31/2022
Minimum Flow Decomposition in Graphs with Cycles using Integer Linear Programming
Minimum flow decomposition (MFD) – the problem of finding a minimum set ...
research
∙
07/05/2022
Width Helps and Hinders Splitting Flows
Minimum flow decomposition (MFD) is the NP-hard problem of finding a sma...
research
∙
04/20/2022
Fast Circular Pattern Matching
The Exact Circular Pattern Matching (ECPM) problem consists of reporting...
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
∙
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
∙
10/22/2018