114 citations · 385 across the 36 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.CC2013
On Sparsification for Computing Treewidth
Bart M. P. Jansen
We investigate whether an n-vertex instance (G,k) of Treewidth, asking whether the graph G has treewidth at most k, can efficiently be made sparse without changing its answer. By g…
cs.CC2013★ 1 cited
FPT is Characterized by Useful Obstruction Sets
Michael R. Fellows, Bart M. P. Jansen
Many graph problems were first shown to be fixed-parameter tractable using the results of Robertson and Seymour on graph minors. We show that the combination of finite, computable,…