Florent R. Madelaine

ORCID

Publication Activity (10 Years)

Years Active: 2003-2023
Publications (10 Years): 12

Top Venues

University of Leicester, UK (PHD)

Education History

University of Leicester, UK

PHD

Publications

Alexey Barsukov, Florent R. Madelaine
On Guarded Extensions of MMSNP. CiE (2023)
Catarina Carvalho, Florent R. Madelaine, Barnaby Martin, Dmitriy Zhuk
The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation. ACM Trans. Comput. Log. 24 (1) (2023)
Alexey Barsukov, Florent R. Madelaine
On guarded extensions of MMSNP. CoRR (2023)
Laurent Beaudou, Florent Foucaud, Florent R. Madelaine, Lhouari Nourine, Gaétan Richard
Complexity of conjunctive regular path query homomorphisms. CoRR (2023)
Manuel Bodirsky, Florent R. Madelaine, Antoine Mottet
A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP. SIAM J. Comput. 50 (4) (2021)
Catarina Carvalho, Florent R. Madelaine, Barnaby Martin, Dmitriy Zhuk
The complexity of quantified constraints: collapsibility, switchability and the algebraic formulation. CoRR (2021)
Laurent Beaudou, Florent Foucaud, Florent R. Madelaine, Lhouari Nourine, Gaétan Richard
Complexity of Conjunctive Regular Path Query Homomorphisms. CiE (2019)
Florent R. Madelaine, Barnaby Martin
On the Complexity of the Model Checking Problem. SIAM J. Comput. 47 (3) (2018)
Manuel Bodirsky, Florent R. Madelaine, Antoine Mottet
A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP. CoRR (2018)
Manuel Bodirsky, Florent R. Madelaine, Antoine Mottet
A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP. LICS (2018)
Florent R. Madelaine, Stéphane Secouard
Quantified Valued Constraint Satisfaction Problem. CP (2018)
Florent R. Madelaine, Barnaby Martin
Consistency for Counting Quantifiers. MFCS (2018)
Catarina Carvalho, Florent R. Madelaine, Barnaby Martin
From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP. LICS (2015)
Barnaby Martin, Florent R. Madelaine, Juraj Stacho
Constraint Satisfaction with Counting Quantifiers. SIAM J. Discret. Math. 29 (2) (2015)
Hubie Chen, Florent R. Madelaine, Barnaby Martin
Quantified Constraints and Containment Problems. Log. Methods Comput. Sci. 11 (3) (2015)
Catarina Carvalho, Florent R. Madelaine, Barnaby Martin
From complexity to algebra and back: digraph classes, collapsibility and the PGP. CoRR (2015)
Florent R. Madelaine, Barnaby Martin
QCSP on partially reflexive cycles - the wavy line of tractability CoRR (2013)
Florent R. Madelaine, Barnaby Martin
QCSP on Partially Reflexive Cycles - The Wavy Line of Tractability. CSR (2013)
Florent R. Madelaine, Barnaby Martin
On the complexity of the model checking problem CoRR (2012)
Florent R. Madelaine, Barnaby Martin, Juraj Stacho
Constraint Satisfaction with Counting Quantifiers. CSR (2012)
Florent R. Madelaine, Barnaby Martin
Containment, Equivalence and Coreness from CSP to QCSP and Beyond. CP (2012)
Florent R. Madelaine, Barnaby Martin
The Complexity of Positive First-Order Logic without Equality. ACM Trans. Comput. Log. 13 (1) (2012)
Florent R. Madelaine, Barnaby Martin
Containment, Equivalence and Coreness from CSP to QCSP and beyond CoRR (2012)
Florent R. Madelaine, Barnaby Martin, Juraj Stacho
Constraint Satisfaction with Counting Quantifiers CoRR (2011)
Yonghong Xiang, Iain A. Stewart, Florent R. Madelaine
Node-to-Node Disjoint Paths in k-ary n-cubes with Faulty Edges. ICPADS (2011)
Florent R. Madelaine, Barnaby Martin
A Tetrachotomy for Positive First-Order Logic without Equality. LICS (2011)
Florent R. Madelaine, Barnaby Martin
The complexity of positive first-order logic without equality CoRR (2010)
Florent R. Madelaine
On the Containment of Forbidden Patterns Problems. CP (2010)
Florent R. Madelaine
Universal Structures and the logic of Forbidden Patterns Log. Methods Comput. Sci. 5 (2) (2009)
Florent R. Madelaine, Barnaby Martin
The Complexity of Positive First-order Logic without Equality. LICS (2009)
Hubie Chen, Florent R. Madelaine, Barnaby Martin
Quantified Constraints and Containment Problems. LICS (2008)
Florent R. Madelaine, Iain A. Stewart
Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies. Discret. Math. 308 (18) (2008)
Barnaby Martin, Florent R. Madelaine
Hierarchies in Fragments of Monadic Strict NP. CiE (2007)
Florent R. Madelaine, Iain A. Stewart
Constraint Satisfaction, Logic and Forbidden Patterns. SIAM J. Comput. 37 (1) (2007)
Stefan S. Dantchev, Florent R. Madelaine
Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction Problems. CSR (2006)
Florent R. Madelaine
Universal Structures and the Logic of Forbidden Patterns. CSL (2006)
Barnaby Martin, Florent R. Madelaine
-Coloring. CiE (2006)
Tomás Feder, Florent R. Madelaine, Iain A. Stewart
Dichotomies for classes of homomorphism problems involving unary functions. Theor. Comput. Sci. 314 (1-2) (2004)
Florent R. Madelaine, Iain A. Stewart
Some problems not definable using structure homomorphisms. Ars Comb. 67 (2003)

Florent R. Madelaine.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Florent R. Madelaine