Multi-avoidance of generalised patterns. - Sergey Kitaev (Discret. Math., 2003)

There are no Iterated Morphisms that Define the Arshon Sequence and the σ-Sequence. - Sergey Kitaev (J. Autom. Lang. Comb., 2003)

The sigma-sequence and counting occurrences of some patterns, subsequences and subwords. - Sergey Kitaev (Australas. J Comb., 2004)

Generating the Peano Curve and Counting Occurrences of some Patterns. - Sergey Kitaev; Toufik Mansour; Patrice Séébold (J. Autom. Lang. Comb., 2004)

Crucial words and the complexity of some extremal problems for sets of prohibited words. - A. Evdokimov; Sergey Kitaev (J. Comb. Theory A, 2004)

Simultaneous Avoidance Of Generalized Patterns. - Sergey Kitaev; Toufik Mansour (Ars Comb., 2005)

On multi-avoidance of generalized patterns. - Sergey Kitaev; Toufik Mansour (Ars Comb., 2005)

Partially ordered generalized patterns. - Sergey Kitaev (Discret. Math., 2005)

On Unavoidable Sets of Word Patterns. - Alexander Burstein; Sergey Kitaev (SIAM J. Discret. Math., 2005)

Segmental partially ordered generalized patterns. - Sergey Kitaev (Theor. Comput. Sci., 2005)

Classifying Descents According to Equivalence mod k. - Sergey Kitaev; Jeffrey B. Remmel (Electron. J. Comb., 2006)

Introduction to partially ordered patterns. - Sergey Kitaev (Discret. Appl. Math., 2007)

Counting Ordered Patterns in Words Generated by Morphisms. - Sergey Kitaev; Toufik Mansour; Patrice Séébold (LATA, 2008)

On uniquely k-determined permutations. - Sergey V. Avgustinovich; Sergey Kitaev (Discret. Math., 2008)

Counting Descents, Rises, and Levels, with Prescribed First Element, in Words. - Sergey Kitaev; Toufik Mansour; Jeffrey B. Remmel (Discret. Math. Theor. Comput. Sci., 2008)

On Representable Graphs. - Sergey Kitaev; Artem V. Pyatkin (J. Autom. Lang. Comb., 2008)

Word Problem of the Perkins Semigroup via Directed Acyclic Graphs. - Sergey Kitaev; Steve Seif (Order, 2008)

Crucial Words for Abelian Powers. - Amy Glen; Bjarni V. Halldórsson; Sergey Kitaev (Developments in Language Theory, 2009)

Decompositions and statistics for β(1, 0)-trees and nonseparable permutations. - Anders Claesson; Sergey Kitaev; Einar Steingrímsson (Adv. Appl. Math., 2009)

Rationality, Irrationality, and Wilf Equivalence in Generalized Factor Order. - Sergey Kitaev; Jeffrey Liese; Jeffrey B. Remmel; Bruce E. Sagan (Electron. J. Comb., 2009)

Graphs Capturing Alternations in Words. - Magnús M. Halldórsson; Sergey Kitaev; Artem V. Pyatkin (Developments in Language Theory, 2010)

Boolean complexes for Ferrers graphs. - Anders Claesson; Sergey Kitaev; Kári Ragnarsson; Bridget Eileen Tenner (Australas. J Comb., 2010)

On avoidance of V- and ^-patterns in permutations. - Sergey Kitaev; Artem V. Pyatkin (Ars Comb., 2010)

On shortest crucial words avoiding abelian powers. - Sergey V. Avgustinovich; Amy Glen; Bjarni V. Halldórsson; Sergey Kitaev (Discret. Appl. Math., 2010)

Crucial abelian k-power-free words. - Amy Glen; Bjarni V. Halldórsson; Sergey Kitaev (Discret. Math. Theor. Comput. Sci., 2010)

Place-Difference-Value Patterns: A Generalization of Generalized Permutation and Word Patterns. - Sergey Kitaev; Jeffrey B. Remmel (Integers, 2010)

(2+2)-free posets, ascent sequences and pattern avoiding permutations. - Mireille Bousquet-Mélou; Anders Claesson; Mark Dukes; Sergey Kitaev (J. Comb. Theory A, 2010)

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

