Vsevolod Oparin
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
4
Venues
4
Active years
2013–2017
Best venue rank
A*
Where they publish
Papers
4 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2017 | SODA | Algorithmic and Hardness Results for the Hub Labeling Problem. | Haris Angelidakis, Yury Makarychev, Vsevolod Oparin |
| 2016 | MFCS | Computational and Proof Complexity of Partial String Avoidability. | Dmitry Itsykson, Alexander Okhotin, Vsevolod Oparin |
| 2016 | SAT | Tight Upper Bound on Splitting by Linear Combinations for Pigeonhole Principle. | Vsevolod Oparin |
| 2013 | CSR | Graph Expansion, Tseitin Formulas and Resolution Proofs for CSP. | Dmitry Itsykson, Vsevolod Oparin |