default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSergey Kitaev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j86]Sergey Kitaev
, Philip B. Zhang:
Non-overlapping descents and ascents in stack-sortable permutations. Discret. Appl. Math. 344: 112-119 (2024)- [j85]Sumin Huang, Sergey Kitaev, Artem V. Pyatkin:
An embedding technique in the study of word-representability of graphs. Discret. Appl. Math. 346: 170-182 (2024) - [j84]Joanna N. Chen, Sergey Kitaev, Philip B. Zhang:
Distributions of statistics on separable permutations. Discret. Appl. Math. 355: 169-179 (2024) - [j83]Sergey Kitaev, Dun Qiu:
On a family of universal cycles for multi-dimensional permutations. Discret. Appl. Math. 359: 310-320 (2024) - [j82]Mikhail Futorny, Sergey Kitaev, Artem V. Pyatkin:
New Tools to Study 1-11-Representation of Graphs. Graphs Comb. 40(5): 97 (2024) - [j81]Sergey Kitaev, Artem V. Pyatkin:
On semi-transitive orientability of split graphs. Inf. Process. Lett. 184: 106435 (2024) - [j80]Sergey Kitaev, Haoran Sun:
Human-verifiable proofs in the theory of word-representable graphs. RAIRO Theor. Informatics Appl. 58: 9 (2024) - [j79]Sergey V. Avgustinovich, Sergey Kitaev, Jeffrey Liese, Vladimir N. Potapov, Anna A. Taranenko:
Singleton mesh patterns in multidimensional permutations. J. Comb. Theory A 201: 105801 (2024) - [j78]Sumin Huang, Sergey Kitaev:
On ordering of β-description trees. Theor. Comput. Sci. 982: 114273 (2024) - 2023
- [j77]Sergey V. Avgustinovich, Sergey Kitaev, Anna A. Taranenko:
On Five Types of Crucial Permutations with Respect to Monotone Patterns. Electron. J. Comb. 30(1) (2023) - [j76]Sergey Kitaev, Artem V. Pyatkin:
On Permutations Avoiding Partially Ordered Patterns Defined by Bipartite Graphs. Electron. J. Comb. 30(1) (2023) - [j75]Sergey Kitaev, Artem V. Pyatkin:
On semi-transitive orientability of triangle-free graphs. Discuss. Math. Graph Theory 43(2): 533-547 (2023) - 2022
- [j74]Joanna N. Chen, Sergey Kitaev:
On the 12-representability of induced subgraphs of a grid graph. Discuss. Math. Graph Theory 42(2): 383-403 (2022) - [j73]Herman Z. Q. Chen, Sergey Kitaev, Akira Saito:
Representing split graphs by words. Discuss. Math. Graph Theory 42(4): 1263-1280 (2022) - 2021
- [j72]Kittitat Iamthong, Ji-Hwan Jung, Sergey Kitaev:
Encoding Labelled p-Riordan Graphs by Words and Pattern-Avoiding Permutations. Graphs Comb. 37(1): 139-149 (2021) - [j71]Shinya Fujita, Sergey Kitaev, Shizuka Sato, Li-Da Tong:
On Properly Ordered Coloring of Vertices in a Vertex-Weighted Graph. Order 38(3): 515-525 (2021) - 2020
- [j70]Sergey Kitaev, Philip B. Zhang, Xutong Zhang:
Distributions of several infinite families of mesh patterns. Appl. Math. Comput. 372 (2020) - [j69]Sergey Kitaev, Akira Saito:
On semi-transitive orientability of Kneser graphs and their complements. Discret. Math. 343(8): 111909 (2020) - [j68]Gi-Sang Cheon, Ji-Hwan Jung, Bumtle Kang, Hana Kim, Suh-Ryung Kim, Sergey Kitaev, Seyed Ahmad Mojallal:
Counting independent sets in Riordan graphs. Discret. Math. 343(11): 112043 (2020) - [j67]Herman Z. Q. Chen, Sergey Kitaev:
On universal partial words for word-patterns and set partitions. RAIRO Theor. Informatics Appl. 54: 5 (2020)
2010 – 2019
- 2019
- [j66]Sergey Kitaev, Philip B. Zhang:
Distributions of mesh patterns of short lengths. Adv. Appl. Math. 110: 1-32 (2019) - [j65]Alice L. L. Gao, Sergey Kitaev:
On Partially Ordered Patterns of Length 4 and 5 in Permutations. Electron. J. Comb. 26(3): 3 (2019) - [j64]Sergey Kitaev, Vladimir N. Potapov, Vincent Vajnovszki:
On shortening u-cycles and u-words for permutations. Discret. Appl. Math. 260: 203-213 (2019) - [j63]Gi-Sang Cheon, Jinha Kim, Minki Kim, Sergey Kitaev:
Word-representability of Toeplitz graphs. Discret. Appl. Math. 270: 96-105 (2019) - [j62]Jessica A. Enright, Sergey Kitaev:
Polygon-circle and word-representable graphs. Electron. Notes Discret. Math. 71: 3-8 (2019) - [j61]Alice L. L. Gao, Sergey Kitaev, Wolfgang Steiner, Philip B. Zhang:
On a Greedy Algorithm to Construct Universal Cycles for Permutations. Int. J. Found. Comput. Sci. 30(1): 61-72 (2019) - [j60]Özgür Akgün, Ian P. Gent, Sergey Kitaev, Hans Zantema:
Solving Computational Problems in the Theory of Word-Representable Graphs. J. Integer Seq. 22(2): 19.2.5 (2019) - 2018
- [j59]Marc Glen, Sergey Kitaev, Artem V. Pyatkin:
On the representation number of a crown graph. Discret. Appl. Math. 244: 89-93 (2018) - [j58]Alice L. L. Gao, Sergey Kitaev, Philip B. Zhang:
On Pattern Avoiding Indecomposable Permutations. Integers 18: A2 (2018) - 2017
- [j57]Alice L. L. Gao, Sergey Kitaev, Philip B. Zhang:
On 132-representable graphs. Australas. J Comb. 69: 105-118 (2017) - [j56]Andrew Collins, Sergey Kitaev, Vadim V. Lozin:
New results on word-representable graphs. Discret. Appl. Math. 216: 136-141 (2017) - [j55]Herman Z. Q. Chen, Sergey Kitaev, Torsten Mütze, Brian Yi Sun:
On universal partial words. Discret. Math. Theor. Comput. Sci. 19(1) (2017) - [j54]Herman Z. Q. Chen, Sergey Kitaev, Torsten Mütze, Brian Yi Sun:
On universal partial words. Electron. Notes Discret. Math. 61: 231-237 (2017) - [j53]Sergey Kitaev:
Existence of u-Representation of Graphs. J. Graph Theory 85(3): 661-668 (2017) - [c7]Anders Claesson, Mark Dukes, Sergey Kitaev, David F. Manlove, Kitty Meeks:
Preface. BCC 2017: vii-viii - [c6]Sergey Kitaev:
A Comprehensive Introduction to the Theory of Word-Representable Graphs. DLT 2017: 36-67 - [e1]Anders Claesson, Mark Dukes, Sergey Kitaev, David F. Manlove, Kitty Meeks:
Surveys in Combinatorics, 2017: Invited lectures from the 26th British Combinatorial Conference, Strathclyde, Glasgow, UK, July 3-7, 2017. Cambridge University Press 2017, ISBN 978-1-108-41313-8 [contents] - 2016
- [j52]Magnús M. Halldórsson, Sergey Kitaev, Artem V. Pyatkin:
Semi-transitive orientations and word-representable graphs. Discret. Appl. Math. 201: 164-171 (2016) - [j51]Alice L. L. Gao, Sergey Kitaev, Philip B. Zhang:
Pattern-avoiding alternating words. Discret. Appl. Math. 207: 56-66 (2016) - [j50]Herman Z. Q. Chen, Sergey Kitaev, Brian Yi Sun:
Word-representability of triangulations of grid-covered cylinder graphs. Discret. Appl. Math. 213: 60-70 (2016) - [j49]Alice L. L. Gao, Sergey Kitaev, Philip B. Zhang:
Avoiding vincular patterns on alternating words. Discret. Math. 339(8): 2079-2093 (2016) - [j48]Herman Z. Q. Chen, Sergey Kitaev, Brian Yi Sun:
Word-Representability of Face Subdivisions of Triangular Grid Graphs. Graphs Comb. 32(5): 1749-1761 (2016) - [j47]Sergey Kitaev, Vincent Vajnovszki:
Mahonian STAT on words. Inf. Process. Lett. 116(2): 157-162 (2016) - [j46]Sergey V. Avgustinovich, Sergey Kitaev, Vladimir N. Potapov, Vincent Vajnovszki:
Gray coding cubic planar maps. Theor. Comput. Sci. 616: 59-69 (2016) - [i3]Herman Z. Q. Chen, Sergey Kitaev, Brian Yi Sun:
On universal partial words over binary alphabets. CoRR abs/1601.06456 (2016) - 2015
- [b2]Sergey Kitaev, Vadim V. Lozin:
Words and Graphs. Monographs in Theoretical Computer Science. An EATCS Series, Springer 2015, ISBN 978-3-319-25857-7, pp. 1-229 - [j45]Anders Claesson, Sergey Kitaev, Anna de Mier:
An involution on bicubic maps and β(0, 1)-trees. Australas. J Comb. 61: 1-18 (2015) - [j44]Miles Eli Jones, Sergey Kitaev, Artem V. Pyatkin, Jeffrey B. Remmel:
Representing Graphs via Pattern Avoiding Words. Electron. J. Comb. 22(2): 2 (2015) - [j43]Sergey Kitaev, Jeffrey B. Remmel:
(a, b)-rectangle patterns in permutations and words. Discret. Appl. Math. 186: 128-146 (2015) - [j42]Miles Eli Jones, Sergey Kitaev, Jeffrey B. Remmel:
Frame patterns in n-cycles. Discret. Math. 338(7): 1197-1215 (2015) - [j41]Sergey Kitaev, Jeffrey B. Remmel, Mark Tiefenbruck:
Quadrant Marked Mesh Patterns in 132-Avoiding Permutations II. Integers 15: A16 (2015) - [j40]Sergey Kitaev, Jeffrey B. Remmel, Mark Tiefenbruck:
Quadrant Marked Mesh Patterns in 132-avoiding Permutations III. Integers 15: A39 (2015) - [j39]Richard Ehrenborg, Sergey Kitaev, Einar Steingrímsson:
Number of cycles in the graph of 312-avoiding permutations. J. Comb. Theory A 129: 1-18 (2015) - [j38]Ian P. Gent, Sergey Kitaev, Alexander Konovalov, Steve Linton, Peter Nightingale:
S-Crucial and Bicrucial Permutations with Respect to Squares. J. Integer Seq. 18(6): 15.6.5 (2015) - [i2]Sergey V. Avgustinovich, Sergey Kitaev, Vladimir N. Potapov, Vincent Vajnovszki:
Gray coding planar maps. CoRR abs/1509.05807 (2015) - 2014
- [j37]Sergey Kitaev, Anna de Mier, Marc Noy:
On the number of self-dual rooted maps. Eur. J. Comb. 35: 377-387 (2014) - [j36]Sergey Kitaev, Anna de Mier:
Enumeration of Fixed Points of an Involution on β(1, 0)-Trees. Graphs Comb. 30(5): 1207-1221 (2014) - [j35]Sergey Kitaev, Jeffrey B. Remmel:
The 1-Box Pattern on Pattern-Avoiding Permutations. J. Integer Seq. 17(3): 14.3.3 (2014) - [i1]Sergey Kitaev, Vincent Vajnovszki:
Mahonian STAT on words. CoRR abs/1408.4290 (2014) - 2013
- [j34]Anders Claesson, Sergey Kitaev, Einar Steingrímsson:
An involution on β(1, 0)-trees. Adv. Appl. Math. 51(2): 276-284 (2013) - [j33]Sergey V. Avgustinovich, Sergey Kitaev, Alexandr Valyuzhenich:
Avoidance of boxed mesh patterns on permutations. Discret. Appl. Math. 161(1-2): 43-51 (2013) - [j32]Sergey Kitaev, Pavel Salimov, Christopher Severs, Henning Úlfarsson:
Restricted non-separable planar maps and some pattern avoiding permutations. Discret. Appl. Math. 161(16-17): 2514-2526 (2013) - [j31]Sergey Kitaev, Jeffrey Liese:
Harmonic numbers, Catalan's triangle and mesh patterns. Discret. Math. 313(14): 1515-1531 (2013) - [j30]Aistis Atminas, Vadim V. Lozin, Sergey Kitaev, Alexandr Valyuzhenich:
Universal graphs and Universal Permutations. Discret. Math. Algorithms Appl. 5(4) (2013) - [j29]Sergey Kitaev:
On Graphs with Representation Number 3. J. Autom. Lang. Comb. 18(2): 97-112 (2013) - 2011
- [b1]Sergey Kitaev:
Patterns in Permutations and Words. Monographs in Theoretical Computer Science. An EATCS Series, Springer 2011, ISBN 978-3-642-17332-5, pp. i-xxii, 1-494 - [j28]Anders Claesson, Mark Dukes, Sergey Kitaev:
A direct encoding of Stoimenows matchings as ascent sequences. Australas. J Comb. 49: 47-60 (2011) - [j27]Anders Claesson, Vít Jelínek, Eva Jelínková, Sergey Kitaev:
Pattern Avoidance in Partial Permutations. Electron. J. Comb. 18(1) (2011) - [j26]Sergey Kitaev, Jeffrey B. Remmel:
Enumerating (2+2)-free posets by the number of minimal elements and other statistics. Discret. Appl. Math. 159(17): 2098-2108 (2011) - [j25]Sergey V. Avgustinovich, Sergey Kitaev, Artem V. Pyatkin, Alexandr Valyuzhenich:
On Square-Free Permutations. J. Autom. Lang. Comb. 16(1): 3-10 (2011) - [c5]Sergey Kitaev, Pavel Salimov, Christopher Severs, Henning Úlfarsson:
On the Representability of Line Graphs. Developments in Language Theory 2011: 478-479 - [c4]Magnús M. Halldórsson, Sergey Kitaev, Artem V. Pyatkin:
Alternation Graphs. WG 2011: 191-202 - 2010
- [j24]Anders Claesson, Sergey Kitaev, Kári Ragnarsson, Bridget Eileen Tenner:
Boolean complexes for Ferrers graphs. Australas. J Comb. 48: 159-174 (2010) - [j23]Sergey Kitaev, Artem V. Pyatkin:
On avoidance of V- and ^-patterns in permutations. Ars Comb. 97 (2010) - [j22]Sergey V. Avgustinovich, Amy Glen, Bjarni V. Halldórsson, Sergey Kitaev:
On shortest crucial words avoiding abelian powers. Discret. Appl. Math. 158(6): 605-607 (2010) - [j21]Amy Glen, Bjarni V. Halldórsson, Sergey Kitaev:
Crucial abelian k-power-free words. Discret. Math. Theor. Comput. Sci. 12(5): 83-96 (2010) - [j20]Sergey Kitaev, Jeffrey B. Remmel:
Place-Difference-Value Patterns: A Generalization of Generalized Permutation and Word Patterns. Integers 10: A11 (2010) - [j19]Mireille Bousquet-Mélou, Anders Claesson, Mark Dukes, Sergey Kitaev:
(2+2)-free posets, ascent sequences and pattern avoiding permutations. J. Comb. Theory A 117(7): 884-909 (2010) - [c3]Magnús M. Halldórsson, Sergey Kitaev, Artem V. Pyatkin:
Graphs Capturing Alternations in Words. Developments in Language Theory 2010: 436-437
2000 – 2009
- 2009
- [j18]Anders Claesson, Sergey Kitaev, Einar Steingrímsson:
Decompositions and statistics for β(1, 0)-trees and nonseparable permutations. Adv. Appl. Math. 42(3): 313-328 (2009) - [j17]Sergey Kitaev, Jeffrey Liese, Jeffrey B. Remmel, Bruce E. Sagan:
Rationality, Irrationality, and Wilf Equivalence in Generalized Factor Order. Electron. J. Comb. 16(2) (2009) - [c2]Amy Glen, Bjarni V. Halldórsson, Sergey Kitaev:
Crucial Words for Abelian Powers. Developments in Language Theory 2009: 264-275 - 2008
- [j16]Sergey V. Avgustinovich, Sergey Kitaev:
On uniquely k-determined permutations. Discret. Math. 308(9): 1500-1507 (2008) - [j15]Sergey Kitaev, Toufik Mansour, Jeffrey B. Remmel:
Counting Descents, Rises, and Levels, with Prescribed First Element, in Words. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - [j14]Sergey Kitaev, Artem V. Pyatkin:
On Representable Graphs. J. Autom. Lang. Comb. 13(1): 45-54 (2008) - [j13]Sergey Kitaev, Steve Seif:
Word Problem of the Perkins Semigroup via Directed Acyclic Graphs. Order 25(3): 177-194 (2008) - [c1]Sergey Kitaev, Toufik Mansour, Patrice Séébold:
Counting Ordered Patterns in Words Generated by Morphisms. LATA 2008: 287-298 - 2007
- [j12]Sergey Kitaev:
Introduction to partially ordered patterns. Discret. Appl. Math. 155(8): 929-944 (2007) - 2006
- [j11]Sergey Kitaev, Jeffrey B. Remmel:
Classifying Descents According to Equivalence mod k. Electron. J. Comb. 13(1) (2006) - 2005
- [j10]Sergey Kitaev, Toufik Mansour:
Simultaneous Avoidance Of Generalized Patterns. Ars Comb. 75 (2005) - [j9]Sergey Kitaev, Toufik Mansour:
On multi-avoidance of generalized patterns. Ars Comb. 76 (2005) - [j8]Sergey Kitaev:
Partially ordered generalized patterns. Discret. Math. 298(1-3): 212-229 (2005) - [j7]Alexander Burstein, Sergey Kitaev:
On Unavoidable Sets of Word Patterns. SIAM J. Discret. Math. 19(2): 371-381 (2005) - [j6]Sergey Kitaev:
Segmental partially ordered generalized patterns. Theor. Comput. Sci. 349(3): 420-428 (2005) - 2004
- [j5]Sergey Kitaev:
The sigma-sequence and counting occurrences of some patterns, subsequences and subwords. Australas. J Comb. 29: 187-200 (2004) - [j4]Sergey Kitaev, Toufik Mansour, Patrice Séébold:
Generating the Peano Curve and Counting Occurrences of some Patterns. J. Autom. Lang. Comb. 9(4): 439-455 (2004) - [j3]A. Evdokimov, Sergey Kitaev:
Crucial words and the complexity of some extremal problems for sets of prohibited words. J. Comb. Theory A 105(2): 273-289 (2004) - 2003
- [j2]Sergey Kitaev:
Multi-avoidance of generalised patterns. Discret. Math. 260(1-3): 89-100 (2003) - [j1]Sergey Kitaev:
There are no Iterated Morphisms that Define the Arshon Sequence and the σ-Sequence. J. Autom. Lang. Comb. 8(1): 43-50 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
