Control of process with time delay. - Emmanuel Prempain; Florent R. Madelaine; S. Charmail (ECC, 2001)

Some problems not definable using structure homomorphisms. - Florent R. Madelaine; Iain A. Stewart (Ars Comb., 2003)

Constraint satisfaction problems and related logic. - Florent R. Madelaine (2003)

Dichotomies for classes of homomorphism problems involving unary functions. - Tomás Feder; Florent R. Madelaine; Iain A. Stewart (Theor. Comput. Sci., 2004)

Towards a Trichotomy for Quantified H-Coloring. - Barnaby Martin; Florent R. Madelaine (CiE, 2006)

Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction Problems. - Stefan S. Dantchev; Florent R. Madelaine (CSR, 2006)

Hierarchies in Fragments of Monadic Strict NP. - Barnaby Martin; Florent R. Madelaine (CiE, 2007)

Constraint Satisfaction, Logic and Forbidden Patterns. - Florent R. Madelaine; Iain A. Stewart (SIAM J. Comput., 2007)

Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies. - Florent R. Madelaine; Iain A. Stewart (Discret. Math., 2008)

Universal Structures and the logic of Forbidden Patterns - Florent R. Madelaine (Log. Methods Comput. Sci., 2009)

On the Containment of Forbidden Patterns Problems. - Florent R. Madelaine (CP, 2010)

Node-to-Node Disjoint Paths in k-ary n-cubes with Faulty Edges. - Yonghong Xiang; Iain A. Stewart; Florent R. Madelaine (ICPADS, 2011)

A Tetrachotomy for Positive First-Order Logic without Equality. - Florent R. Madelaine; Barnaby Martin (LICS, 2011)

Mémoire d'habilitation à diriger des recherches. - Florent R. Madelaine (2012)

Containment, Equivalence and Coreness from CSP to QCSP and Beyond. - Florent R. Madelaine; Barnaby Martin (CP, 2012)

The Complexity of Positive First-Order Logic without Equality. - Florent R. Madelaine; Barnaby Martin (ACM Trans. Comput. Log., 2012)

QCSP on Partially Reflexive Cycles - The Wavy Line of Tractability. - Florent R. Madelaine; Barnaby Martin (CSR, 2013)

From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP. - Catarina Carvalho; Florent R. Madelaine; Barnaby Martin (LICS, 2015)

Quantified Constraints and Containment Problems. - Hubie Chen; Florent R. Madelaine; Barnaby Martin (Log. Methods Comput. Sci., 2015)

Constraint Satisfaction with Counting Quantifiers. - Barnaby Martin; Florent R. Madelaine; Juraj Stacho (SIAM J. Discret. Math., 2015)

Quantified Valued Constraint Satisfaction Problem. - Florent R. Madelaine; Stéphane Secouard (CP, 2018)

A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP. - Manuel Bodirsky; Florent R. Madelaine; Antoine Mottet (LICS, 2018)

Consistency for Counting Quantifiers. - Florent R. Madelaine; Barnaby Martin (MFCS, 2018)

On the Complexity of the Model Checking Problem. - Florent R. Madelaine; Barnaby Martin (SIAM J. Comput., 2018)

Complexity of Conjunctive Regular Path Query Homomorphisms. - Laurent Beaudou; Florent Foucaud; Florent R. Madelaine; Lhouari Nourine; Gaétan Richard (CiE, 2019)

A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP. - Manuel Bodirsky; Florent R. Madelaine; Antoine Mottet (SIAM J. Comput., 2021)

On Guarded Extensions of MMSNP. - Alexey Barsukov; Florent R. Madelaine (CiE, 2023)

The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation. - Catarina Carvalho; Florent R. Madelaine; Barnaby Martin; Dmitriy Zhuk (ACM Trans. Comput. Log., 2023)

Model-checking positive equality free logic on a fixed structure (direttissima). - Manuel Bodirsky; Marcin Kozik; Florent R. Madelaine; Barnaby Martin; Michal Wrona (CoRR, 2024)