Resolution complexity of perfect mathcing principles for sparse graphs. - Dmitry Itsykson; Mikhail Slabodkin; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2014)

Resolution Complexity of Perfect Matching Principles for Sparse Graphs. - Dmitry Itsykson; Mikhail Slabodkin; Dmitry Sokolov 001 (CSR, 2015)

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