| 2026 | SOFSEM | Quantified Colouring and H-Free Algorithmics. | Kristina Asimi, Tala Eagling-Vose, Santiago Guzmn-Pro, Barnaby Martin, Yiming Qiu |
| 2026 | WG | Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification. | Tala Eagling-Vose, Jorik Jooken, Felicia Lucke, Barnaby Martin, Danil Paulusma |
| 2025 | ICALP | Restricted CSPs and F-Free Digraph Algorithmics. | Santiago Guzmn-Pro, Barnaby Martin |
| 2024 | CiE | Graph Homomorphism, Monotone Classes and Bounded Pathwidth. | Tala Eagling-Vose, Barnaby Martin, Danil Paulusma, Siani Smith |
| 2024 | ISAAC | Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-Graphs. | Vadim V. Lozin, Barnaby Martin, Sukanya Pandey, Danil Paulusma, Mark H. Siggers, Siani Smith, Erik Jan van Leeuwen |
| 2024 | IWOCA | Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. | Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Danil Paulusma, Siani Smith, Erik Jan van Leeuwen |
| 2023 | MFCS | Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs. | Matthew Johnson, Barnaby Martin, Sukanya Pandey, Danil Paulusma, Siani Smith, Erik Jan van Leeuwen |
| 2023 | SODA | The complete classification for quantified equality constraints. | Dmitriy Zhuk, Barnaby Martin, Michal Wrona |
| 2022 | STACS | Depth Lower Bounds in Stabbing Planes for Combinatorial Principles. | Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin |
| 2022 | WALCOM | The Complexity of L(p, q)-Edge-Labelling. | Gatan Berthe, Barnaby Martin, Danil Paulusma, Siani Smith |
| 2022 | WG | Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. | Barnaby Martin, Danil Paulusma, Siani Smith, Erik Jan van Leeuwen |
| 2021 | CIAC | Colouring Graphs of Bounded Diameter in the Absence of Small Cycles. | Barnaby Martin, Danil Paulusma, Siani Smith |
| 2021 | CSR | Injective Colouring for H-Free Graphs. | Jan Bok, Nikola Jedlickov, Barnaby Martin, Danil Paulusma, Siani Smith |
| 2021 | ESA | QCSP on Reflexive Tournaments. | Benot Larose, Petar Markovic, Barnaby Martin, Danil Paulusma, Siani Smith, Stanislav Zivn |
| 2021 | ISAAC | Partitioning H-Free Graphs of Bounded Diameter. | Christoph Brause, Petr A. Golovach, Barnaby Martin, Danil Paulusma, Siani Smith |
| 2021 | IWOCA | Disjoint Paths and Connected Subgraphs for H-Free Graphs. | Walter Kern, Barnaby Martin, Danil Paulusma, Siani Smith, Erik Jan van Leeuwen |
| 2021 | WG | Acyclic, Star, and Injective Colouring: Bounding the Diameter. | Christoph Brause, Petr A. Golovach, Barnaby Martin, Danil Paulusma, Siani Smith |
| 2020 | ESA | Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs. | Jan Bok, Nikola Jedlickov, Barnaby Martin, Danil Paulusma, Siani Smith |
| 2020 | LATIN | Sherali-Adams and the Binary Encoding of Combinatorial Principles. | Stefan S. Dantchev, Abdul Ghani, Barnaby Martin |
| 2020 | STOC | QCSP monsters and the demise of the chen conjecture. | Dmitriy Zhuk, Barnaby Martin |
| 2019 | MFCS | Colouring H-Free Graphs of Bounded Diameter. | Barnaby Martin, Danil Paulusma, Siani Smith |
| 2018 | ESA | Disconnected Cuts in Claw-free Graphs. | Barnaby Martin, Danil Paulusma, Erik Jan van Leeuwen |
| 2018 | IJCAI | Classification Transfer for Qualitative Reasoning Problems. | Manuel Bodirsky, Peter Jonsson, Barnaby Martin, Antoine Mottet |
| 2018 | MFCS | The Complexity of Disjunctive Linear Diophantine Constraints. | Manuel Bodirsky, Barnaby Martin, Marcello Mamino, Antoine Mottet |
| 2018 | MFCS | Consistency for Counting Quantifiers. | Florent R. Madelaine, Barnaby Martin |
| 2018 | STACS | Surjective H-Colouring over Reflexive Digraphs. | Benot Larose, Barnaby Martin, Danil Paulusma |
| 2017 | CiE | Surjective H-Colouring: New Hardness Results. | Petr A. Golovach, Matthew Johnson, Barnaby Martin, Danil Paulusma, Anthony Stewart |
| 2017 | MFCS | The Complexity of Quantified Constraints Using the Algebraic Formulation. | Catarina Carvalho, Barnaby Martin, Dmitriy Zhuk |
| 2016 | CiE | Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic. | Christian Glaer, Peter Jonsson, Barnaby Martin |
| 2016 | CiE | The Complexity of Counting Quantifiers on Equality Languages. | Barnaby Martin, Andrs Pongrcz, Michal Wrona |
| 2016 | ICALP | Constraint Satisfaction Problems for Reducts of Homogeneous Graphs. | Manuel Bodirsky, Barnaby Martin, Michael Pinsker, Andrs Pongrcz |
| 2015 | CSL | First-Order Queries on Finite Abelian Groups. | Simone Bova, Barnaby Martin |
| 2015 | ICALP | Constraint Satisfaction Problems over the Integers with Successor. | Manuel Bodirsky, Barnaby Martin, Antoine Mottet |
| 2015 | LICS | From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP. | Catarina Carvalho, Florent R. Madelaine, Barnaby Martin |
| 2014 | CSR | Constraint Satisfaction with Counting Quantifiers 2. | Barnaby Martin, Juraj Stacho |
| 2014 | ICALP | QCSP on Semicomplete Digraphs. | Petar Dapic, Petar Markovic, Barnaby Martin |
| 2013 | CSR | Parameterized Resolution with Bounded Conjunction. | Stefan S. Dantchev, Barnaby Martin |
| 2013 | CSR | QCSP on Partially Reflexive Cycles - The Wavy Line of Tractability. | Florent R. Madelaine, Barnaby Martin |
| 2012 | CP | Containment, Equivalence and Coreness from CSP to QCSP and Beyond. | Florent R. Madelaine, Barnaby Martin |
| 2012 | CSR | Finding Vertex-Surjective Graph Homomorphisms. | Petr A. Golovach, Bernard Lidick, Barnaby Martin, Danil Paulusma |
| 2012 | CSR | Constraint Satisfaction with Counting Quantifiers. | Florent R. Madelaine, Barnaby Martin, Juraj Stacho |
| 2011 | CP | QCSP on Partially Reflexive Forests. | Barnaby Martin |
| 2011 | CP | The Computational Complexity of Disconnected Cut and 2K 2-Partition. | Barnaby Martin, Danil Paulusma |
| 2011 | LICS | A Tetrachotomy for Positive First-Order Logic without Equality. | Florent R. Madelaine, Barnaby Martin |
| 2010 | CiE | The Limits of Tractability in Resolution-Based Propositional Proof Systems. | Stefan S. Dantchev, Barnaby Martin |
| 2010 | CP | The Lattice Structure of Sets of Surjective Hyper-Operations. | Barnaby Martin |
| 2010 | CSL | The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case. | Barnaby Martin, Jos Martin |
| 2010 | LICS | On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction. | Manuel Bodirsky, Martin Hils, Barnaby Martin |
| 2010 | MFCS | Distance Constraint Satisfaction Problems. | Manuel Bodirsky, Vctor Dalmau, Barnaby Martin, Michael Pinsker |
| 2009 | CiE | Cutting Planes and the Parameter Cutwidth. | Stefan S. Dantchev, Barnaby Martin |
| 2009 | LICS | The Complexity of Positive First-order Logic without Equality. | Florent R. Madelaine, Barnaby Martin |
| 2008 | CiE | First-Order Model Checking Problems Parameterized by the Model. | Barnaby Martin |
| 2008 | LICS | Quantified Constraints and Containment Problems. | Hubie Chen, Florent R. Madelaine, Barnaby Martin |
| 2007 | CiE | Hierarchies in Fragments of Monadic Strict NP. | Barnaby Martin, Florent R. Madelaine |
| 2007 | FOCS | Parameterized Proof Complexity. | Stefan S. Dantchev, Barnaby Martin, Stefan Szeider |
| 2006 | CiE | Towards a Trichotomy for Quantified | Barnaby Martin, Florent R. Madelaine |