| 2022 | STACS | Depth Lower Bounds in Stabbing Planes for Combinatorial Principles. | Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin |
| 2020 | LATIN | Sherali-Adams and the Binary Encoding of Combinatorial Principles. | Stefan S. Dantchev, Abdul Ghani, Barnaby Martin |
| 2013 | CSR | Parameterized Resolution with Bounded Conjunction. | Stefan S. Dantchev, Barnaby Martin |
| 2010 | CiE | The Limits of Tractability in Resolution-Based Propositional Proof Systems. | Stefan S. Dantchev, Barnaby Martin |
| 2009 | CiE | Cutting Planes and the Parameter Cutwidth. | Stefan S. Dantchev, Barnaby Martin |
| 2009 | COCOON | Sublinear-Time Algorithms for Tournament Graphs. | Stefan S. Dantchev, Tom Friedetzky, Lars Nagel |
| 2007 | FOCS | Parameterized Proof Complexity. | Stefan S. Dantchev, Barnaby Martin, Stefan Szeider |
| 2007 | STOC | Rank complexity gap for Lovsz-Schrijver and Sherali-Adams proof systems. | Stefan S. Dantchev |
| 2006 | CiE | On the Complexity of the Sperner Lemma. | Stefan S. Dantchev |
| 2006 | CSR | Relativisation Provides Natural Separations for Resolution-Based Proof Systems. | Stefan S. Dantchev |
| 2006 | CSR | Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction Problems. | Stefan S. Dantchev, Florent R. Madelaine |
| 2005 | SAC | On the computational limits of infinite satisfaction. | Stefan S. Dantchev, Frank D. Valencia |
| 2003 | CSL | On Relativisation and Complexity Gap. | Stefan S. Dantchev, Sren Riis |
| 2001 | FOCS | "Planar" Tautologies Hard for Resolution. | Stefan S. Dantchev, Sren Riis |