51 citations · 101 across the 16 of their papers we have counts for
Showing 2011 · cs.DSShow all
2 papers · 2 filters
cs.DS2011★ 2 cited
Polynomial kernels for Proper Interval Completion and related problems
Stéphane Bessy, Anthony Perez
Given a graph G = (V,E) and a positive integer k, the Proper Interval Completion problem asks whether there exists a set F of at most k pairs of (V \times V)\E such that the graph…
cs.DS2011
Conflict Packing: an unifying technique to obtain polynomial kernels for editing problems on dense instances
Christophe Paul, Anthony Perez, Stéphan Thomassé
We develop a technique that we call Conflict Packing in the context of kernelization, obtaining (and improving) several polynomial kernels for editing problems on dense instances.…