activity
20152022
most citedA survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems

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

collaborators
Showing 2017Show all

1 paper · 1 filter

cs.DS2017

Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor

Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna

The notion of Turing kernelization investigates whether a polynomial-time algorithm can solve an NP-hard problem, when it is aided by an oracle that can be queried for the answers…