research
∙
11/11/2022
Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth
We prove an approximate max-multiflow min-multicut theorem for bounded t...
share
research
∙
07/19/2022
Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs
In the 1970s, Győri and Lovász showed that for a k-connected n-vertex gr...
research
∙
07/10/2021
Connected k-partition of k-connected graphs and c-claw-free graphs
A connected partition is a partition of the vertices of a graph into set...
research
∙
06/01/2021
Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition
We present a new combinatorial model for identifying regulatory modules ...
research
∙
11/09/2020
Balanced Crown Decomposition for Connectivity Constraints
We introduce the balanced crown decomposition that captures the structur...
research
∙
02/18/2020
Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem
We develop an FPT algorithm and a kernel for the Weighted Edge Clique Pa...
research
∙
02/21/2018