Vsevolod Oparin

Publication Activity (10 Years)

Years Active: 2013-2021
Publications (10 Years): 7

Top Topics

Complexity Analysis

Tree Decompositions

Top Venues

Fundam. Informaticae

ACM Trans. Comput. Theory

Publications

Dmitry Itsykson, Alexander Okhotin, Vsevolod Oparin
Computational and Proof Complexity of Partial String Avoidability. ACM Trans. Comput. Theory 13 (1) (2021)
Dmitry Itsykson, Alexander Okhotin, Vsevolod Oparin
Computational and proof complexity of partial string avoidability. Electron. Colloquium Comput. Complex. 27 (2020)
Haris Angelidakis, Yury Makarychev, Vsevolod Oparin
Algorithmic and Hardness Results for the Hub Labeling Problem. SODA (2017)
Dmitry Itsykson, Alexander Okhotin, Vsevolod Oparin
Computational and Proof Complexity of Partial String Avoidability. MFCS (2016)
Vsevolod Oparin
Tight Upper Bound on Splitting by Linear Combinations for Pigeonhole Principle. SAT (2016)
Haris Angelidakis, Yury Makarychev, Vsevolod Oparin
Algorithmic and Hardness Results for the Hub Labeling Problem. CoRR (2016)
Dmitry Itsykson, Vsevolod Oparin, Mikhail Slabodkin, Dmitry Sokolov
Tight Lower Bounds on the Resolution Complexity of Perfect Matching Principles. Fundam. Informaticae 145 (3) (2016)
Dmitry Itsykson, Anna Malova, Vsevolod Oparin, Dmitry Sokolov
Tree-like resolution complexity of two planar problems. CoRR (2014)
Dmitry Itsykson, Vsevolod Oparin
Graph Expansion, Tseitin Formulas and Resolution Proofs for CSP. CSR (2013)