Vsevolod Oparin

According to our database, Vsevolod Oparin authored at least 6 papers between 2013 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

Computational and proof complexity of partial string avoidability.

Dmitry Itsykson, Alexander Okhotin, Vsevolod Oparin

Electron. Colloquium Comput. Complex., 2020

2017

Algorithmic and Hardness Results for the Hub Labeling Problem.

Haris Angelidakis, Yury Makarychev, Vsevolod Oparin

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

Tight Lower Bounds on the Resolution Complexity of Perfect Matching Principles.

Dmitry Itsykson, Vsevolod Oparin, Mikhail Slabodkin, Dmitry Sokolov

Fundam. Informaticae, 2016

Tight Upper Bound on Splitting by Linear Combinations for Pigeonhole Principle.

Vsevolod Oparin

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

2014

Tree-like resolution complexity of two planar problems.

Dmitry Itsykson, Anna Malova, Vsevolod Oparin, Dmitry Sokolov

CoRR, 2014

2013

Graph Expansion, Tseitin Formulas and Resolution Proofs for CSP.

Dmitry Itsykson, Vsevolod Oparin

Proceedings of the Computer Science - Theory and Applications, 2013