Florent R. Madelaine - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2023

On Guarded Extensions of MMSNPAlexey Barsukov, Florent R. Madelaine. CiE 2023: 202-213 [doi]

The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic FormulationCatarina Carvalho, Florent R. Madelaine, Barnaby Martin, Dmitriy Zhuk. tocl, 24(1), January 2023. [doi]

2021

A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNPManuel Bodirsky, Florent R. Madelaine, Antoine Mottet. SICOMP, 50(4):1359-1409, 2021. [doi]

2019

Complexity of Conjunctive Regular Path Query HomomorphismsLaurent Beaudou, Florent Foucaud, Florent R. Madelaine, Lhouari Nourine, Gaétan Richard. CiE 2019: 108-119 [doi]

2018

2015

From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGPCatarina Carvalho, Florent R. Madelaine, Barnaby Martin. lics 2015: 462-474 [doi]

Constraint Satisfaction with Counting QuantifiersBarnaby Martin, Florent R. Madelaine, Juraj Stacho. siamdm, 29(2):1065-1113, 2015. [doi]

2013

QCSP on Partially Reflexive Cycles - The Wavy Line of TractabilityFlorent R. Madelaine, Barnaby Martin. csr 2013: 322-333 [doi]

2012

Mémoire d'habilitation à diriger des recherchesFlorent R. Madelaine. 2012. [doi]

The Complexity of Positive First-Order Logic without EqualityFlorent R. Madelaine, Barnaby Martin. tocl, 13(1):5, 2012. [doi]

Constraint Satisfaction with Counting QuantifiersFlorent R. Madelaine, Barnaby Martin, Juraj Stacho. csr 2012: 253-265 [doi]

Containment, Equivalence and Coreness from CSP to QCSP and BeyondFlorent R. Madelaine, Barnaby Martin. cp 2012: 480-495 [doi]

2011

A Tetrachotomy for Positive First-Order Logic without EqualityFlorent R. Madelaine, Barnaby Martin. lics 2011: 311-320 [doi]

Node-to-Node Disjoint Paths in k-ary n-cubes with Faulty EdgesYonghong Xiang, Iain A. Stewart, Florent R. Madelaine. icpads 2011: 181-187 [doi]

2010

On the Containment of Forbidden Patterns ProblemsFlorent R. Madelaine. cp 2010: 345-359 [doi]

2009

The Complexity of Positive First-order Logic without EqualityFlorent R. Madelaine, Barnaby Martin. lics 2009: 429-438 [doi]

2008

Quantified Constraints and Containment ProblemsHubie Chen, Florent R. Madelaine, Barnaby Martin. lics 2008: 317-328 [doi]

Improved upper and lower bounds on the feedback vertex numbers of grids and butterfliesFlorent R. Madelaine, Iain A. Stewart. DM, 308(18):4144-4164, 2008. [doi]

2007

Constraint Satisfaction, Logic and Forbidden PatternsFlorent R. Madelaine, Iain A. Stewart. SICOMP, 37(1):132-163, 2007. [doi]

Hierarchies in Fragments of Monadic Strict NPBarnaby Martin, Florent R. Madelaine. cie 2007: 542-550 [doi]

2006

Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction ProblemsStefan S. Dantchev, Florent R. Madelaine. csr 2006: 159-170 [doi]

Universal Structures and the Logic of Forbidden PatternsFlorent R. Madelaine. csl 2006: 471-485 [doi]

Towards a Trichotomy for Quantified ::::H::::-ColoringBarnaby Martin, Florent R. Madelaine. cie 2006: 342-352 [doi]

2004

Dichotomies for classes of homomorphism problems involving unary functionsTomás Feder, Florent R. Madelaine, Iain A. Stewart. TCS, 314(1-2):1-43, 2004. [doi]

2003

Constraint satisfaction problems and related logicFlorent R. Madelaine. PhD thesis, University of Southampton, UK, 2003. [doi]

Some problems not definable using structure homomorphismsFlorent R. Madelaine, Iain A. Stewart. arscom, 67, 2003.

Sign in or sign up to see more results.

runs on WebDSL