2 citations · 3 across the 9 of their papers we have counts for
11 papers
On permutations avoiding partially ordered patterns defined by bipartite graphs
Sergey Kitaev, Artem Pyatkin
Partially ordered patterns (POPs) generalize the notion of classical patterns studied in the literature in the context of permutations, words, compositions and partitions. In this…
On semi-transitive orientability of split graphs
Sergey Kitaev, Artem Pyatkin
A directed graph is semi-transitive if and only if it is acyclic and for any directed path , , either there is no ed…
Probabilistic and analytical properties of the last passage percolation constant in a weighted random directed graph
Sergey Foss, Takis Konstantopoulos, Artem Pyatkin
To each edge (i,j), i<j of the complete directed graph on the integers we assign unit weight with probability p or weight x with probability 1-p, independently from edge to edge, a…
On semi-transitive orientability of triangle-free graphs
Sergey Kitaev, Artem Pyatkin
An orientation of a graph is semi-transitive if it is acyclic, and for any directed path either there is no arc between …
On k-11-representable graphs
Gi-Sang Cheon, Jinha Kim, Minki Kim +2
Distinct letters and alternate in a word if after deleting in all letters but the copies of and we either obtain a word of the form (of even or…
On Finding Maximum Cardinality Subset of Vectors with a Constraint on Normalized Squared Length of Vectors Sum
Anton V. Eremeev, Alexander V. Kelmanov, Artem V. Pyatkin +1
In this paper, we consider the problem of finding a maximum cardinality subset of vectors, given a constraint on the normalized squared length of vectors sum. This problem is close…