Get started
Author

Florent Madelaine

Observed names: F. Madelaine, Florent R. Madelaine, Florent R. Madelaine, Madelaine, Florent, Madelaine, Florent R.
Observed institutions: Ikerbasque, Centre National de la Recherche Scientifique, École Polytechnique, University of Leicester, Durham University, Université Paris-Est Créteil, Université Clermont Auvergne, University of Reunion Island, Paris-Est Sup, Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes, Institut Supérieur d’Informatique, de Modélisation et de leurs Applications, Instituts Universitaires de Technologie, Laboratoire d'Informatique de l'École Polytechnique, GREYC, Laboratoire d'Algorithmique, Complexité et Logique, Université de Clermont I, Université de Caen Normandie
ORCID: 0000-0002-8528-7105
Observed ORCID: 0000-0002-8528-7105
OpenAlex ID: A5044720498
Dichotomies for classes of homomorphism problems involving unary functions
2004 · Tomás Feder, Florent Madelaine, et al. · Theoretical Computer Science · 31
PDF
A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP
2018 · Manuel Bodirsky, Florent Madelaine, et al. · ACM/IEEE Symposium on Logic in Computer Science (LICS) · 26
PDF
Constraint Satisfaction, Logic and Forbidden Patterns
2007 · Florent Madelaine, Iain A. Stewart · SIAM Journal on Computing · 23
PDF
Towards a Trichotomy for Quantified H-Coloring
2006 · Barnaby Martin, Florent Madelaine · Lecture notes in computer science · 21
Quantified Constraints and Containment Problems
2008 · Hubie Chen, Florent Madelaine, et al. · ACM/IEEE Symposium on Logic in Computer Science (LICS) · 16
Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies
2007 · Florent R. Madelaine, Iain A. Stewart · Discrete Mathematics · 15
PDF
Constraint satisfaction problems and related logic
2003 · Florent Madelaine · Leicester Research Archive (University of Leicester) · 14
PDF
Universal Structures and the logic of Forbidden Patterns
2009 · Florent R. Madelaine · Logical Methods in Computer Science · 12
PDF
A Tetrachotomy for Positive First-Order Logic without Equality
2011 · Florent Madelaine, Barnaby Martin · ACM/IEEE Symposium on Logic in Computer Science (LICS) · 11
The Complexity of Positive First-order Logic without Equality
2009 · Florent Madelaine, Barnaby Martin · ACM/IEEE Symposium on Logic in Computer Science (LICS) · 11
A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP
2021 · Manuel Bodirsky, Florent Madelaine, et al. · SIAM Journal on Computing · 10
On the Complexity of the Model Checking Problem
2018 · Florent R. Madelaine, Barnaby D. Martin · SIAM Journal on Computing · 10
From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP
2015 · Catarina Carvalho, Florent Madelaine, et al. · ACM/IEEE Symposium on Logic in Computer Science (LICS) · 9
PDF
Constraint Satisfaction with Counting Quantifiers
2012 · Florent Madelaine, Barnaby Martin, et al. · Lecture notes in computer science · 8
PDF
Some problems not definable using structure homomorphisms.
2003 · Florent Madelaine, Iain A. Stewart · Durham Research Online (Durham University) · 7
On the Containment of Forbidden Patterns Problems
2010 · Florent Madelaine · Lecture notes in computer science · 6
Constraint Satisfaction with Counting Quantifiers
2015 · Barnaby Martin, Florent Madelaine, et al. · SIAM Journal on Discrete Mathematics · 5
PDF
QCSP on Partially Reflexive Cycles – The Wavy Line of Tractability
2013 · Florent Madelaine, Barnaby Martin · Lecture notes in computer science · 5
Containment, Equivalence and Coreness from CSP to QCSP and Beyond
2012 · Florent Madelaine, Barnaby Martin · Lecture notes in computer science · 5
Node-to-Node Disjoint Paths in k-ary n-cubes with Faulty Edges
2011 · Yonghong Xiang, Iain Stewart, et al. · IEEE International Conference on Parallel and Distributed Systems (ICPADS) · 5
Quantified Constraints and Containment Problems
2015 · Barnaby D. Martin, Hubie Chen, et al. · Logical Methods in Computer Science · 4
PDF
The Complexity of Positive First-Order Logic without Equality
2012 · Florent Madelaine, Barnaby Martin · ACM Transactions on Computational Logic · 4
Universal Structures and the Logic of Forbidden Patterns
2006 · Florent Madelaine · Lecture notes in computer science · 4
Containment, Equivalence and Coreness from CSP to QCSP and beyond
2012 · Madelaine, Florent, Martin, Barnaby · arXiv (Cornell University) · 3
PDF
Complexity of Conjunctive Regular Path Query Homomorphisms
2019 · Laurent Beaudou, Florent Foucaud, et al. · Lecture notes in computer science · 2
PDF
Works count: 46
Citation count: 274
H-index: 10
I10-index: 12
Year
Topic
Type