Staff profile

Conference Paper

• Dantchev, S., Ghani, A., & Martin, B. (2020). Sherali-Adams and the binary encoding of combinatorial principles. In Y. Kohayakawa, & F. K. Miyazawa (Eds.), LATIN 2020: Theoretical Informatics (336-347). https://doi.org/10.1007/978-3-030-61792-9_27
• Dantchev, S., Galesi, N., & Martin, B. (2019). Resolution and the binary encoding of combinatorial principles. In A. Shpilka (Ed.), 34th Computational Complexity Conference (CCC 2019) (6:1-6:25). https://doi.org/10.4230/lipics.ccc.2019.6
• Dantchev, S., & Ivrissimtzis, I. (2017). Simplicial Complex Entropy. In M. S. Floater, T. Lyche, M. Mazure, K. Mørken, & L. L. Schumaker (Eds.), Mathematical methods for curves and surfaces : 9th International Conference, MMCS 2016, Tønsberg, Norway, June 23 - June 28, 2016. Revised selected papers (96-107). https://doi.org/10.1007/978-3-319-67885-6_5
• Dantchev, S., Friedetzky, T., & Nagel, L. (2009). Sublinear-Time Algorithms for Tournament Graphs. In H. Q. Ngo (Ed.), Computing and combinatorics : 15th Annual International Conference, COCOON 2009, 13-15 July 2009, Niagara Falls, NY, USA ; proceedings (459-471). https://doi.org/10.1007/978-3-642-02882-3_46
• Dantchev, S., Martin, B., & Szeider, S. (2007). Parameterized proof complexity. In 48th Annual IEEE Symposium on Foundations of Computer Science, FOCS '07, 21-23 October 2007, Providence, RI ; proceedings (150-160). https://doi.org/10.1109/focs.2007.53
• Dantchev, S. (2007). Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems. In STOC '07 : proceedings of the 39th Annual ACM Symposium on Theory of Computing : San Diego, California, USA, June 11-13, 2007 (311-317). https://doi.org/10.1145/1250790.1250837
• Dantchev, S., & Madelaine, F. (2006). Bounded-degree Forbidden-Pattern Problems are Constraint Satisfaction Problems. In D. Grigoriev, J. Harrison, & E. A. Hirsch (Eds.), . https://doi.org/10.1007/11753728_18
• Dantchev, S., & Valencia, F. (2005). On the Computational Limits of Infinite Satisfaction.
• Dantchev, S., & Riis, S. (2003). On relativisation and complexity gap for resolution-based proof systems. In Computer science logic : 17th International Workshop CSL 2003, 12th Annual Conference of the EACSL, 8th Kurt Gödel Colloquium, KGC 2003, 25-30 August 2003, Vienna, Austria ; proceedings (142-154). https://doi.org/10.1007/978-3-540-45220-1_14
• Dantchev, S. (2002). Width-Size Trade-offs for the Pigeon-Hole Principle.
• Dantchev, S., & Riis, S. (2001). Planar tautologies hard for resolution. In 42nd IEEE Symposium on Foundations of Computer Science, FOCS 2001, 14-17 October 2001, Las Vegas, Nevada ; proceedings (220-229). https://doi.org/10.1109/sfcs.2001.959896
• Dantchev, S., & Riis, S. (2001). Tree resolution proofs of the weak pigeon-hole principle. In 16th Annual IEEE Conference on Computational Complexity, 18-21 June 2001, Chicago, Illinois ; proceedings (69-77). https://doi.org/10.1109/ccc.2001.933873

Journal Article

• Dantchev, S., & Heppenstall, A. (in press). Combinatorial Axiomatisation of Edge-weighted PageRank. Internet mathematics,
• Dantchev, S., & Martin, B. (2014). Relativization makes contradictions harder for Resolution. Annals of Pure and Applied Logic, 165(3), 837-857. https://doi.org/10.1016/j.apal.2013.10.009
• Dantchev, S., & Martin, B. (2013). Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems. Computational Complexity, 22(1), 191-213. https://doi.org/10.1007/s00037-012-0049-1
• Dantchev, S., & Martin, B. (2012). Cutting Planes and the Parameter Cutwidth. Theory of Computing Systems, 51(1), 50-64. https://doi.org/10.1007/s00224-011-9373-0
• Dantchev, S., & Martin, B. (2012). The limits of tractability in Resolution-based propositional proof systems. Annals of Pure and Applied Logic, 163(3), 656-668. https://doi.org/10.1016/j.apal.2011.11.001
• Dantchev, S., Martin, B., & Szeider, S. (2011). Parameterized Proof Complexity. Computational Complexity, 20(1), 51-85. https://doi.org/10.1007/s00037-010-0001-1
• Dantchev, S. (2011). Dynamic Neighbourhood Cellular Automata. The Computer Journal, 54(1), 26-30. https://doi.org/10.1093/comjnl/bxp019
• Dantchev, S., Friedetzky, T., & Nagel, L. (2010). Sublinear-time algorithms for tournament graphs. Journal of Combinatorial Optimization, https://doi.org/10.1007/s10878-010-9325-7
• Dantchev, S., Martin, B., & Rhodes, M. (2009). Tight rank lower bounds for the Sherali–Adams proof system. Theoretical Computer Science, 410(21-23), 2054-2063. https://doi.org/10.1016/j.tcs.2009.01.002
• Dantchev, S. (2002). Improved sorting-based procedure for integer programming. Mathematical Programming, 92(2), 297-300. https://doi.org/10.1007/s101070100245