Staff profile

• ACiD: Algorithms and Complexity

Conference Paper

• Dantchev, Stefan Ghani, Abdul & Martin, Barnaby (2020), Sherali-Adams and the binary encoding of combinatorial principles, in Kohayakawa, Yoshiharu & Miyazawa, Flávio Keidi eds, Latin American Symposium on Theoretical Informatics 12118: LATIN 2020. São Paulo, Brazil, 336-347.
• Dantchev, Stefan, Galesi, Nicola & Martin, Barnaby (2019), Resolution and the binary encoding of combinatorial principles, in Shpilka, Amir eds, Leibniz International Proceedings in Informatics (LIPIcs) 137: Computational Complexity Conference. New Brunswick, New Jersey, USA, Dagstuhl Publishing, Saarbrücken/Wadern, 6:1–6:25.
• Dantchev, Stefan & Ivrissimtzis, Ioannis (2017), Simplicial Complex Entropy, in Floater, Michael S., Lyche, Tom, Mazure, Marie-Laurence, Mørken, Knut & Schumaker, Larry L. eds, Lecture Notes in Computer Science 10521: 9th International Conference on Mathematical Methods for Curves and Surfaces. Tønsberg, Norway, Springer, Cham, 96-107.
• Dantchev, Stefan, Friedetzky, Tom & Nagel, Lars (2009), Sublinear-Time Algorithms for Tournament Graphs, in Ngo, H. Q. eds, Lecture Notes in Computer Science 5609: 15thAnnual International Conference of Computing and Combinatorics (COCOON 2009). Niagara Falls, New York, USA, Springer, Berlin Heidelberg, 459-471.
• Dantchev, Stefan, Martin, Barnaby & Szeider, Stefan (2007), Parameterized proof complexity, IEEE Symposium on Foundations of Computer Science 48th Annual IEEE Symposium on Foundations of Computer Science. Providence, USA, IEEE Press, 150-160.
• Dantchev, Stefan (2007), Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems, ACM symposium on Theory of computing 39th Annual ACM Symposium on Theory of Computing. San Diego, CA, ACM, New York, 311-317.
• 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, St Petersburg.

Conference Proceeding

• 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.

Journal Article

• Dantchev, Stefan & Heppenstall, Alan (Accepted). Combinatorial Axiomatisation of Edge-weighted PageRank. Internet Mathematics
• Dantchev, Stefan & Martin, Barnaby (2014). Relativization makes contradictions harder for Resolution. Annals of Pure and Applied Logic 165(3): 837-857.
• Dantchev, Stefan & Martin, Barnaby (2013). Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems. Computational Complexity 22(1): 191-213.
• 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.
• Dantchev, Stefan & Martin, Barnaby (2012). Cutting Planes and the Parameter Cutwidth. Theory of Computing Systems 51(1): 50-64.
• Dantchev, Stefan, Martin, Barnaby & Szeider, Stefan (2011). Parameterized Proof Complexity. Computational Complexity 20(1): 51-85.
• Dantchev, Stefan (2011). Dynamic Neighbourhood Cellular Automata. The Computer Journal 54(1): 26-30.
• Dantchev, Stefan, Friedetzky, Tom & Nagel, Lars (2010). Sublinear-time algorithms for tournament graphs. Journal of Combinatorial Optimization
• 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.
• Dantchev, Stefan. (2002). Improved sorting-based procedure for integer programming. Mathematical programming 92(2): 297-300.