Alternation Graphs. - Magnús M. Halldórsson; Sergey Kitaev; Artem V. Pyatkin (WG, 2011)

A direct encoding of Stoimenows matchings as ascent sequences. - Anders Claesson; Mark Dukes; Sergey Kitaev (Australas. J Comb., 2011)

Pattern Avoidance in Partial Permutations. - Anders Claesson; Vít Jelínek; Eva Jelínková; Sergey Kitaev (Electron. J. Comb., 2011)

Enumerating (2+2)-free posets by the number of minimal elements and other statistics. - Sergey Kitaev; Jeffrey B. Remmel (Discret. Appl. Math., 2011)

On Square-Free Permutations. - Sergey V. Avgustinovich; Sergey Kitaev; Artem V. Pyatkin; Alexandr Valyuzhenich (J. Autom. Lang. Comb., 2011)

Patterns in Permutations and Words - Sergey Kitaev (Springer, 2011)

An involution on β(1, 0)-trees. - Anders Claesson; Sergey Kitaev; Einar Steingrímsson (Adv. Appl. Math., 2013)

Avoidance of boxed mesh patterns on permutations. - Sergey V. Avgustinovich; Sergey Kitaev; Alexandr Valyuzhenich (Discret. Appl. Math., 2013)

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

Harmonic numbers, Catalan's triangle and mesh patterns. - Sergey Kitaev; Jeffrey Liese (Discret. Math., 2013)

Universal graphs and Universal Permutations. - Aistis Atminas; Vadim V. Lozin; Sergey Kitaev; Alexandr Valyuzhenich (Discret. Math. Algorithms Appl., 2013)

On Graphs with Representation Number 3. - Sergey Kitaev (J. Autom. Lang. Comb., 2013)

On the number of self-dual rooted maps. - Sergey Kitaev; Anna de Mier; Marc Noy (Eur. J. Comb., 2014)

Enumeration of Fixed Points of an Involution on β(1, 0)-Trees. - Sergey Kitaev; Anna de Mier (Graphs Comb., 2014)

The 1-Box Pattern on Pattern-Avoiding Permutations. - Sergey Kitaev; Jeffrey B. Remmel (J. Integer Seq., 2014)

An involution on bicubic maps and β(0, 1)-trees. - Anders Claesson; Sergey Kitaev; Anna de Mier (Australas. J Comb., 2015)

Representing Graphs via Pattern Avoiding Words. - Miles Eli Jones; Sergey Kitaev; Artem V. Pyatkin; Jeffrey B. Remmel (Electron. J. Comb., 2015)

Gray coding planar maps. - Sergey V. Avgustinovich; Sergey Kitaev; Vladimir N. Potapov; Vincent Vajnovszki (CoRR, 2015)

(a, b)-rectangle patterns in permutations and words. - Sergey Kitaev; Jeffrey B. Remmel (Discret. Appl. Math., 2015)

Frame patterns in n-cycles. - Miles Eli Jones; Sergey Kitaev; Jeffrey B. Remmel (Discret. Math., 2015)

Quadrant Marked Mesh Patterns in 132-Avoiding Permutations II. - Sergey Kitaev; Jeffrey B. Remmel; Mark Tiefenbruck (Integers, 2015)

Quadrant Marked Mesh Patterns in 132-avoiding Permutations III. - Sergey Kitaev; Jeffrey B. Remmel; Mark Tiefenbruck (Integers, 2015)

Number of cycles in the graph of 312-avoiding permutations. - Richard Ehrenborg; Sergey Kitaev; Einar Steingrímsson (J. Comb. Theory A, 2015)

S-Crucial and Bicrucial Permutations with Respect to Squares. - Ian P. Gent; Sergey Kitaev; Alexander Konovalov 001; Steve Linton; Peter Nightingale (J. Integer Seq., 2015)

Words and Graphs - Sergey Kitaev; Vadim V. Lozin (Springer, 2015)

On universal partial words over binary alphabets. - Herman Z. Q. Chen; Sergey Kitaev; Brian Yi Sun (CoRR, 2016)

Word-representability of triangulations of grid-covered cylinder graphs. - Herman Z. Q. Chen; Sergey Kitaev; Brian Yi Sun (Discret. Appl. Math., 2016)

