2 citations · 3 across the 2 of their papers we have counts for
2 papers
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.DS2009★ 1 cited
Kernels for Feedback Arc Set In Tournaments
Stéphane Bessy, Fedor V. Fomin, Serge Gaspers +4
A tournament T=(V,A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, the Fe…