
A SingleExponential Time 2Approximation Algorithm for Treewidth
We give an algorithm, that given an nvertex graph G and an integer k, i...
read it

Lower Bounds on Dynamic Programming for Maximum Weight Independent Set
We prove lower bounds on pure dynamic programming algorithms for maximum...
read it

Listing Small Minimal Separators of a Graph
Let G be a graph and a,b vertices of G. A minimal a,bseparator of G is ...
read it

Tight Bounds for Potential Maximal Cliques Parameterized by Vertex Cover
We show that a graph with n vertices and vertex cover of size k has at m...
read it

SMS in PACE 2020
We describe SMS, our submission to the exact treedepth track of PACE 202...
read it

Potential Maximal Cliques Parameterized by Edge Clique Cover
We show that the number of minimal separators on graphs with edge clique...
read it
Tuukka Korhonen
is this you? claim profile