3 citations · 5 across the 5 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018
Multi-budgeted directed cuts
Stefan Kratsch, Shaohua Li, Dániel Marx +2
We study multi-budgeted variants of the classic minimum cut problem and graph separation problems that turned out to be important in parameterized complexity: Skew Multicut and Dir…
cs.DS2018
An improved FPT algorithm for Independent Feedback Vertex Set
Shaohua Li, Marcin Pilipczuk
We study the Independent Feedback Vertex Set problem - a variant of the classic Feedback Vertex Set problem where, given a graph and an integer , the problem is to decide wh…