12 citations · 71 across the 72 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DS2012
Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings
Michał Pilipczuk
The notions of cutwidth and pathwidth of digraphs play a central role in the containment theory for tournaments, or more generally semi-complete digraphs, developed in a recent ser…
cs.DS2012★ 6 cited
Finding a maximum induced degenerate subgraph faster than 2^n
Marcin Pilipczuk, Michał Pilipczuk
In this paper we study the problem of finding a maximum induced d-degenerate subgraph in a given n-vertex graph from the point of view of exact algorithms. We show that for any fix…