activity
20102020
most citedA lower bound on the tree-width of graphs with irrelevant vertices

5 citations · 9 across the 2 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2010★ 4 cited

A lower bound for the tree-width of planar graphs with vital linkages

Isolde Adler, Philipp Klaus Krause

The disjoint paths problem asks, given an graph G and k + 1 pairs of terminals (s_0,t_0), ...,(s_k,t_k), whether there are k+1 pairwise disjoint paths P_0, ...,P_k, such that P_i c…