Dr Barnaby Martin, BA MSc PhD
(email at email@example.com)
I am an Assistant Professor in Computer Science at Durham University in the Algorithms and Complexity Group (ACiD) within the School of Engineering and Computing Sciences. I was previously a lecturer in the Foundations of Computing Group at Middlesex University. Before my permanent appointments I undertook a number of post-doctoral positions in Durham and Paris.
My interests include Complexity Theory in general (Proof Complexity as well as Computational Complexity); Finite Model Theory; and the links between logic and complexity. I am mostly working now on Constraint Satisfaction Problems and their quantifications and other generalisations.
- 1: Bodirsky, Manuel, Martin, Barnaby, Pinsker, Michael & Pongrácz, András (2016), Constraint Satisfaction Problems for Reducts of Homogeneous Graphs, in Chatzigiannakis, Ioannis, Mitzenmacher, Michael, Rabani, Yuval & Sangiorgi, Davide eds, LIPIcs - Leibniz International Porceedings in Informatics 55: 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy. Rome, Schloss Dagstuhl, Leibniz-Zentrum für Informatik, Dagstuhl, 119:1-119:14.
- 2: Bodirsky, Manuel, Martin, Barnaby & Mottet, Antoine (2015), Constraint Satisfaction Problems over the Integers with Successor, in Halldórsson, Magnús M., Iwama, Kazuo, Kobayashi, Naoki & Speckmann, Bettina eds, Lecture Notes in Computer Science, 9134 Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I. Kyoto, Japan, Springer, Berlin, 256-267.
- 3: Carvalho, Catarina, Madelaine, Florent R. & Martin, Barnaby (2015), From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP, 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015. Kyoto, Japan, IEEE, Piscataway, NJ, 462-474.
- 4: Đapić, Petar, Marković, Petar & Martin, Barnaby (2017), Quantified Constraint Satisfaction Problem on semicomplete digraphs, 18: Association for Computing Machinery (ACM), New York, NY, 2.
- 6: Dantchev, Stefan, Martin, Barnaby & Szeider, Stefan (2011). Parameterized Proof Complexity. Computational Complexity 20(1): 51-85.
- Martin, Barnaby, Pongrácz, András & Wrona, Michał (2017). The complexity of counting quantifiers on equality languages. Theoretical Computer Science 670: 56-67.