 | 2009 |
|---|
| 13 |       | Stefan S. Dantchev,
Barnaby Martin:
Cutting Planes and the Parameter Cutwidth.
CiE 2009: 134-143 |
| 12 | | Florent R. Madelaine,
Barnaby Martin:
The Complexity of Positive First-order Logic without Equality.
LICS 2009: 429-438 |
| 11 | | Manuel Bodirsky,
Martin Hils,
Barnaby Martin:
On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction
CoRR abs/0909.5097: (2009) |
| 10 | | Stefan S. Dantchev,
Barnaby Martin,
Mark Rhodes:
Tight rank lower bounds for the Sherali-Adams proof system.
Theor. Comput. Sci. 410(21-23): 2054-2063 (2009) |
| 2008 |
|---|
| 9 | | Barnaby Martin:
First-Order Model Checking Problems Parameterized by the Model.
CiE 2008: 417-427 |
| 8 | | Hubie Chen,
Florent R. Madelaine,
Barnaby Martin:
Quantified Constraints and Containment Problems.
LICS 2008: 317-328 |
| 7 | | Barnaby Martin:
Model Checking Positive Equality-free FO: Boolean Structures and Digraphs of Size Three
CoRR abs/0808.0647: (2008) |
| 2007 |
|---|
| 6 | | Barnaby Martin,
Florent R. Madelaine:
Hierarchies in Fragments of Monadic Strict NP.
CiE 2007: 542-550 |
| 5 | | Stefan S. Dantchev,
Barnaby Martin,
Stefan Szeider:
Parameterized Proof Complexity.
FOCS 2007: 150-160 |
| 4 | | Barnaby Martin:
On the Complexity of a Derivative Chess Problem
CoRR abs/cs/0701049: (2007) |
| 3 | | Stefan S. Dantchev,
Barnaby Martin,
Stefan Szeider:
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution.
Electronic Colloquium on Computational Complexity (ECCC) 14(001): (2007) |
| 2006 |
|---|
| 2 | | Barnaby Martin,
Florent R. Madelaine:
Towards a Trichotomy for Quantified H-Coloring.
CiE 2006: 342-352 |
| 1 | | Barnaby Martin:
Dichotomies and Duality in First-order Model Checking Problems
CoRR abs/cs/0609022: (2006) |
