research
∙
04/04/2023
Dynamic treewidth
We present a data structure that for a dynamic graph G that is updated b...
share
research
∙
02/21/2023
New Width Parameters for Independent Set: One-sided-mim-width and Neighbor-depth
We study the tractability of the maximum independent set problem from th...
research
∙
11/14/2022
An Improved Parameterized Algorithm for Treewidth
We give an algorithm that takes as input an n-vertex graph G and an inte...
research
∙
11/09/2022
Shortest Cycles With Monotone Submodular Costs
We introduce the following submodular generalization of the Shortest Cyc...
research
∙
07/20/2022
Computing Tree Decompositions with Small Independence Number
The independence number of a tree decomposition is the maximum of the in...
research
∙
04/15/2021
A Single-Exponential Time 2-Approximation Algorithm for Treewidth
We give an algorithm, that given an n-vertex graph G and an integer k, i...
research
∙
02/13/2021
