|
Search the dblp DataBase
Florent R. Madelaine:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Barnaby Martin, Florent R. Madelaine
Towards a Trichotomy for Quantified H-Coloring. [Citation Graph (0, 0)][DBLP] CiE, 2006, pp:342-352 [Conf]
- Florent R. Madelaine
Universal Structures and the Logic of Forbidden Patterns. [Citation Graph (0, 0)][DBLP] CSL, 2006, pp:471-485 [Conf]
- Stefan S. Dantchev, Florent R. Madelaine
Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP] CSR, 2006, pp:159-170 [Conf]
- Florent R. Madelaine, Iain A. Stewart
Some problems not definable using structure homomorphisms. [Citation Graph (0, 0)][DBLP] Ars Comb., 2003, v:67, n:, pp:- [Journal]
- Florent R. Madelaine, Iain A. Stewart
Constraint Satisfaction, Logic and Forbidden Patterns. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2007, v:37, n:1, pp:132-163 [Journal]
- Tomás Feder, Florent R. Madelaine, Iain A. Stewart
Dichotomies for classes of homomorphism problems involving unary functions. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:314, n:1-2, pp:1-43 [Journal]
- Barnaby Martin, Florent R. Madelaine
Hierarchies in Fragments of Monadic Strict NP. [Citation Graph (0, 0)][DBLP] CiE, 2007, pp:542-550 [Conf]
The Complexity of Positive First-order Logic without Equality. [Citation Graph (, )][DBLP]
Quantified Constraints and Containment Problems. [Citation Graph (, )][DBLP]
Universal Structures and the logic of Forbidden Patterns [Citation Graph (, )][DBLP]
The complexity of positive first-order logic without equality [Citation Graph (, )][DBLP]
Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs
|