12 citations · 22 across the 2 of their papers we have counts for
2 papers
cs.DS2016★ 12 cited
Linear kernels for edge deletion problems to immersion-closed graph classes
Archontia C. Giannopoulou, Michał Pilipczuk, Dimitrios M. Thilikos +2
Suppose is a finite family of graphs. We consider the following meta-problem, called -Immersion Deletion: given a graph and integer , decide wheth…
cs.DM2014★ 10 cited
Reconfiguring Independent Sets in Claw-Free Graphs
Paul Bonsma, Marcin Kamiński, Marcin Wrochna
We present a polynomial-time algorithm that, given two independent sets in a claw-free graph , decides whether one can be transformed into the other by a sequence of elementary…