Florent R. Madelaine

46 papers A* 5A 3B 4C 4Misc 3Journal 24Unranked 1
YearRankTypeTitle / Venue / Authors
2026 B conf
Weakly-Sparse and Strongly Flip-Flat Classes of Graphs Are Uniformly Almost-Wide.
CSL
Fatemeh Ghasemi, Julien Grange, Mamadou Moustapha Kanté, Florent R. Madelaine
2025 J jnl
On guarded extensions of MMSNP.
Log. Methods Comput. Sci.
Alexey Barsukov, Florent R. Madelaine
2025 J jnl
Weakly-sparse and strongly flip-flat classes of graphs are uniformly almost-wide.
CoRR
Fatemeh Ghasemi, Julien Grange, Mamadou Moustapha Kanté, Florent R. Madelaine
2024 J jnl
Model-checking positive equality free logic on a fixed structure (direttissima).
CoRR
Manuel Bodirsky, Marcin Kozik, Florent R. Madelaine, Barnaby Martin, Michal Wrona
2023 J jnl
Complexity of conjunctive regular path query homomorphisms.
CoRR
Laurent Beaudou, Florent Foucaud, Florent R. Madelaine, Lhouari Nourine, Gaétan Richard
2023 C conf
On Guarded Extensions of MMSNP.
CiE
Alexey Barsukov, Florent R. Madelaine
2023 J jnl
On guarded extensions of MMSNP.
CoRR
Alexey Barsukov, Florent R. Madelaine
2023 J jnl
The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation.
ACM Trans. Comput. Log.
Catarina Carvalho, Florent R. Madelaine, Barnaby Martin, Dmitriy Zhuk
2021 J jnl
A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP.
SIAM J. Comput.
Manuel Bodirsky, Florent R. Madelaine, Antoine Mottet
2021 J jnl
The complexity of quantified constraints: collapsibility, switchability and the algebraic formulation.
CoRR
Catarina Carvalho, Florent R. Madelaine, Barnaby Martin, Dmitriy Zhuk
2019 C conf
Complexity of Conjunctive Regular Path Query Homomorphisms.
CiE
Laurent Beaudou, Florent Foucaud, Florent R. Madelaine, Lhouari Nourine, Gaétan Richard
2018 A* conf
A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP.
LICS
Manuel Bodirsky, Florent R. Madelaine, Antoine Mottet
2018 J jnl
A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP.
CoRR
Manuel Bodirsky, Florent R. Madelaine, Antoine Mottet
2018 B conf
Consistency for Counting Quantifiers.
MFCS
Florent R. Madelaine, Barnaby Martin
2018 J jnl
On the Complexity of the Model Checking Problem.
SIAM J. Comput.
Florent R. Madelaine, Barnaby Martin
2018 A conf
Quantified Valued Constraint Satisfaction Problem.
CP
Florent R. Madelaine, Stéphane Secouard
2015 J jnl
Constraint Satisfaction with Counting Quantifiers.
SIAM J. Discret. Math.
Barnaby Martin, Florent R. Madelaine, Juraj Stacho
2015 A* conf
From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP.
LICS
Catarina Carvalho, Florent R. Madelaine, Barnaby Martin
2015 J jnl
From complexity to algebra and back: digraph classes, collapsibility and the PGP.
CoRR
Catarina Carvalho, Florent R. Madelaine, Barnaby Martin
2015 J jnl
Quantified Constraints and Containment Problems.
Log. Methods Comput. Sci.
Hubie Chen, Florent R. Madelaine, Barnaby Martin
2013 Misc conf
QCSP on Partially Reflexive Cycles - The Wavy Line of Tractability.
CSR
Florent R. Madelaine, Barnaby Martin
2013 J jnl
QCSP on partially reflexive cycles - the wavy line of tractability
CoRR
Florent R. Madelaine, Barnaby Martin
2012 Misc conf
Constraint Satisfaction with Counting Quantifiers.
CSR
Florent R. Madelaine, Barnaby Martin, Juraj Stacho
2012 A conf
Containment, Equivalence and Coreness from CSP to QCSP and Beyond.
CP
Florent R. Madelaine, Barnaby Martin
2012 J jnl
Containment, Equivalence and Coreness from CSP to QCSP and beyond
CoRR
Florent R. Madelaine, Barnaby Martin
2012 — book
Mémoire d'habilitation à diriger des recherches.
Florent R. Madelaine
2012 J jnl
On the complexity of the model checking problem
CoRR
Florent R. Madelaine, Barnaby Martin
2012 J jnl
The Complexity of Positive First-Order Logic without Equality.
ACM Trans. Comput. Log.
Florent R. Madelaine, Barnaby Martin
2011 A* conf
A Tetrachotomy for Positive First-Order Logic without Equality.
LICS
Florent R. Madelaine, Barnaby Martin
2011 J jnl
Constraint Satisfaction with Counting Quantifiers
CoRR
Florent R. Madelaine, Barnaby Martin, Juraj Stacho
2011 B conf
Node-to-Node Disjoint Paths in k-ary n-cubes with Faulty Edges.
ICPADS
Yonghong Xiang, Iain A. Stewart, Florent R. Madelaine
2010 A conf
On the Containment of Forbidden Patterns Problems.
CP
Florent R. Madelaine
2010 J jnl
The complexity of positive first-order logic without equality
CoRR
Florent R. Madelaine, Barnaby Martin
2009 A* conf
The Complexity of Positive First-order Logic without Equality.
LICS
Florent R. Madelaine, Barnaby Martin
2009 J jnl
Universal Structures and the logic of Forbidden Patterns
Log. Methods Comput. Sci.
Florent R. Madelaine
2008 J jnl
Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies.
Discret. Math.
Florent R. Madelaine, Iain A. Stewart
2008 A* conf
Quantified Constraints and Containment Problems.
LICS
Hubie Chen, Florent R. Madelaine, Barnaby Martin
2007 J jnl
Constraint Satisfaction, Logic and Forbidden Patterns.
SIAM J. Comput.
Florent R. Madelaine, Iain A. Stewart
2007 C conf
Hierarchies in Fragments of Monadic Strict NP.
CiE
Barnaby Martin, Florent R. Madelaine
2006 Misc conf
Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction Problems.
CSR
Stefan S. Dantchev, Florent R. Madelaine
2006 C conf
Towards a Trichotomy for Quantified
CiE
Barnaby Martin, Florent R. Madelaine
2006 B conf
Universal Structures and the Logic of Forbidden Patterns.
CSL
Florent R. Madelaine
2004 J jnl
Dichotomies for classes of homomorphism problems involving unary functions.
Theor. Comput. Sci.
Tomás Feder, Florent R. Madelaine, Iain A. Stewart
2003 — —
Constraint satisfaction problems and related logic.
Florent R. Madelaine
2003 J jnl
Some problems not definable using structure homomorphisms.
Ars Comb.
Florent R. Madelaine, Iain A. Stewart
2001 — conf
Control of process with time delay.
ECC
Emmanuel Prempain, Florent R. Madelaine, S. Charmail