Pattern-avoiding alternating words. - Alice L. L. Gao; Sergey Kitaev; Philip B. Zhang (Discret. Appl. Math., 2016)

Semi-transitive orientations and word-representable graphs. - Magnús M. Halldórsson; Sergey Kitaev; Artem V. Pyatkin (Discret. Appl. Math., 2016)

Avoiding vincular patterns on alternating words. - Alice L. L. Gao; Sergey Kitaev; Philip B. Zhang (Discret. Math., 2016)

Word-Representability of Face Subdivisions of Triangular Grid Graphs. - Herman Z. Q. Chen; Sergey Kitaev; Brian Yi Sun (Graphs Comb., 2016)

Mahonian STAT on words. - Sergey Kitaev; Vincent Vajnovszki (Inf. Process. Lett., 2016)

Gray coding cubic planar maps. - Sergey V. Avgustinovich; Sergey Kitaev; Vladimir N. Potapov; Vincent Vajnovszki (Theor. Comput. Sci., 2016)

Preface. - Anders Claesson; Mark Dukes; Sergey Kitaev; David F. Manlove; Kitty Meeks (BCC, 2017)

A Comprehensive Introduction to the Theory of Word-Representable Graphs. - Sergey Kitaev (DLT, 2017)

On 132-representable graphs. - Alice L. L. Gao; Sergey Kitaev; Philip B. Zhang (Australas. J Comb., 2017)

New results on word-representable graphs. - Andrew Collins 004; Sergey Kitaev; Vadim V. Lozin (Discret. Appl. Math., 2017)

On universal partial words. - Herman Z. Q. Chen; Sergey Kitaev; Torsten Mütze; Brian Yi Sun (Electron. Notes Discret. Math., 2017)

Existence of u-Representation of Graphs. - Sergey Kitaev (J. Graph Theory, 2017)

On the representation number of a crown graph. - Marc Glen; Sergey Kitaev; Artem V. Pyatkin (Discret. Appl. Math., 2018)

On Pattern Avoiding Indecomposable Permutations. - Alice L. L. Gao; Sergey Kitaev; Philip B. Zhang (Integers, 2018)

Distributions of mesh patterns of short lengths. - Sergey Kitaev; Philip B. Zhang (Adv. Appl. Math., 2019)

On Partially Ordered Patterns of Length 4 and 5 in Permutations. - Alice L. L. Gao; Sergey Kitaev (Electron. J. Comb., 2019)

Word-representability of Toeplitz graphs. - Gi-Sang Cheon; Jinha Kim; Minki Kim; Sergey Kitaev (Discret. Appl. Math., 2019)

On shortening u-cycles and u-words for permutations. - Sergey Kitaev; Vladimir N. Potapov; Vincent Vajnovszki (Discret. Appl. Math., 2019)

Polygon-circle and word-representable graphs. - Jessica A. Enright; Sergey Kitaev (Electron. Notes Discret. Math., 2019)

On a Greedy Algorithm to Construct Universal Cycles for Permutations. - Alice L. L. Gao; Sergey Kitaev; Wolfgang Steiner; Philip B. Zhang (Int. J. Found. Comput. Sci., 2019)

Solving Computational Problems in the Theory of Word-Representable Graphs. - Özgür Akgün; Ian P. Gent; Sergey Kitaev; Hans Zantema (J. Integer Seq., 2019)

Distributions of several infinite families of mesh patterns. - Sergey Kitaev; Philip B. Zhang; Xutong Zhang (Appl. Math. Comput., 2020)

Counting independent sets in Riordan graphs. - Gi-Sang Cheon; Ji-Hwan Jung; Bumtle Kang; Hana Kim; Suh-Ryung Kim; Sergey Kitaev; Seyed Ahmad Mojallal (Discret. Math., 2020)

On semi-transitive orientability of Kneser graphs and their complements. - Sergey Kitaev; Akira Saito (Discret. Math., 2020)

On universal partial words for word-patterns and set partitions. - Herman Z. Q. Chen; Sergey Kitaev (RAIRO Theor. Informatics Appl., 2020)

