Dmitry Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov, “Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs”, comput. complex., 30, no. 2, 2021, 13
Evgeny Dantsin, Alexander Wolpert, 10976, Computing and Combinatorics, 2018, 592
Mikoláš Janota, Joao Marques-Silva, “Expansion-based QBF solving versus Q-resolution”, Theoretical Computer Science, 577, 2015, 25
Nicola Galesi, Navid Talebanfard, Jacobo Torán, “Cops-Robber Games and the Resolution of Tseitin Formulas”, ACM Trans. Comput. Theory, 12, no. 2, 2020, 1
Ludmila Glinskih, Dmitry Itsykson, 11532, Computer Science – Theory and Applications, 2019, 143
Alexis de Colnet, Stefan Mengel, 12831, Theory and Applications of Satisfiability Testing – SAT 2021, 2021, 116
Dimitrios M. Thilikos, Sebastian Wiederrecht, 14760, Graph-Theoretic Concepts in Computer Science, 2025, 460