Beating Brute Force for (Quantified) Satisfiability of Circuits of Bounded Treewidth. - Daniel Lokshtanov; Ivan Mikhailin; Ramamohan Paturi; Pavel Pudlák (SODA, 2018)

Complexity of Linear Operators. - Alexander S. Kulikov; Ivan Mikhailin; Andrey Mokhov; Vladimir V. Podolskii (Electron. Colloquium Comput. Complex., 2019)