Items where Author / Artist / Editor is "Martin, Barnaby"

See full list of headings
Export as [feed] RSS 1.0
Group by: Item Type | No Grouping
Number of items: 27.

Article

Martin, Barnaby and Raimondi, Franco and Chen, Taolue and Martin, Jos (2017) The packing chromatic number of the infinite square lattice is between 13 and 15. Discrete Applied Mathematics, 225 . pp. 136-142. ISSN 0166-218X

Bodirskya, Manuel and Dalmau, Victor and Martin, Barnaby and Mottet, Antoine and Pinsker, Michael (2016) Distance constraint satisfaction problems. Information and Computation, 247 . pp. 87-105. ISSN 0890-5401

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

Bodirsky, Manuel and Kara, Jan and Martin, Barnaby (2012) The complexity of surjective homomorphism problems - a survey. Discrete Applied Mathematics, 160 (12). pp. 1680-1690. ISSN 0166-218X

Dantchev, Stefan and Martin, Barnaby (2012) Cutting planes and the parameter cutwidth. Theory of Computing Systems, 51 (1). pp. 50-64. ISSN 1432-4350

Dantchev, Stefan and Martin, Barnaby (2012) The limits of tractability in resolution-based propositional proof systems. Annals of Pure and Applied Logic, 163 (6). pp. 656-668. ISSN 0168-0072

Madelaine, Florent and Martin, Barnaby (2012) The complexity of positive first-order logic without equality. ACM Transactions on Computational Logic (TOCL), 13 (1). ISSN 1529-3785

Martin, Barnaby (2011) Low-level dichotomy for quantified constraint satisfaction problems. Information Processing Letters, 111 (20). pp. 999-1003. ISSN 0020-0190

Dantchev, Stefan and Martin, Barnaby and Szeider, Stefan (2011) Parameterized proof complexity. Computational Complexity, 20 (1). pp. 51-85. ISSN 1016-3328

Dantchev, Stefan and Martin, Barnaby and Rhodes, Mark (2009) Tight rank lower bounds for the Sherali–Adams proof system. Theoretical Computer Science, 410 (21-23). pp. 2054-2063. ISSN 0304-3975

Book Section

Madelaine, Florent and Martin, Barnaby (2011) A tetrachotomy for positive first-order logic without equality. In: Logic in Computer Science (LICS), 2011 26th Annual IEEE Symposium on. IEEE, pp. 311-320. ISBN 9781457704512

Bodirsky, Manuel and Hils, Martin and Martin, Barnaby (2010) On the scope of the universal-algebraic approach to constraint satisfaction. In: Logic in Computer Science (LICS), 2010 25th Annual IEEE Symposium on. Institute of Electrical and Electronics Engineers, pp. 90-99. ISBN 9781424475889

Martin, Barnaby (2010) The lattice structure of sets of surjective hyper-operations. In: Principles and practice of constraint programming – CP 2010. Lecture Notes in Computer Science (6308). Springer-Verlag, pp. 368-382. ISBN 9783642153952

Martin, Barnaby and Madelaine, Florent (2007) Hierarchies in fragments of monadic strict NP. In: Computation and logic in the real world. Lecture Notes in Computer Science (4497). Springer Berlin Heidelberg, pp. 542-550. ISBN 9783540730002

Conference or Workshop Item

Carvalho, Catarina and Madelaine, Florent R. and Martin, Barnaby (2015) From complexity to algebra and back: digraph classes, collapsibility and the PGP. In: 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 6-10 Jul 2015, Kyoto, Japan.

Bodirsky, Manuel and Martin, Barnaby and Mottet, Antoine (2015) Constraint satisfaction problems over the integers with successor. In: 42nd International Colloquium Automata, Languages, and Programming (ICALP 2015), 1-10 Jul 2015, Kyoto, Japan.

Martin, Barnaby and Stacho, Juraj (2014) Constraint satisfaction with counting quantifiers 2. In: 9th International Computer Science Symposium in Russia, CSR 2014, 7-11 Jun 2014, Moscow, Russia.

Dapić, Petar and Marković, Petar and Martin, Barnaby (2014) QCSP on semicomplete digraphs. In: 41st International Colloquium on Automata, Languages and Programming, ICALP 2014, 8-11 Jul 2014, Copenhagen, Denmark.

Madelaine, Florent and Martin, Barnaby and Stacho, Juraj (2012) Constraint satisfaction with counting quantifiers. In: The 7th International Computer Science Symposium (CSR 2012), 3-7 Jul 2012, Nizhny Novgorod, Russia.

Golovach, Petr A. and Lidický, Bernard and Martin, Barnaby and Paulusma, Daniël (2012) Finding vertex-surjective graph homomorphisms. In: 7th International Computer Science Symposium (CSR 2012), 3-7 Jul 2012, Nizhny Novgorod, Russia.

Martin, Barnaby (2011) QCSP on partially reflexive forests. In: The 17th International Conference on Principles and Practice of Constraint Programming (CP 2011), 12-16 September 2011, Perugia, Italy.

Martin, Barnaby and Paulusma, Daniël (2011) The computational complexity of disconnected cut and 2K2-partition. In: The 17th International Conference on Principles and Practice of Constraint Programming (CP 2011), 12-16 Sep 2011, Perugia, Italy.

Bodirsky, Manuel and Dalmau, Victor and Martin, Barnaby and Pinsker, Michael (2010) Distance constraint satisfaction problems. In: 35th International Symposium on Mathematical Foundations of Computer Science (MFCS 2010), 23-27 August 2010, Brno, Czech Republic.

Martin, Barnaby and Martin, Jos (2010) The complexity of positive first-order logic without equality II: the four-element case. In: 24th International Workshop (CSL 2010), 19th Annual Conference of the EACSL, 23-27 August 2010, Brno, Czech Republic.

Dantchev, Stefan and Martin, Barnaby (2010) The limits of tractability in resolution-based propositional proof systems. In: 6th International Conference on Computability in Europe: Programs, Proofs, Processes (CIE 2010), 30 June - 4 July 2010, Portugal.

Martin, Barnaby (2008) First-order model checking problems parameterized by the model. In: The 4th Conference on Computability in Europe: Logic and Theory of Algorithms (CiE 2008), 15-20 June, 2008, University of Athens, Greece.

Chen, Hubie and Madelaine, Florent and Martin, Barnaby (2008) Quantified constraints and containment problems. In: 23rd Annual IEEE Symposium on Logic in Computer Science (LICS 2008), 24-27 June 2008, Pittsburgh, PA.

This list was generated on Sat Aug 19 04:36:26 2017 BST.