Graph Expansion, Tseitin Formulas and Resolution Proofs for CSP. - Dmitry Itsykson; Vsevolod Oparin (CSR, 2013)

Tree-like resolution complexity of two planar problems. - Dmitry Itsykson; Anna Malova; Vsevolod Oparin; Dmitry Sokolov 001 (CoRR, 2014)

Tight Upper Bound on Splitting by Linear Combinations for Pigeonhole Principle. - Vsevolod Oparin (SAT, 2016)

Tight Lower Bounds on the Resolution Complexity of Perfect Matching Principles. - Dmitry Itsykson; Vsevolod Oparin; Mikhail Slabodkin; Dmitry Sokolov 001 (Fundam. Informaticae, 2016)

Algorithmic and Hardness Results for the Hub Labeling Problem. - Haris Angelidakis; Yury Makarychev; Vsevolod Oparin (SODA, 2017)

Computational and proof complexity of partial string avoidability. - Dmitry Itsykson; Alexander Okhotin; Vsevolod Oparin (Electron. Colloquium Comput. Complex., 2020)