I am a CNRS researcher in the COCONUT group of the LIRMM laboratory (Montpellier, France). I am interested in the algorithmic and complexity-theoretic aspects of the constraint satisfaction problem.
I completed my Ph.D. in 2016 at LAAS-CNRS (Toulouse, France) under the joint supervision of Emmanuel Hebrard and Martin C. Cooper. Afterwards, I spent two years as a postdoc of Standa Živný at the University of Oxford before joining CNRS in 2019.
firstname.lastname@lirmm.fr
Office 3.146
LIRMM
161 rue Ada
34095 Montpellier
France
+33 (0)467418630
Clément Carbonnel, Martin C. Cooper and João Marques-Silva. Tractable explaining of multivariate decision trees. KR'23. [PDF]
Christian Bessiere, Clément Carbonnel and Areski Himeur. Learning constraint networks over unknown constraint languages. IJCAI'23. [PDF]
Clément Carbonnel. On redundancy in constraint satisfaction problems. CP'22. [PDF]
Christian Bessiere, Clément Carbonnel, Martin C. Cooper and Emmanuel Hebrard. Complexity of minimum-size arc-inconsistency explanations. CP'22. [PDF]
Christian Bessiere, Clément Carbonnel and George Katsirelos. Chain length and CSPs learnable with few queries. AAAI'20. [PDF]
Clément Carbonnel, Miguel Romero and Stanislav Živný. Point-width and Max-CSPs. LICS'19. [PDF], see [arXiv] for the full version.
Clément Carbonnel, Miguel Romero and Stanislav Živný. The complexity of general-valued CSPs seen from the other side. FOCS'18. [PDF], see [arXiv] for the full version.
Clément Carbonnel, David A. Cohen, Martin C. Cooper and Stanislav Živný. On singleton arc consistency for CSPs defined by monotone patterns. STACS'18. [PDF]
Clément Carbonnel and Emmanuel Hebrard. On the kernelization of global constraints. IJCAI'17. [PDF]
Clément Carbonnel. The dichotomy for conservative constraint satisfaction is polynomially decidable. CP'16. [PDF]
Clément Carbonnel and Emmanuel Hebrard. Propagation via kernelization: the vertex cover constraint. CP'16. [PDF]
Clément Carbonnel. The meta-problem for conservative Mal'tsev constraints. AAAI'16. [PDF]
Clément Carbonnel, Martin C. Cooper and Emmanuel Hebrard. On backdoors to tractable constraint languages. CP'14. [PDF]
Clément Carbonnel, Gilles Chabert, Gilles Trombettoni and Philippe Vismara. Q-intersection algorithms for constraint-based robust parameter estimation. AAAI'14. [PDF]
Christian Bessiere, Clément Carbonnel, Emmanuel Hebrard, George Katsirelos and Toby Walsh. Detecting and exploiting subproblem tractability. IJCAI'13. [PDF]
Clément Carbonnel, Miguel Romero and Stanislav Živný. The complexity of general-valued CSPs seen from the other side. SIAM Journal on Computing, 2022. [arXiv]
Clément Carbonnel, Miguel Romero and Stanislav Živný. Point-width and Max-CSPs. ACM Transactions on Algorithms, 2020. [arXiv]
Clément Carbonnel, David Cohen, Martin C. Cooper and Stanislav Živný. On singleton arc consistency for CSPs defined by monotone patterns. Algorithmica, 2018. [PDF]
Clément Carbonnel and Martin C. Cooper. Tractability in constraint satisfaction problems: A survey. Constraints, 2015. [PDF]
Clément Carbonnel. Harnessing tractability in constraint satisfaction problems. Ph.D. thesis, INP Toulouse, 2016. [PDF]
(ACP Doctoral Research Award 2017)