Real Data–Integer Solution Problems within the Blum-Shub-Smale Computational Model. - Valentin E. Brimkov; Stefan S. Dantchev (J. Complex., 1997)

Lower Bounds, "Pseudopolynomial" and Approximation Algorithms for the Knapsack Problem with Real Coefficients - Valentin E. Brimkov; Stefan S. Dantchev (Electron. Colloquium Comput. Complex., 1998)

On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model. - Valentin E. Brimkov; Stefan S. Dantchev (IFIP TCS, 2000)

On the Algebraic Complexity of Integer Programming - Valentin E. Brimkov; Stefan S. Dantchev (Electron. Colloquium Comput. Complex., 2000)

Tree Resolution Proofs of the Weak Pigeon-Hole Principle. - Stefan S. Dantchev; Søren Riis (CCC, 2001)

"Planar" Tautologies Hard for Resolution. - Stefan S. Dantchev; Søren Riis (FOCS, 2001)

Resolution Width-Size Trade-offs for the Pigeon-Hole Principle. - Stefan S. Dantchev (CCC, 2002)

An alternative to Ben-Or's lower bound for the knapsack problem complexity. - Valentin E. Brimkov; Stefan S. Dantchev (Appl. Math. Lett., 2002)

Improved sorting-based procedure for integer programming. - Stefan S. Dantchev (Math. Program., 2002)

On Relativisation and Complexity Gap. - Stefan S. Dantchev; Søren Riis (CSL, 2003)

Complexity Analysis for Digital Hyperplane Recognition in Arbitrary Fixed Dimension. - Valentin E. Brimkov; Stefan S. Dantchev (DGCI, 2005)

On the computational limits of infinite satisfaction. - Stefan S. Dantchev; Frank D. Valencia (SAC, 2005)

On the Complexity of the Sperner Lemma. - Stefan S. Dantchev (CiE, 2006)

Relativisation Provides Natural Separations for Resolution-Based Proof Systems. - Stefan S. Dantchev (CSR, 2006)

Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction Problems. - Stefan S. Dantchev; Florent R. Madelaine (CSR, 2006)

Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems. - Stefan S. Dantchev (STOC, 2007)

Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution. - Stefan S. Dantchev; Barnaby Martin; Stefan Szeider (Electron. Colloquium Comput. Complex., 2007)

Digital hyperplane recognition in arbitrary fixed dimension within an algebraic computation model. - Valentin E. Brimkov; Stefan S. Dantchev (Image Vis. Comput., 2007)

Preface. - Hajo Broersma; Stefan S. Dantchev; Matthew Johnson 002; Stefan Szeider (J. Discrete Algorithms, 2008)

Tight rank lower bounds for the Sherali-Adams proof system. - Stefan S. Dantchev; Barnaby Martin; Mark Nicholas Charles Rhodes (Theor. Comput. Sci., 2009)

Editorial. - Hajo Broersma; Stefan S. Dantchev; Matthew Johnson 002; Stefan Szeider (J. Discrete Algorithms, 2010)

Parameterized Proof Complexity. - Stefan S. Dantchev; Barnaby Martin; Stefan Szeider (Comput. Complex., 2011)

Dynamic Neighbourhood Cellular Automata. - Stefan S. Dantchev (Comput. J., 2011)

Sublinear-time algorithms for tournament graphs. - Stefan S. Dantchev; Tom Friedetzky; Lars Nagel 001 (J. Comb. Optim., 2011)

The limits of tractability in Resolution-based propositional proof systems. - Stefan S. Dantchev; Barnaby Martin (Ann. Pure Appl. Log., 2012)

Efficient construction of the Čech complex. - Stefan S. Dantchev; Ioannis P. Ivrissimtzis (Comput. Graph., 2012)

Cutting Planes and the Parameter Cutwidth. - Stefan S. Dantchev; Barnaby Martin (Theory Comput. Syst., 2012)

Parameterized Resolution with Bounded Conjunction. - Stefan S. Dantchev; Barnaby Martin (CSR, 2013)

Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems. - Stefan S. Dantchev; Barnaby Martin (Comput. Complex., 2013)

Relativisation makes contradictions harder for Resolution - Stefan S. Dantchev; Barnaby Martin (CoRR, 2013)

Relativization makes contradictions harder for Resolution. - Stefan S. Dantchev; Barnaby Martin (Ann. Pure Appl. Log., 2014)

Simplicial Complex Entropy. - Stefan S. Dantchev; Ioannis P. Ivrissimtzis (MMCS, 2016)

Resolution and the binary encoding of combinatorial principles. - Stefan S. Dantchev; Nicola Galesi; Barnaby Martin (Electron. Colloquium Comput. Complex., 2018)

Sherali-Adams and the Binary Encoding of Combinatorial Principles. - Stefan S. Dantchev; Abdul Ghani 001; Barnaby Martin (LATIN, 2020)

Depth lower bounds in Stabbing Planes for combinatorial principles. - Stefan S. Dantchev; Nicola Galesi; Abdul Ghani 001; Barnaby Martin (Electron. Colloquium Comput. Complex., 2021)

The Riis Complexity Gap for QBF Resolution. - Olaf Beyersdorff; Judith Clymo; Stefan S. Dantchev; Barnaby Martin (J. Satisf. Boolean Model. Comput., 2024)

Proof Complexity and the Binary Encoding of Combinatorial Principles. - Stefan S. Dantchev; Nicola Galesi; Abdul Ghani 001; Barnaby Martin (SIAM J. Comput., 2024)