Encoding Labelled p-Riordan Graphs by Words and Pattern-Avoiding Permutations. - Kittitat Iamthong; Ji-Hwan Jung; Sergey Kitaev (Graphs Comb., 2021)

On Properly Ordered Coloring of Vertices in a Vertex-Weighted Graph. - Shinya Fujita 001; Sergey Kitaev; Shizuka Sato; Li-Da Tong (Order, 2021)

On the 12-representability of induced subgraphs of a grid graph. - Joanna N. Chen; Sergey Kitaev (Discuss. Math. Graph Theory, 2022)

Representing split graphs by words. - Herman Z. Q. Chen; Sergey Kitaev; Akira Saito (Discuss. Math. Graph Theory, 2022)

On Five Types of Crucial Permutations with Respect to Monotone Patterns. - Sergey V. Avgustinovich; Sergey Kitaev; Anna A. Taranenko (Electron. J. Comb., 2023)

On Permutations Avoiding Partially Ordered Patterns Defined by Bipartite Graphs. - Sergey Kitaev; Artem V. Pyatkin (Electron. J. Comb., 2023)

On semi-transitive orientability of triangle-free graphs. - Sergey Kitaev; Artem V. Pyatkin (Discuss. Math. Graph Theory, 2023)

Joint distributions of statistics over permutations avoiding two patterns of length 3. - Tian Han; Sergey Kitaev (Discret. Math. Theor. Comput. Sci., 2023)

Distributions of statistics on separable permutations. - Joanna N. Chen; Sergey Kitaev; Philip B. Zhang (Discret. Appl. Math., 2024)

An embedding technique in the study of word-representability of graphs. - Sumin Huang; Sergey Kitaev; Artem V. Pyatkin (Discret. Appl. Math., 2024)

On a family of universal cycles for multi-dimensional permutations. - Sergey Kitaev; Dun Qiu (Discret. Appl. Math., 2024)

Human-verifiable proofs in the theory of word-representable graphs. - Sergey Kitaev; Haoran Sun (RAIRO Theor. Informatics Appl., 2024)

Singleton mesh patterns in multidimensional permutations. - Sergey V. Avgustinovich; Sergey Kitaev; Jeffrey Liese; Vladimir N. Potapov; Anna A. Taranenko (J. Comb. Theory A, 2024)

On ordering of β-description trees. - Sumin Huang; Sergey Kitaev (Theor. Comput. Sci., 2024)

Non-overlapping descents and ascents in stack-sortable permutations. - Sergey Kitaev; Philip B. Zhang (Discret. Appl. Math., 2024)

On semi-transitive orientability of split graphs. - Sergey Kitaev; Artem V. Pyatkin (Inf. Process. Lett., 2024)

New Tools to Study 1-11-Representation of Graphs. - Mikhail Futorny; Sergey Kitaev; Artem V. Pyatkin (Graphs Comb., 2024)

On (joint) equidistributions of mesh patterns 123 and 132 with symmetric shadings. - Shuzhen Lv; Sergey Kitaev (Adv. Appl. Math., 2025)

On (Shape-)Wilf-Equivalence of Certain Sets of (Partially Ordered) Patterns. - Alexander Burstein; Tian Han; Sergey Kitaev; Philip B. Zhang (Electron. J. Comb., 2025)

Descent generating polynomials for (n-3)- and (n-4)-stack-sortable (pattern-avoiding) permutations. - Philip B. Zhang; Sergey Kitaev (Discret. Appl. Math., 2025)

On naturally labelled posets and permutations avoiding 12-34. - David I. Bevan; Gi-Sang Cheon; Sergey Kitaev (Eur. J. Comb., 2025)

Patterns in multi-dimensional permutations. - Shaoshi Chen; Hanqian Fang; Sergey Kitaev; Candice X. T. Zhang (Eur. J. Comb., 2025)

Distribution of maxima and minima statistics on alternating permutations, Springer numbers, and avoidance of flat POPs. - Tian Han; Sergey Kitaev; Philip B. Zhang (J. Comb. Theory, Ser. A, 2025)

Consecutive and quasi-consecutive patterns: des-Wilf classifications and generating functions. - Yan Wang; Qi Fang; Shishuo Fu; Sergey Kitaev; Haijun Li (CoRR, 2025)