| 2008 |
| 15 | EE | Sergey Kitaev,
Toufik Mansour,
Patrice Séébold:
Counting Ordered Patterns in Words Generated by Morphisms.
LATA 2008: 287-298 |
| 14 | EE | Sergey V. Avgustinovich,
Sergey Kitaev:
On uniquely k-determined permutations.
Discrete Mathematics 308(9): 1500-1507 (2008) |
| 13 | | Sergey Kitaev,
Artem V. Pyatkin:
On Representable Graphs.
Journal of Automata, Languages and Combinatorics 13(1): 45-54 (2008) |
| 12 | EE | Sergey Kitaev,
Steve Seif:
Word Problem of the Perkins Semigroup via Directed Acyclic Graphs.
Order 25(3): 177-194 (2008) |
| 2007 |
| 11 | EE | Sergey Kitaev:
Introduction to partially ordered patterns.
Discrete Applied Mathematics 155(8): 929-944 (2007) |
| 2006 |
| 10 | EE | Sergey Kitaev,
Jeffrey B. Remmel:
Classifying Descents According to Equivalence mod k.
Electr. J. Comb. 13(1): (2006) |
| 2005 |
| 9 | | Sergey Kitaev,
Toufik Mansour:
Simultaneous Avoidance Of Generalized Patterns.
Ars Comb. 75: (2005) |
| 8 | | Sergey Kitaev,
Toufik Mansour:
On multi-avoidance of generalized patterns.
Ars Comb. 76: (2005) |
| 7 | EE | Sergey Kitaev:
Partially ordered generalized patterns.
Discrete Mathematics 298(1-3): 212-229 (2005) |
| 6 | EE | Alexander Burstein,
Sergey Kitaev:
On Unavoidable Sets of Word Patterns.
SIAM J. Discrete Math. 19(2): 371-381 (2005) |
| 5 | EE | Sergey Kitaev:
Segmental partially ordered generalized patterns.
Theor. Comput. Sci. 349(3): 420-428 (2005) |
| 2004 |
| 4 | EE | A. Evdokimov,
Sergey Kitaev:
Crucial words and the complexity of some extremal problems for sets of prohibited words.
J. Comb. Theory, Ser. A 105(2): 273-289 (2004) |
| 3 | | Sergey Kitaev,
Toufik Mansour,
Patrice Séébold:
Generating the Peano Curve and Counting Occurrences of some Patterns.
Journal of Automata, Languages and Combinatorics 9(4): 439-455 (2004) |
| 2003 |
| 2 | EE | Sergey Kitaev:
Multi-avoidance of generalised patterns.
Discrete Mathematics 260(1-3): 89-100 (2003) |
| 1 | | Sergey Kitaev:
There are no Iterated Morphisms that Define the Arshon Sequence and the Sequence.
Journal of Automata, Languages and Combinatorics 8(1): 43-50 (2003) |