# Florent R. Madelaine

- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage your publications. Semantic Scholar automatically creates author pages based on data aggregated from

**public sources and our publisher partners.**Mon travail s'articule autour des problemes de satisfaction de contraintes (CSP) et de leurs extensions comme les problemes de contraintes quantifies (QCSP), la question essentielle etant de… Expand

Feder and Vardi have proved that the class captured by a monadic frag ment of existential second-order logic, MMSNP, is computationally equivalent (via randomised reductions) to the class of… Expand

We improve upon the best known upper and lower bounds on the sizes of minimal feedback vertex sets in butterflies. Also, we construct new feedback vertex sets in grids so that for a large number of… Expand

Hell and Nesetřil proved that the H-colouring problem is NP-complete if, and only if, H is bipartite. In this paper, we investigate the complexity of the quantified H-colouring problem (a restriction… Expand

We study non-uniform constraint satisfaction problems where the underlying signature contains constant and function symbols as well as relation symbols. Amongst our results are the following. We… Expand

We study two containment problems related to the quantified constraint satisfaction problem (QCSP). Firstly, we give a combinatorial condition on finite structures A and B that is necessary and… Expand

24th Annual IEEE Symposium on Logic In Computer…

We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over a fixed, finite structure B. This may be seen as a natural generalisation of the non-uniform… Expand

In the 1990s, Feder and Vardi attempted to find a large subclass of NP which exhibits a dichotomy, that is, where every problem in the subclass is either solvable in polynomial-time or NP-complete.… Expand

Forbidden Patterns Problems (FPPs) are a proper generalisation of Constraint
Satisfaction Problems (CSPs). However, we show that when the input is connected
and belongs to a class which has low… Expand

IEEE 26th Annual Symposium on Logic in Computer…

We classify completely the complexity of evaluating positive equality-free sentences of first-order logic over a fixed, finite structure D. This problem may be seen as a natural generalisation of the… Expand