A Chriterion of Polynominal Lower Bounds of Combinational Complexity. - Nikolai K. Kossovsky (FCT, 1987)

The Polynominal Complexity of Conjunctive Normal Form Satisfiability, when the Number of Conjunctions and Negations is Limited. - Nikolai K. Kossovsky; A. B. Prokhoroff (LFCS, 1992)

Function-Patterns and Fan-Backtracking for Logic Programming. - Nikolai K. Kossovsky; Igor P. Solovjev (ICLP, 1993)

The collapse of the second Yatsenyuk government: roll call vote and dynamic network analysis. - Nikolai K. Kossovsky; Kathleen M. Carley (Comput. Math. Organ. Theory, 2020)