Stefan Dantchev
with B. Martin and S. Szeider, Parameterized Proof Complexity, Computational Complexity, accepted.
preliminary version in FOCS 2007, pp 150 – 160.
with T. Friedetzky and L. Nagel, Sublinear-time algorithms for tournament graphs, Journal of Combinatorial Optimization, published online 30 Apr 2010.
preliminary version in COCOON 2009, LNCS, vol 5609, pp 459 – 471.
Dynamic Neighbourhood Cellular Automata, The Computer Journal, published online 28 Mar 2009.
preliminary version in BCS Visions 2008, pp 61 – 68.
with B. Martin and M. Rhodes, Tight rank lower bounds for the Sherali–Adams proof system, Theoretical Computer Science, vol 410, no 21-23, 2009, pp 2054 – 2063.