default search action
Florent R. Madelaine
Person information
- affiliation: Université Paris-Est Créteil, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i11]Manuel Bodirsky, Marcin Kozik, Florent R. Madelaine, Barnaby Martin, Michal Wrona:
Model-checking positive equality free logic on a fixed structure (direttissima). CoRR abs/2408.13840 (2024) - 2023
- [j11]Catarina Carvalho
, Florent R. Madelaine
The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation. ACM Trans. Comput. Log. 24(1): 5:1-5:26 (2023) - [c19]Alexey Barsukov
On Guarded Extensions of MMSNP. CiE 2023: 202-213 - [i10]Alexey Barsukov, Florent R. Madelaine:
On guarded extensions of MMSNP. CoRR abs/2305.04234 (2023) - [i9]Laurent Beaudou, Florent Foucaud, Florent R. Madelaine, Lhouari Nourine, Gaétan Richard:
Complexity of conjunctive regular path query homomorphisms. CoRR abs/2305.07271 (2023) - 2021
- [j10]Manuel Bodirsky
A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP. SIAM J. Comput. 50(4): 1359-1409 (2021) - [i8]Catarina Carvalho
The complexity of quantified constraints: collapsibility, switchability and the algebraic formulation. CoRR abs/2106.13154 (2021)
2010 – 2019
- 2019
- [c18]Laurent Beaudou, Florent Foucaud, Florent R. Madelaine, Lhouari Nourine, Gaétan Richard:
Complexity of Conjunctive Regular Path Query Homomorphisms. CiE 2019: 108-119 - 2018
- [j9]Florent R. Madelaine
On the Complexity of the Model Checking Problem. SIAM J. Comput. 47(3): 769-797 (2018) - [c17]Florent R. Madelaine
Quantified Valued Constraint Satisfaction Problem. CP 2018: 295-311 - [c16]Manuel Bodirsky
A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP. LICS 2018: 105-114 - [c15]Florent R. Madelaine
Consistency for Counting Quantifiers. MFCS 2018: 11:1-11:13 - [i7]Manuel Bodirsky, Florent R. Madelaine, Antoine Mottet:
A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP. CoRR abs/1802.03255 (2018) - 2015
- [j8]Hubie Chen, Florent R. Madelaine
Quantified Constraints and Containment Problems. Log. Methods Comput. Sci. 11(3) (2015) - [j7]Barnaby Martin
Constraint Satisfaction with Counting Quantifiers. SIAM J. Discret. Math. 29(2): 1065-1113 (2015) - [c14]Catarina Carvalho
From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP. LICS 2015: 462-474 - [i6]Catarina Carvalho, Florent R. Madelaine, Barnaby Martin:
From complexity to algebra and back: digraph classes, collapsibility and the PGP. CoRR abs/1501.04558 (2015) - 2013
- [c13]Florent R. Madelaine
QCSP on Partially Reflexive Cycles - The Wavy Line of Tractability. CSR 2013: 322-333 - [i5]Florent R. Madelaine, Barnaby Martin:
QCSP on partially reflexive cycles - the wavy line of tractability. CoRR abs/1303.0041 (2013) - 2012
- [b2]Florent R. Madelaine:
Mémoire d'habilitation à diriger des recherches. Blaise Pascal University, Clermont-Ferrand, France, 2012 - [j6]Florent R. Madelaine
The Complexity of Positive First-Order Logic without Equality. ACM Trans. Comput. Log. 13(1): 5:1-5:17 (2012) - [c12]Florent R. Madelaine
Containment, Equivalence and Coreness from CSP to QCSP and Beyond. CP 2012: 480-495 - [c11]Florent R. Madelaine
Constraint Satisfaction with Counting Quantifiers. CSR 2012: 253-265 - [i4]Florent R. Madelaine, Barnaby Martin:
Containment, Equivalence and Coreness from CSP to QCSP and beyond. CoRR abs/1204.5981 (2012) - [i3]Florent R. Madelaine, Barnaby Martin:
On the complexity of the model checking problem. CoRR abs/1210.6893 (2012) - 2011
- [c10]Yonghong Xiang, Iain A. Stewart
Node-to-Node Disjoint Paths in k-ary n-cubes with Faulty Edges. ICPADS 2011: 181-187 - [c9]Florent R. Madelaine
A Tetrachotomy for Positive First-Order Logic without Equality. LICS 2011: 311-320 - [i2]Florent R. Madelaine, Barnaby Martin, Juraj Stacho:
Constraint Satisfaction with Counting Quantifiers. CoRR abs/1112.2974 (2011) - 2010
- [c8]Florent R. Madelaine
On the Containment of Forbidden Patterns Problems. CP 2010: 345-359 - [i1]Florent R. Madelaine, Barnaby Martin:
The complexity of positive first-order logic without equality. CoRR abs/1003.0802 (2010)
2000 – 2009
- 2009
- [j5]Florent R. Madelaine
Universal Structures and the logic of Forbidden Patterns. Log. Methods Comput. Sci. 5(2) (2009) - [c7]Florent R. Madelaine
The Complexity of Positive First-order Logic without Equality. LICS 2009: 429-438 - 2008
- [j4]Florent R. Madelaine
Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies. Discret. Math. 308(18): 4144-4164 (2008) - [c6]Hubie Chen, Florent R. Madelaine
Quantified Constraints and Containment Problems. LICS 2008: 317-328 - 2007
- [j3]Florent R. Madelaine
Constraint Satisfaction, Logic and Forbidden Patterns. SIAM J. Comput. 37(1): 132-163 (2007) - [c5]Barnaby Martin, Florent R. Madelaine
Hierarchies in Fragments of Monadic Strict NP. CiE 2007: 542-550 - 2006
- [c4]Barnaby Martin, Florent R. Madelaine
Towards a Trichotomy for Quantified H-Coloring. CiE 2006: 342-352 - [c3]Florent R. Madelaine
Universal Structures and the Logic of Forbidden Patterns. CSL 2006: 471-485 - [c2]Stefan S. Dantchev, Florent R. Madelaine
Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction Problems. CSR 2006: 159-170 - 2004
- [j2]Tomás Feder, Florent R. Madelaine
Dichotomies for classes of homomorphism problems involving unary functions. Theor. Comput. Sci. 314(1-2): 1-43 (2004) - 2003
- [b1]Florent R. Madelaine:
Constraint satisfaction problems and related logic. University of Leicester, UK, 2003 - [j1]Florent R. Madelaine, Iain A. Stewart:
Some problems not definable using structure homomorphisms. Ars Comb. 67 (2003) - 2001
- [c1]Emmanuel Prempain, Florent R. Madelaine, S. Charmail:
Control of process with time delay. ECC 2001: 3017-3021
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:57 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: