Florent R. Madelaine

According to our database, Florent R. Madelaine authored at least 29 papers between 2001 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Model-checking positive equality free logic on a fixed structure (direttissima).

Manuel Bodirsky, Marcin Kozik, Florent R. Madelaine, Barnaby Martin, Michal Wrona

CoRR, 2024

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., January, 2023

On Guarded Extensions of MMSNP.

Alexey Barsukov, Florent R. Madelaine

Proceedings of the Unity of Logic and Computation, 2023

2021

A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP.

Manuel Bodirsky, Florent R. Madelaine, Antoine Mottet

SIAM J. Comput., 2021

2019

Complexity of Conjunctive Regular Path Query Homomorphisms.

Laurent Beaudou, Florent Foucaud, Florent R. Madelaine, Lhouari Nourine, Gaétan Richard

Proceedings of the Computing with Foresight and Industry, 2019

2018

On the Complexity of the Model Checking Problem.

Florent R. Madelaine, Barnaby Martin

SIAM J. Comput., 2018

Consistency for Counting Quantifiers.

Florent R. Madelaine, Barnaby Martin

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP.

Manuel Bodirsky, Florent R. Madelaine, Antoine Mottet

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Quantified Valued Constraint Satisfaction Problem.

Florent R. Madelaine, Stéphane Secouard

Proceedings of the Principles and Practice of Constraint Programming, 2018

2015

From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP.

Catarina Carvalho, Florent R. Madelaine, Barnaby Martin

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2013

QCSP on Partially Reflexive Cycles - The Wavy Line of Tractability.

Florent R. Madelaine, Barnaby Martin

Proceedings of the Computer Science - Theory and Applications, 2013

2012

Constraint Satisfaction with Counting Quantifiers.

Florent R. Madelaine, Barnaby Martin, Juraj Stacho

Proceedings of the Computer Science - Theory and Applications, 2012

Containment, Equivalence and Coreness from CSP to QCSP and Beyond.

Florent R. Madelaine, Barnaby Martin

Proceedings of the Principles and Practice of Constraint Programming, 2012

Mémoire d'habilitation à diriger des recherches.

Florent R. Madelaine

, 2012

2011

A Tetrachotomy for Positive First-Order Logic without Equality.

Florent R. Madelaine, Barnaby Martin

Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

Node-to-Node Disjoint Paths in k-ary n-cubes with Faulty Edges.

Yonghong Xiang, Iain A. Stewart, Florent R. Madelaine

Proceedings of the 17th IEEE International Conference on Parallel and Distributed Systems, 2011

2010

On the Containment of Forbidden Patterns Problems.

Florent R. Madelaine

Proceedings of the Principles and Practice of Constraint Programming - CP 2010, 2010

2009

The Complexity of Positive First-order Logic without Equality.

Florent R. Madelaine, Barnaby Martin

Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

2008

Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies.

Florent R. Madelaine, Iain A. Stewart

Discret. Math., 2008

Quantified Constraints and Containment Problems.

Hubie Chen, Florent R. Madelaine, Barnaby Martin

Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

2007

Constraint Satisfaction, Logic and Forbidden Patterns.

Florent R. Madelaine, Iain A. Stewart

SIAM J. Comput., 2007

Hierarchies in Fragments of Monadic Strict NP.

Barnaby Martin, Florent R. Madelaine

Proceedings of the Computation and Logic in the Real World, 2007

2006

Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction Problems.

Stefan S. Dantchev, Florent R. Madelaine

Proceedings of the Computer Science, 2006

Universal Structures and the Logic of Forbidden Patterns.

Florent R. Madelaine

Proceedings of the Computer Science Logic, 20th International Workshop, 2006

Towards a Trichotomy for Quantified <i>H</i>-Coloring.

Barnaby Martin, Florent R. Madelaine

Proceedings of the Logical Approaches to Computational Barriers, 2006

2004

Dichotomies for classes of homomorphism problems involving unary functions.

Tomás Feder, Florent R. Madelaine, Iain A. Stewart

Theor. Comput. Sci., 2004

2003

Constraint satisfaction problems and related logic.

Florent R. Madelaine

PhD thesis, 2003

Some problems not definable using structure homomorphisms.

Florent R. Madelaine, Iain A. Stewart

Ars Comb., 2003

2001

Control of process with time delay.

Emmanuel Prempain, Florent R. Madelaine, S. Charmail

Proceedings of the 6th European Control Conference, 2001