Recognizing Pseudo-intents is coNP-complete. - Mikhail A. Babin; Sergei O. Kuznetsov (CLA, 2010)

On Links between Concept Lattices and Related Complexity Problems. - Mikhail A. Babin; Sergei O. Kuznetsov (ICFCA, 2010)

Enumerating Minimal Hypotheses and Dualizing Monotone Boolean Functions on Lattices. - Mikhail A. Babin; Sergei O. Kuznetsov (ICFCA, 2011)

Approximating Concept Stability. - Mikhail A. Babin; Sergei O. Kuznetsov (ICFCA, 2012)

Computing premises of a minimal cover of functional dependencies is intractable. - Mikhail A. Babin; Sergei O. Kuznetsov (Discret. Appl. Math., 2013)

Dualization in lattices given by ordered sets of irreducibles. - Mikhail A. Babin; Sergei O. Kuznetsov (Theor. Comput. Sci., 2017)