Browse by Author or Creator
Group by: Item type | No Grouping
Number of items: 11.
Kitaev, Sergey and Remmel, Jeffrey (2011) Enumerating (2+2) -free posets by the number of minimal elements and other statistics. Discrete Mathematics, 159 (17). 2098 - 2108.
Claesson, Anders and Dukes, Mark and Kitaev, Sergey (2011) A direct encoding of Stoimenow's matchings as ascent sequences. Australasian Journal of Combinatorics, 49. pp. 47-59.
Dukes, Mark and Kitaev, Sergey and Remmel, Jeffrey and Steingrimsson, Einar (2011) Enumerating (2+2)-free posets by indistinguishable elements. Journal of Combinatorics, 2 (1). pp. 139-163.
Claesson, A. and Jelinek, V. and Jelinkova, E. and Kitaev, S. (2011) Pattern avoidance in partial permutations. The Electronic Journal of Combinatorics, 18 (1). ISSN 1077-8926
Bousquet-Melou, Mireille and Claesson, Anders and Dukes, Mark and Kitaev, Sergey (2010) (2+2)-free posets, ascent sequences and pattern avoiding permutations. Journal of Combinatorial Theory Series A, 117 (7). pp. 884-909.
Glen, Amy and Halldorsson, Bjarni and Kitaev, Sergey (2010) Crucial abelian k-power-free words. Discrete Mathematics and Theoretical Computer Science, 12 (5). pp. 83-96.
Claesson, Anders and Kitaev, Sergey and Steingrimsson, Einar (2009) Decompositions and statistics for β(1,0)-trees and nonseparable permutations. Advances in Applied Mathematics, 42 (3). 313–328. ISSN 0196-8858
Claesson, Anders and Kitaev, Sergey (2008) Classification of bijections between 321- and 132-avoiding permutations. Séminaire Lotharingien de Combinatoire, 60. ISSN 1286-4889
Kitaev, Sergey and Seif, Steven (2008) Word problem of the Perkins semigroup via directed acyclic graphs. Order, 25 (3). pp. 177-194.
Kitaev, Sergey (2011) Patterns in permutations and words. Monographs in Theoretical Computer Science. An EATCS Series . Springer-Verlag Berlin. ISBN 9783642173325
Halldorsson, Magnus and Kitaev, Sergey and Pyatkin, Artem (2011) Alternation graphs. [Proceedings Paper]
This list was generated on Thu Aug 21 06:32:08 2014 BST.