Sergey Kitaev

According to our database1, Sergey Kitaev authored at least 79 papers between 2003 and 2021.

Collaborative distances:



In proceedings 
PhD thesis 




Encoding Labelled p-Riordan Graphs by Words and Pattern-Avoiding Permutations.
Graphs Comb., 2021

On semi-transitive orientability of Kneser graphs and their complements.
Discret. Math., 2020

Counting independent sets in Riordan graphs.
Discret. Math., 2020

Distributions of several infinite families of mesh patterns.
Appl. Math. Comput., 2020

Solving Computational Problems in the Theory of Word-Representable Graphs.
J. Integer Seq., 2019

On a Greedy Algorithm to Construct Universal Cycles for Permutations.
Int. J. Found. Comput. Sci., 2019

Polygon-circle and word-representable graphs.
Electron. Notes Discret. Math., 2019

On shortening u-cycles and u-words for permutations.
Discret. Appl. Math., 2019

Word-representability of Toeplitz graphs.
Discret. Appl. Math., 2019

On Partially Ordered Patterns of Length 4 and 5 in Permutations.
Electron. J. Comb., 2019

Distributions of mesh patterns of short lengths.
Adv. Appl. Math., 2019

On Pattern Avoiding Indecomposable Permutations.
Integers, 2018

On the representation number of a crown graph.
Discret. Appl. Math., 2018

Existence of <i>u</i>-Representation of Graphs.
J. Graph Theory, 2017

On universal partial words.
Electron. Notes Discret. Math., 2017

New results on word-representable graphs.
Discret. Appl. Math., 2017

On 132-representable graphs.
Australas. J Comb., 2017

A Comprehensive Introduction to the Theory of Word-Representable Graphs.
Proceedings of the Developments in Language Theory - 21st International Conference, 2017

Gray coding cubic planar maps.
Theor. Comput. Sci., 2016

Mahonian STAT on words.
Inf. Process. Lett., 2016

Word-Representability of Face Subdivisions of Triangular Grid Graphs.
Graphs Comb., 2016

Avoiding vincular patterns on alternating words.
Discret. Math., 2016

Semi-transitive orientations and word-representable graphs.
Discret. Appl. Math., 2016

Pattern-avoiding alternating words.
Discret. Appl. Math., 2016

Word-representability of triangulations of grid-covered cylinder graphs.
Discret. Appl. Math., 2016

On universal partial words over binary alphabets.
CoRR, 2016

Words and Graphs
Monographs in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-319-25859-1, 2015

S-Crucial and Bicrucial Permutations with Respect to Squares.
J. Integer Seq., 2015

Number of cycles in the graph of 312-avoiding permutations.
J. Comb. Theory, Ser. A, 2015

Quadrant Marked Mesh Patterns in 132-avoiding Permutations III.
Integers, 2015

Quadrant Marked Mesh Patterns in 132-Avoiding Permutations II.
Integers, 2015

Frame patterns in n-cycles.
Discret. Math., 2015

(a, b)-rectangle patterns in permutations and words.
Discret. Appl. Math., 2015

Gray coding planar maps.
CoRR, 2015

Representing Graphs via Pattern Avoiding Words.
Electron. J. Comb., 2015

An involution on bicubic maps and β(0, 1)-trees.
Australas. J Comb., 2015

The 1-Box Pattern on Pattern-Avoiding Permutations.
J. Integer Seq., 2014

Enumeration of Fixed Points of an Involution on β(1, 0)-Trees.
Graphs Comb., 2014

On the number of self-dual rooted maps.
Eur. J. Comb., 2014

On Graphs with Representation Number 3.
J. Autom. Lang. Comb., 2013

Universal graphs and Universal Permutations.
Discret. Math. Algorithms Appl., 2013

Harmonic numbers, Catalan's triangle and mesh patterns.
Discret. Math., 2013

Restricted non-separable planar maps and some pattern avoiding permutations.
Discret. Appl. Math., 2013

Avoidance of boxed mesh patterns on permutations.
Discret. Appl. Math., 2013

An involution on β(1, 0)-trees.
Adv. Appl. Math., 2013

Patterns in Permutations and Words
Monographs in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-642-17333-2, 2011

On Square-Free Permutations.
J. Autom. Lang. Comb., 2011

Enumerating (2+2)-free posets by the number of minimal elements and other statistics.
Discret. Appl. Math., 2011

Pattern Avoidance in Partial Permutations.
Electron. J. Comb., 2011

A direct encoding of Stoimenows matchings as ascent sequences.
Australas. J Comb., 2011

Alternation Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

On the Representability of Line Graphs.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

(2+2)-free posets, ascent sequences and pattern avoiding permutations.
J. Comb. Theory, Ser. A, 2010

Place-Difference-Value Patterns: A Generalization of Generalized Permutation and Word Patterns.
Integers, 2010

Crucial abelian k-power-free words.
Discret. Math. Theor. Comput. Sci., 2010

On shortest crucial words avoiding abelian powers.
Discret. Appl. Math., 2010

On avoidance of V- and ^-patterns in permutations.
Ars Comb., 2010

Boolean complexes for Ferrers graphs.
Australas. J Comb., 2010

Graphs Capturing Alternations in Words.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

Rationality, Irrationality, and Wilf Equivalence in Generalized Factor Order.
Electron. J. Comb., 2009

Decompositions and statistics for β(1, 0)-trees and nonseparable permutations.
Adv. Appl. Math., 2009

Crucial Words for Abelian Powers.
Proceedings of the Developments in Language Theory, 13th International Conference, 2009

Word Problem of the Perkins Semigroup via Directed Acyclic Graphs.
Order, 2008

On Representable Graphs.
J. Autom. Lang. Comb., 2008

Counting Descents, Rises, and Levels, with Prescribed First Element, in Words.
Discret. Math. Theor. Comput. Sci., 2008

On uniquely k-determined permutations.
Discret. Math., 2008

Counting Ordered Patterns in Words Generated by Morphisms.
Proceedings of the Language and Automata Theory and Applications, 2008

Introduction to partially ordered patterns.
Discret. Appl. Math., 2007

Classifying Descents According to Equivalence mod k.
Electron. J. Comb., 2006

Segmental partially ordered generalized patterns.
Theor. Comput. Sci., 2005

On Unavoidable Sets of Word Patterns.
SIAM J. Discret. Math., 2005

Partially ordered generalized patterns.
Discret. Math., 2005

On multi-avoidance of generalized patterns.
Ars Comb., 2005

Simultaneous Avoidance Of Generalized Patterns.
Ars Comb., 2005

Crucial words and the complexity of some extremal problems for sets of prohibited words.
J. Comb. Theory, Ser. A, 2004

Generating the Peano Curve and Counting Occurrences of some Patterns.
J. Autom. Lang. Comb., 2004

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

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

Multi-avoidance of generalised patterns.
Discret. Math., 2003