15 citations · 19 across the 7 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2014★ 2 cited
Parameterized Complexity of Edge Interdiction Problems
Jiong Guo, Yash Raj Shrestha
We study the parameterized complexity of interdiction problems in graphs. For an optimization problem on graphs, one can formulate an interdiction problem as a game consisting of t…
cs.CC2009★ 1 cited
A Generalization of Nemhauser and Trotter's Local Optimization Theorem
Michael R. Fellows, Jiong Guo, Hannes Moser +1
The Nemhauser-Trotter local optimization theorem applies to the NP-hard Vertex Cover problem and has applications in approximation as well as parameterized algorithmics. We present…