Papers

• Dmitriy Itsykson, Vsevolod Oparin, Mikhail Slabodkin, Dmitriy Sokolov: Tight Lower Bounds on the Resolution Complexity of Perfect Matching Principles, Fundamenta Informaticae 145 (2016) 1-14 [link]

• Dmitry Itsykson, Alexander Okhotin, Vsevolod Oparin: Computational and proof complexity of partial string avoidability, MFCS 2016. [link]

• Vsevolod Oparin: Tight upper bound on splitting by linear combinations for pigeonhole principle, SAT 2016. [springer], [draft]

• Dmitry Itsykson, Anna Malova, Vsevolod Oparin, Dmitry Sokolov: Tree-like resolution complexity of two planar problems. CoRR abs/1412.1124 (2014) [arXiv]

• Dmitry Itsykson, Vsevolod Oparin: Graph Expansion, Tseitin Formulas and Resolution Proofs for CSP. CSR 2013: 162-173 [springer]

Talks

• Graph Expansion, Tseitin formulas, and resolution proofs for CSP. RUFIDIM 2013. SlideShare Link