2 citations · 5 across the 4 of their papers we have counts for
4 papers
A Complexity Dichotomy for Temporal Valued Constraint Satisfaction Problems
Manuel Bodirsky, Édouard Bonnet, Žaneta Semanišinová
We study the complexity of the valued constraint satisfaction problem (VCSP) for every valued structure with the domain that is preserved by all order-preserving bije…
Treewidth is Polynomial in Maximum Degree on Weakly Sparse Graphs Excluding a Planar Induced Minor
Édouard Bonnet, Jędrzej Hodor, Tuukka Korhonen +1
A graph contains a graph as an induced minor if can be obtained from after vertex deletions and edge contractions. We show that for every -vertex planar graph $H…
A tamed family of triangle-free graphs with unbounded chromatic number
Édouard Bonnet, Romain Bourneuf, Julien Duron +3
We construct a hereditary class of triangle-free graphs with unbounded chromatic number, in which every non-trivial graph either contains a pair of non-adjacent twins or has an edg…
Parameterized Exact and Approximation Algorithms for Maximum -Set Cover and Related Satisfiability Problems
Edouard Bonnet, Vangelis Th. Paschos, Florian Sikora
Given a family of subsets over a set of elements~ and two integers~ and~, Max k-Set Cover consists of finding a subfamily~ of…