activity
20062026
most citedFast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions

6 citations · 27 across the 25 of their papers we have counts for

collaborators
Showing 2006Show all

1 paper · 1 filter

math.CO2006★ 1 cited

Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor

David R. Wood, Jan Arne Telle

Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar…