31 citations · 59 across the 7 of their papers we have counts for
3 papers · 1 filter
Data Reductions and Combinatorial Bounds for Improved Approximation Algorithms
Faisal N. Abu-Khzam, Cristina Bazgan, Morgan Chopin +1
Kernelization algorithms in the context of Parameterized Complexity are often based on a combination of reduction rules and combinatorial insights. We will expose in this paper a s…
Parameterized Inapproximability of Target Set Selection and Generalizations
Cristina Bazgan, Morgan Chopin, André Nichterlein +1
In this paper, we consider the Target Set Selection problem: given a graph and a threshold value for any vertex of the graph, find a minimum size vertex-subset to "act…
Structural parameterizations for boxicity
Henning Bruhn, Morgan Chopin, Felix Joos +1
The boxicity of a graph is the least integer such that has an intersection model of axis-aligned -dimensional boxes. Boxicity, the problem of deciding whether a give…