Search the dblp DataBase

Publications of Author

1. Barnaby Martin, Florent R. Madelaine
   Towards a Trichotomy for Quantified H-Coloring. [Citation Graph (0, 0)][DBLP]
   CiE, 2006, pp:342-352 [Conf]
   
2. Barnaby Martin, Florent R. Madelaine
   Hierarchies in Fragments of Monadic Strict NP. [Citation Graph (0, 0)][DBLP]
   CiE, 2007, pp:542-550 [Conf]
   
3. Barnaby Martin
   On the Complexity of a Derivative Chess Problem [Citation Graph (0, 0)][DBLP]
   CoRR, 2007, v:0, n:, pp:- [Journal]
   
4. Barnaby Martin
   Dichotomies and Duality in First-order Model Checking Problems [Citation Graph (0, 0)][DBLP]
   CoRR, 2006, v:0, n:, pp:- [Journal]
   
5. 
   First-Order Model Checking Problems Parameterized by the Model. [Citation Graph (, )][DBLP]
   
   
6. 
   Cutting Planes and the Parameter Cutwidth. [Citation Graph (, )][DBLP]
   
   
7. 
   The Limits of Tractability in Resolution-Based Propositional Proof Systems. [Citation Graph (, )][DBLP]
   
   
8. 
   The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case. [Citation Graph (, )][DBLP]
   
   
9. 
   Parameterized Proof Complexity. [Citation Graph (, )][DBLP]
   
   
10. 
    The Complexity of Positive First-order Logic without Equality. [Citation Graph (, )][DBLP]
    
    
11. 
    Quantified Constraints and Containment Problems. [Citation Graph (, )][DBLP]
    
    
12. 
    On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction. [Citation Graph (, )][DBLP]
    
    
13. 
    Distance Constraint Satisfaction Problems. [Citation Graph (, )][DBLP]
    
    
14. 
    Model Checking Positive Equality-free FO: Boolean Structures and Digraphs of Size Three [Citation Graph (, )][DBLP]
    
    
15. 
    On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction [Citation Graph (, )][DBLP]
    
    
16. 
    The complexity of positive first-order logic without equality [Citation Graph (, )][DBLP]
    
    
17. 
    Distance Constraint Satisfaction Problems [Citation Graph (, )][DBLP]
    
    
18. 
    Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution. [Citation Graph (, )][DBLP]