Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination. - Edward A. Hirsch; Arist Kojevnikov (CP, 2001)

Several notes on the power of Gomory-Chvatal cuts - Edward A. Hirsch; Arist Kojevnikov (Electron. Colloquium Comput. Complex., 2003)

UnitWalk: A new SAT solver that uses local search guided by unit clause elimination. - Edward A. Hirsch; Arist Kojevnikov (Ann. Math. Artif. Intell., 2005)

Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies. - Arist Kojevnikov; Dmitry Itsykson (ICALP (1), 2006)

Complexity of Semialgebraic Proofs with Restricted Degree of Falsity. - Arist Kojevnikov; Alexander S. Kulikov (SAT, 2006)

A new approach to proving upper bounds for MAX-2-SAT. - Arist Kojevnikov; Alexander S. Kulikov (SODA, 2006)

Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities. - Arist Kojevnikov (SAT, 2007)

Improved Lower Bounds for Resolution over Linear Inequalities. - Arist Kojevnikov (Electron. Colloquium Comput. Complex., 2007)

New Combinatorial Complete One-Way Functions. - Arist Kojevnikov; Sergey I. Nikolenko (STACS, 2008)

Finding Efficient Circuits Using SAT-Solvers. - Arist Kojevnikov; Alexander S. Kulikov; Grigory Yaroslavtsev (SAT, 2009)

Complexity of Semialgebraic Proofs with Restricted Degree of Falsity. - Edward A. Hirsch; Arist Kojevnikov; Alexander S. Kulikov; Sergey I. Nikolenko (J. Satisf. Boolean Model. Comput., 2009)

Circuit Complexity and Multiplicative Complexity of Boolean Functions. - Arist Kojevnikov; Alexander S. Kulikov (CiE, 2010)

New upper bounds on the Boolean circuit complexity of symmetric functions. - Evgeny Demenkov; Arist Kojevnikov; Alexander S. Kulikov; Grigory Yaroslavtsev (Inf. Process. Lett., 2010)