×

Madelaine, Florent R.

Compute Distance To:
Author ID: madelaine.florent-r Recent zbMATH articles by "Madelaine, Florent R."
Published as: Madelaine, Florent; Madelaine, Florent R.
External Links: MGP
Documents Indexed: 20 Publications since 2003
Co-Authors: 12 Co-Authors with 18 Joint Publications
322 Co-Co-Authors

Publications by Year

Citations contained in zbMATH Open

13 Publications have been cited 51 times in 42 Documents Cited by Year
Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies. Zbl 1154.05055
Madelaine, Florent R.; Stewart, Iain A.
9
2008
Dichotomies for classes of homomorphism problems involving unary functions. Zbl 1070.68133
Feder, Tomás; Madelaine, Florent; Stewart, Iain A.
7
2004
Towards a trichotomy for quantified \(H\)-coloring. Zbl 1145.68436
Martin, Barnaby; Madelaine, Florent
6
2006
A universal-algebraic proof of the complexity dichotomy for monotone monadic SNP. Zbl 1452.03084
Bodirsky, Manuel; Madelaine, Florent; Mottet, Antoine
5
2018
Constraint satisfaction, logic and forbidden patterns. Zbl 1142.68035
Madelaine, Florent; Stewart, Iain A.
5
2007
Constraint satisfaction with counting quantifiers. Zbl 1392.68206
Martin, Barnaby; Madelaine, Florent; Stacho, Juraj
4
2015
From complexity to algebra and back: digraph classes, collapsibility, and the PGP. Zbl 1401.68115
Carvalho, Catarina; Madelaine, Florent; Martin, Barnaby
3
2015
The complexity of positive first-order logic without equality. Zbl 1351.68119
Madelaine, Florent; Martin, Barnaby
3
2012
Universal structures and the logic of forbidden patterns. Zbl 1163.68019
Madelaine, Florent R.
2
2009
Constraint satisfaction with counting quantifiers. Zbl 1360.68514
Madelaine, Florent; Martin, Barnaby; Stacho, Juraj
2
2012
Quantified constraints and containment problems. Zbl 1448.68248
Chen, Hubie; Madelaine, Florent R.; Martin, Barnaby
2
2015
QCSP on partially reflexive cycles – the wavy line of tractability. Zbl 1381.68099
Madelaine, Florent; Martin, Barnaby
2
2013
On the complexity of the model checking problem. Zbl 1393.68078
Madelaine, Florent R.; Martin, Barnaby D.
1
2018
A universal-algebraic proof of the complexity dichotomy for monotone monadic SNP. Zbl 1452.03084
Bodirsky, Manuel; Madelaine, Florent; Mottet, Antoine
5
2018
On the complexity of the model checking problem. Zbl 1393.68078
Madelaine, Florent R.; Martin, Barnaby D.
1
2018
Constraint satisfaction with counting quantifiers. Zbl 1392.68206
Martin, Barnaby; Madelaine, Florent; Stacho, Juraj
4
2015
From complexity to algebra and back: digraph classes, collapsibility, and the PGP. Zbl 1401.68115
Carvalho, Catarina; Madelaine, Florent; Martin, Barnaby
3
2015
Quantified constraints and containment problems. Zbl 1448.68248
Chen, Hubie; Madelaine, Florent R.; Martin, Barnaby
2
2015
QCSP on partially reflexive cycles – the wavy line of tractability. Zbl 1381.68099
Madelaine, Florent; Martin, Barnaby
2
2013
The complexity of positive first-order logic without equality. Zbl 1351.68119
Madelaine, Florent; Martin, Barnaby
3
2012
Constraint satisfaction with counting quantifiers. Zbl 1360.68514
Madelaine, Florent; Martin, Barnaby; Stacho, Juraj
2
2012
Universal structures and the logic of forbidden patterns. Zbl 1163.68019
Madelaine, Florent R.
2
2009
Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies. Zbl 1154.05055
Madelaine, Florent R.; Stewart, Iain A.
9
2008
Constraint satisfaction, logic and forbidden patterns. Zbl 1142.68035
Madelaine, Florent; Stewart, Iain A.
5
2007
Towards a trichotomy for quantified \(H\)-coloring. Zbl 1145.68436
Martin, Barnaby; Madelaine, Florent
6
2006
Dichotomies for classes of homomorphism problems involving unary functions. Zbl 1070.68133
Feder, Tomás; Madelaine, Florent; Stewart, Iain A.
7
2004

Citations by Year