Commutation in Global Supermonoid of Free Monoids. - Anna Brosalina; Boris Melnikov (Informatica, 2000)

Some Grammatical Structures of Programming Languages as Simple Bracketed Languages. - Boris Melnikov; Elena Kashlakova (Informatica, 2000)

A New Algorithm of Constructing the Basis Finite Automaton. - Boris Melnikov; Alexandra Melnikova (Informatica, 2002)

Some Special Heuristics for Discrete Optimization Problems. - Boris Melnikov; Alexey Radionov; Viktor Gumayunov (ICEIS (2), 2006)

Some specific heuristics for situation clustering problems. - Boris Melnikov; Alexey Radionov; Andrey Moseev; Elena Melnikova (ICSOFT (2), 2006)

Some Competition Programming Problems as the Beginning of Artificial Intelligence. - Boris Melnikov; Elena Melnikova (Informatics Educ., 2007)

A Multi-heuristic Algorithmic Skeleton for Hard Combinatorial Optimization Problems. - Boris Feliksovich Melnikov; Andrey Vladimirovich Tsyganov; Oleg Ivanovich Bulychov (CSO (1), 2009)

Extended Nondeterministic Finite Automata. - Boris Melnikov (Fundam. Informaticae, 2010)

Once More on the Edge-Minimization of Nondeterministic Finite Automata and the Connected Problems. - Boris Melnikov (Fundam. Informaticae, 2010)

The State Minimization Problem for Nondeterministic Finite Automata: The Parallel Implementation of the Truncated Branch and Bound Method. - Boris Melnikov; Andrey Vladimirovich Tsyganov (PAAP, 2012)

On the Study of All Semilattices on the Set of Covering Automata for the Waterloo Automaton. - Mikhail E. Abramyan; Boris Feliksovich Melnikov (CSAI, 2023)

Some General Heuristics in the Traveling Salesman Problem and the Problem of Reconstructing the DNA Chain Distance Matrix. - Boris Feliksovich Melnikov; Dmitrii Chaikovskii (CSAI, 2023)

On some approaches to automatic generation of Waterloo-like automata. - Mikhail E. Abramyan; Boris Melnikov (CSAI, 2024)

Application of rank correlation algorithms for the distance matrices between DNA chains. - Boris Melnikov; Elena Melnikova (CSAI, 2024)