114 citations · 306 across the 50 of their papers we have counts for
Showing 2010 · cs.CCShow all
2 papers · 2 filters
cs.CC2010★ 114 cited
Cross-Composition: A New Technique for Kernelization Lower Bounds
Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance of…
cs.CC2010★ 1 cited
Parameterized Two-Player Nash Equilibrium
Danny Hermelin, Chien-Chung Huang, Stefan Kratsch +1
We study the computation of Nash equilibria in a two-player normal form game from the perspective of parameterized complexity. Recent results proved hardness for a number of varian…