6 citations · 9 across the 8 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
cs.DS2014★ 2 cited
A Polynomial Kernel for Trivially Perfect Editing
Pål Grønås Drange, Michał Pilipczuk
We give a kernel with vertices for Trivially Perfect Editing, the problem of adding or removing at most edges in order to make a given graph trivially perfect. This an…
cs.DS2014
Kernelization and Sparseness: the case of Dominating Set
Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin +9
We prove that for every positive integer and for every graph class of bounded expansion, the -Dominating Set problem admits a linear kernel on graphs from $\mat…
cs.DS2014
On the Computational Complexity of Vertex Integrity and Component Order Connectivity
Pål Grønås Drange, Markus Sortland Dregi, Pim van 't Hof
The Weighted Vertex Integrity (wVI) problem takes as input an -vertex graph , a weight function , and an integer . The task is to decide if there exis…