On the Representability of Line Graphs. - Sergey Kitaev; Pavel Salimov; Christopher Severs; Henning Úlfarsson (Developments in Language Theory, 2011)

Infinite permutations of lowest maximal pattern complexity. - Sergey V. Avgustinovich; Anna E. Frid; Teturo Kamae; Pavel Salimov (Theor. Comput. Sci., 2011)

On the Number of Abelian Bordered Words. - Narad Rampersad; Michel Rigo; Pavel Salimov (Developments in Language Theory, 2013)

Restricted non-separable planar maps and some pattern avoiding permutations. - Sergey Kitaev; Pavel Salimov; Christopher Severs; Henning Úlfarsson (Discret. Appl. Math., 2013)

On the number of Abelian Bordered Words (with an Example of Automatic Theorem-Proving). - Daniel Goc; Narad Rampersad; Michel Rigo; Pavel Salimov (Int. J. Found. Comput. Sci., 2014)

A note on abelian returns in rotation words. - Narad Rampersad; Michel Rigo; Pavel Salimov (Theor. Comput. Sci., 2014)

Avoiding 2-binomial squares and cubes. - Michaël Rao; Michel Rigo; Pavel Salimov (Theor. Comput. Sci., 2015)

Another generalization of abelian equivalence: Binomial complexity of infinite words. - Michel Rigo; Pavel Salimov (Theor. Comput. Sci., 2015)