activity
20142020
most citedConstant Congestion Brambles

7 citations · 7 across the 3 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2015

Lower bounds for the parameterized complexity of Minimum Fill-in and other completion problems

Ivan Bliznets, Marek Cygan, Pawel Komosa +2

In this work, we focus on several completion problems for subclasses of chordal graphs: Minimum Fill-In, Interval Completion, Proper Interval Completion, Threshold Completion, and…