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

Article

Martin, Barnaby, Raimondi, Franco ORCID: https://orcid.org/0000-0002-9508-7713, 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 [Article] (doi:10.1016/j.dam.2017.03.013)

Bodirskya, Manuel, Dalmau, Victor, Martin, Barnaby, Mottet, Antoine and Pinsker, Michael (2016) Distance constraint satisfaction problems. Information and Computation, 247 . pp. 87-105. ISSN 0890-5401 [Article] (doi:10.1016/j.ic.2015.11.010)

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 [Article] (doi:10.1007/s00037-012-0049-1)

Bodirsky, Manuel, 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 [Article]

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 [Article] (doi:10.1145/2071368.2071373)

Dantchev, Stefan and Martin, Barnaby (2011) Cutting planes and the parameter cutwidth. Theory of Computing Systems, 51 (1) . pp. 50-64. ISSN 1432-4350 [Article] (doi:10.1007/s00224-011-9373-0)

Dantchev, Stefan and Martin, Barnaby (2011) The limits of tractability in resolution-based propositional proof systems. Annals of Pure and Applied Logic, 163 (6) . pp. 656-668. ISSN 0168-0072 [Article] (doi:10.1016/j.apal.2011.11.001)

Martin, Barnaby (2011) Low-level dichotomy for quantified constraint satisfaction problems. Information Processing Letters, 111 (20) . pp. 999-1003. ISSN 0020-0190 [Article] (doi:10.1016/j.ipl.2011.07.010)

Dantchev, Stefan, Martin, Barnaby and Szeider, Stefan (2011) Parameterized proof complexity. Computational Complexity, 20 (1) . pp. 51-85. ISSN 1016-3328 [Article] (doi:10.1007/s00037-010-0001-1)

Dantchev, Stefan, 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 [Article] (doi:10.1016/j.tcs.2009.01.002)

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. [Book Section] (doi:10.1109/LICS.2011.27)

Bodirsky, Manuel, 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. [Book Section] (doi:10.1109/LICS.2010.13)

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. [Book Section] (doi:10.1007/978-3-642-15396-9_31)

Martin, Barnaby and Madelaine, Florent (2007) Hierarchies in fragments of monadic strict NP. In: Computation and logic in the real world: Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings. Cooper, Barry S., Löwe, Benedikt and Sorbi, Andrea, eds. Lecture Notes in Computer Science, 4497 . Springer Berlin Heidelberg, pp. 542-550. ISBN 9783540730002. [Book Section] (doi:10.1007/978-3-540-73001-9_56)

Conference or Workshop Item

Bodirsky, Manuel, Martin, Barnaby, Pinsker, Michael and Pongrácz, András (2016) Constraint satisfaction problems for reducts of homogeneous graphs. 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016).. In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), 12-15 Jul 2016, Rome, Italy. ISBN 9783959770132. ISSN 1868-8969 [Conference or Workshop Item] (doi:10.4230/LIPIcs.ICALP.2016.119)

Bodirsky, Manuel, Martin, Barnaby and Mottet, Antoine (2015) Constraint satisfaction problems over the integers with successor. Automata, Languages, and Programming: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I. In: 42nd ICALP 2015, 06-10 Jul 2015, Kyoto, Japan. pbk-ISBN 9783662476710, e-ISBN 9783662476727. ISSN 0302-9743 [Conference or Workshop Item] (doi:10.1007/978-3-662-47672-7_21)

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

Martin, Barnaby and Stacho, Juraj (2014) Constraint satisfaction with counting quantifiers 2. Computer Science - Theory and Applications: 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings. In: 9th International Computer Science Symposium in Russia, CSR 2014, 7-11 Jun 2014, Moscow, Russia. ISBN 9783319066851. ISSN 0302-9743 [Conference or Workshop Item]

Dapić, Petar, Marković, Petar and Martin, Barnaby (2014) QCSP on semicomplete digraphs. Automata, Languages, and Programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I. In: 41st International Colloquium on Automata, Languages and Programming, ICALP 2014, 8-11 Jul 2014, Copenhagen, Denmark. ISBN 9783662439470. ISSN 0302-9743 [Conference or Workshop Item]

Madelaine, Florent, Martin, Barnaby and Stacho, Juraj (2012) Constraint satisfaction with counting quantifiers. Computer Science - Theory and Applications. In: The 7th International Computer Science Symposium (CSR 2012), 3-7 Jul 2012, Nizhny Novgorod, Russia. ISBN 9783642306419. ISSN 0302-9743 [Conference or Workshop Item] (doi:10.1007/978-3-642-30642-6_24)

Golovach, Petr A., Lidický, Bernard, Martin, Barnaby and Paulusma, Daniël (2012) Finding vertex-surjective graph homomorphisms. Computer Science -- Theory and Applications. In: 7th International Computer Science Symposium (CSR 2012), 3-7 Jul 2012, Nizhny Novgorod, Russia. ISBN 9783642306419. ISSN 0302-9743 [Conference or Workshop Item] (doi:10.1007/978-3-642-30642-6_16)

Martin, Barnaby (2011) QCSP on partially reflexive forests. Principles and Practice of Constraint Programming – CP 2011. In: The 17th International Conference on Principles and Practice of Constraint Programming (CP 2011), 12-16 September 2011, Perugia, Italy. ISBN 9783642237850. ISSN 0302-9743 [Conference or Workshop Item] (doi:10.1007/978-3-642-23786-7_42)

Martin, Barnaby and Paulusma, Daniël (2011) The computational complexity of disconnected cut and 2K2-partition. Principles and Practice of Constraint Programming – CP 2011. In: The 17th International Conference on Principles and Practice of Constraint Programming (CP 2011), 12-16 Sep 2011, Perugia, Italy. ISBN 9783642237850. ISSN 0302-9743 [Conference or Workshop Item] (doi:10.1007/978-3-642-23786-7_43)

Bodirsky, Manuel, Dalmau, Victor, Martin, Barnaby and Pinsker, Michael (2010) Distance constraint satisfaction problems. Mathematical Foundations of Computer Science 2010. In: 35th International Symposium on Mathematical Foundations of Computer Science (MFCS 2010), 23-27 August 2010, Brno, Czech Republic. ISBN 9783642151545. ISSN 0302-9743 [Conference or Workshop Item] (doi:10.1007/978-3-642-15155-2_16)

Martin, Barnaby and Martin, Jos (2010) The complexity of positive first-order logic without equality II: the four-element case. Computer Science Logic. In: 24th International Workshop (CSL 2010), 19th Annual Conference of the EACSL, 23-27 August 2010, Brno, Czech Republic. ISBN 9783642152047. ISSN 0302-9743 [Conference or Workshop Item] (doi:10.1007/978-3-642-15205-4_33)

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. . [Conference or Workshop Item]

Chen, Hubie, Madelaine, Florent and Martin, Barnaby (2008) Quantified constraints and containment problems. 2008 23rd Annual IEEE Symposium on Logic in Computer Science. In: 23rd Annual IEEE Symposium on Logic in Computer Science (LICS 2008), 24-27 June 2008, Pittsburgh, PA, USA. ISBN 9780769531830. ISSN 1043-6871 [Conference or Workshop Item] (doi:10.1109/LICS.2008.15)

Martin, Barnaby (2008) First-order model checking problems parameterized by the model. Logic and Theory of Algorithms. In: The 4th Conference on Computability in Europe: Logic and Theory of Algorithms (CiE 2008), 15-20 June, 2008, University of Athens, Greece. ISBN 9783540694052. ISSN 0302-9743 [Conference or Workshop Item] (doi:10.1007/978-3-540-69407-6_45)