Florent R. Madelaine

Proceedings of the Unity of Logic and Computation, 2023

2021

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

[BibT_eX]

[DOI]

Manuel Bodirsky

Antoine Mottet

SIAM J. Comput., 2021

2019

Complexity of Conjunctive Regular Path Query Homomorphisms.

[BibT_eX]

[DOI]

Proceedings of the Computing with Foresight and Industry, 2019

2018

On the Complexity of the Model Checking Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 2018

Consistency for Counting Quantifiers.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Manuel Bodirsky

Antoine Mottet

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

Quantified Valued Constraint Satisfaction Problem.

[BibT_eX]

[DOI]

Stéphane Secouard

Proceedings of the Principles and Practice of Constraint Programming, 2018

2015

Constraint Satisfaction with Counting Quantifiers.

[BibT_eX]

[DOI]

Juraj Stacho

SIAM J. Discret. Math., 2015

Quantified Constraints and Containment Problems.

[BibT_eX]

[DOI]

Hubie Chen

Log. Methods Comput. Sci., 2015

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

[BibT_eX]

[DOI]

Catarina Carvalho

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.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2013

2012

The Complexity of Positive First-Order Logic without Equality.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2012

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

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2012

Mémoire d'habilitation à diriger des recherches.

[BibT_eX]

[DOI]

, 2012

2011

A Tetrachotomy for Positive First-Order Logic without Equality.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Yonghong Xiang

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

2010

On the Containment of Forbidden Patterns Problems.

[BibT_eX]

[DOI]

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

2009

Universal Structures and the logic of Forbidden Patterns

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2009

2008

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

[BibT_eX]

[DOI]

Discret. Math., 2008

2007

Constraint Satisfaction, Logic and Forbidden Patterns.

[BibT_eX]

[DOI]

SIAM J. Comput., 2007

Hierarchies in Fragments of Monadic Strict NP.

[BibT_eX]

[DOI]

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

2006

Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Stefan S. Dantchev

Proceedings of the Computer Science, 2006

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

[BibT_eX]

[DOI]

Proceedings of the Logical Approaches to Computational Barriers, 2006

2004

Dichotomies for classes of homomorphism problems involving unary functions.

[BibT_eX]

[DOI]

Tomás Feder

Theor. Comput. Sci., 2004

2003

Constraint satisfaction problems and related logic.

[BibT_eX]

[DOI]

PhD thesis, 2003

Some problems not definable using structure homomorphisms.

[BibT_eX]

Ars Comb., 2003

2001

Control of process with time delay.

[BibT_eX]

[DOI]

Emmanuel Prempain