Profile
Dr Stefan Dantchev, MSc Sofia PhD Aarhus
Lecturer in the School of Engineering and Computing Sciences
Telephone: +44 (0) 191 33 41761
Room number: CS2.09
(email at s.s.dantchev@durham.ac.uk)
Research Groups
School of Engineering and Computing Sciences
- Algorithms and Complexity Research Group
Department of Computer Science
- Algorithms and Complexity
Selected Publications
- 1: Dantchev, Stefan & Martin, Barnaby (2012). The limits of tractability in Resolution-based propositional proof systems. Annals of Pure and Applied Logic 163(3): 656-668.
- 2: Dantchev, Stefan, Martin, Barnaby & Rhodes, Mark (2009). Tight rank lower bounds for the Sherali–Adams proof system. Theoretical Computer Science 410(21-23): 2054-2063.
- 3: Dantchev, Stefan & Martin, Barnaby (2012). Cutting Planes and the Parameter Cutwidth. Theory of Computing Systems 51(1): 50-64.
- 4: Dantchev, Stefan (2011). Dynamic Neighbourhood Cellular Automata. The Computer Journal 54(1): 26-30.
- 5: Dantchev, Stefan, Martin, Barnaby & Szeider, Stefan (2011). Parameterized Proof Complexity. Computational Complexity 20(1): 51-85.
- 6: Dantchev, Stefan & Martin, Barnaby (2012). Rank complexity gap for Lovasz-Schrijver and Sherali-Adams proof systems. Computational Complexity
- Stefan Dantchev & Florent Madelaine (2006), Bounded-degree Forbidden-Pattern Problems are Constraint Satisfaction Problems, in Dima Grigoriev, John Harrison, & Edward A. Hirsch eds, Lecture Notes in Computer Science 3967: International Computer Science Symposium in Russia. St. Peterburg, Russia.
- Dantchev, Stefan, Friedetzky, Tom & Nagel, Lars (2009). Sublinear-Time Algorithms for Tournament Graphs. 15thAnnual International Conference of Computing and Combinatorics (COCOON 2009), Niagara Falls, New York, USA, Springer Berlin / Heidelberg.
- Dantchev, Stefan, Martin, Barnaby & Szeider, Stefan (2007). Parameterized proof complexity. 48th Annual IEEE Symposium on Foundations of Computer Science, Providence, USA, IEEE Press.
- Dantchev, Stefan (2007). Rank complexity gap for Lovasz-Schrijver and Sherali-Adams proof systems. 39th Annual ACM Symposium on Theory of Computing, San Diego, CA, ACM.
- Dantchev, Stefan & Valencia, Frank (2005). On the Computational Limits of Infinite Satisfaction. The 20th Annual ACM Symposium on Applied Computing, Santa Fe, USA, ACM.
- Dantchev, Stefan. & Riis, Soren. (2003). On relativisation and complexity gap for resolution-based proof systems. 12th Annual Conference of the EACSL Computer Science Logic, Vienna, Austria, Springer.
- Dantchev, Stefan (2002). Width-Size Trade-offs for the Pigeon-Hole Principle. The 17th Annual Conference on Computational Complexity, Montreal, Canada, IEEE.
- Dantchev, Stefan. & Riis, Soren. (2001). Planar tautologies hard for resolution. 42nd IEEE Symposium of Foundations of Computer Science, Las Vegas, Nev, IEEE.
- Dantchev, Stefan. & Riis, Søren. (2001). Tree resolution proofs of the weak pigeon-hole principle. 16th Annual IEEE Conference on Computational Complexity, Chicago, Ill, IEEE.
- Dantchev, Stefan, Friedetzky, Tom & Nagel, Lars (2010). Sublinear-time algorithms for tournament graphs. Journal of Combinatorial Optimization
- Dantchev, Stefan. (2002). Improved sorting-based procedure for integer programming. Mathematical programming 92(2): 297-300.