Barnaby Martin

Stefan S. Dantchev, Barnaby Martin: Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems. Computational Complexity 22(1): 191-213 (2013)

Florent R. Madelaine, Barnaby Martin: QCSP on partially reflexive cycles - the wavy line of tractability. CoRR abs/1303.0041 (2013)

Stefan S. Dantchev, Barnaby Martin: Relativisation makes contradictions harder for Resolution. CoRR abs/1304.4287 (2013)

Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma: Finding vertex-surjective graph homomorphisms. Acta Inf. 49(6): 381-394 (2012)

Stefan S. Dantchev, Barnaby Martin: The limits of tractability in Resolution-based propositional proof systems. Ann. Pure Appl. Logic 163(6): 656-668 (2012)

Manuel Bodirsky, Jan Kára, Barnaby Martin: The complexity of surjective homomorphism problems - a survey. Discrete Applied Mathematics 160(12): 1680-1690 (2012)

Stefan S. Dantchev, Barnaby Martin: Cutting Planes and the Parameter Cutwidth. Theory Comput. Syst. 51(1): 50-64 (2012)

Florent R. Madelaine, Barnaby Martin: The Complexity of Positive First-Order Logic without Equality. ACM Trans. Comput. Log. 13(1): 5 (2012)

Florent R. Madelaine, Barnaby Martin: Containment, Equivalence and Coreness from CSP to QCSP and Beyond. CP 2012: 480-495

Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma: Finding Vertex-Surjective Graph Homomorphisms. CSR 2012: 160-171

Florent R. Madelaine, Barnaby Martin, Juraj Stacho: Constraint Satisfaction with Counting Quantifiers. CSR 2012: 253-265

Barnaby Martin: Parameterized Proof Complexity and W[1]. CoRR abs/1203.5323 (2012)

Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma: Finding vertex-surjective graph homomorphisms. CoRR abs/1204.2124 (2012)

Stefan S. Dantchev, Barnaby Martin: Parameterized Resolution with bounded conjunction. CoRR abs/1204.2983 (2012)

Florent R. Madelaine, Barnaby Martin: Containment, Equivalence and Coreness from CSP to QCSP and beyond. CoRR abs/1204.5981 (2012)

Florent R. Madelaine, Barnaby Martin: On the complexity of the model checking problem. CoRR abs/1210.6893 (2012)

Stefan S. Dantchev, Barnaby Martin, Stefan Szeider: Parameterized Proof Complexity. Computational Complexity 20(1): 51-85 (2011)

Barnaby Martin: Low-level dichotomy for quantified constraint satisfaction problems. Inf. Process. Lett. 111(20): 999-1003 (2011)

Barnaby Martin: QCSP on Partially Reflexive Forests. CP 2011: 546-560

Barnaby Martin, Daniël Paulusma: The Computational Complexity of Disconnected Cut and 2K 2-Partition. CP 2011: 561-575

Florent R. Madelaine, Barnaby Martin: A Tetrachotomy for Positive First-Order Logic without Equality. LICS 2011: 311-320

Barnaby Martin: Low-level dichotomy for Quantified Constraint Satisfaction Problems. CoRR abs/1102.3463 (2011)

Barnaby Martin: QCSP on partially reflexive forests. CoRR abs/1103.6212 (2011)

Barnaby Martin, Daniël Paulusma: The Computational Complexity of Disconnected Cut and 2K2-Partition. CoRR abs/1104.4779 (2011)

Manuel Bodirsky, Jan Kára, Barnaby Martin: The Complexity of Surjective Homomorphism Problems -- a Survey. CoRR abs/1104.5257 (2011)

Florent R. Madelaine, Barnaby Martin, Juraj Stacho: Constraint Satisfaction with Counting Quantifiers. CoRR abs/1112.2974 (2011)

Stefan S. Dantchev, Barnaby Martin: The Limits of Tractability in Resolution-Based Propositional Proof Systems. CiE 2010: 98-107

Barnaby Martin: The Lattice Structure of Sets of Surjective Hyper-Operations. CP 2010: 368-382

Barnaby Martin, Jos Martin: The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case. CSL 2010: 426-438

Manuel Bodirsky, Martin Hils, Barnaby Martin: On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction. LICS 2010: 90-99

Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Michael Pinsker: Distance Constraint Satisfaction Problems. MFCS 2010: 162-173

Florent R. Madelaine, Barnaby Martin: The complexity of positive first-order logic without equality. CoRR abs/1003.0802 (2010)

Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Michael Pinsker: Distance Constraint Satisfaction Problems. CoRR abs/1004.3842 (2010)

Manuel Bodirsky, Martin Hils, Barnaby Martin: On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction. Logical Methods in Computer Science 8(3) (2009)

Stefan S. Dantchev, Barnaby Martin, Mark Nicholas Charles Rhodes: Tight rank lower bounds for the Sherali-Adams proof system. Theor. Comput. Sci. 410(21-23): 2054-2063 (2009)

Stefan S. Dantchev, Barnaby Martin: Cutting Planes and the Parameter Cutwidth. CiE 2009: 134-143

Florent R. Madelaine, Barnaby Martin: The Complexity of Positive First-order Logic without Equality. LICS 2009: 429-438

Barnaby Martin: First-Order Model Checking Problems Parameterized by the Model. CiE 2008: 417-427

Hubie Chen, Florent R. Madelaine, Barnaby Martin: Quantified Constraints and Containment Problems. LICS 2008: 317-328

Barnaby Martin: Model Checking Positive Equality-free FO: Boolean Structures and Digraphs of Size Three. CoRR abs/0808.0647 (2008)

Barnaby Martin, Florent R. Madelaine: Hierarchies in Fragments of Monadic Strict NP. CiE 2007: 542-550

Stefan S. Dantchev, Barnaby Martin, Stefan Szeider: Parameterized Proof Complexity. FOCS 2007: 150-160

Barnaby Martin: On the Complexity of a Derivative Chess Problem. CoRR abs/cs/0701049 (2007)

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)

Barnaby Martin, Florent R. Madelaine: Towards a Trichotomy for Quantified H-Coloring. CiE 2006: 342-352

Barnaby Martin: Dichotomies and Duality in First-order Model Checking Problems. CoRR abs/cs/0609022 (2006)