50 citations · 195 across the 19 of their papers we have counts for
4 papers · 2 filters
Hardness of Permutation Pattern Matching
Vít Jelínek, Jan Kynčl
Permutation Pattern Matching (or PPM) is a decision problem whose input is a pair of permutations and , represented as sequences of integers, and the task is to determine wh…
Cops and Robbers on Intersection Graphs
Tomáš Gavenčiak, Przemysław Gordinowicz, Vít Jelínek +2
The cop number of a graph is the smallest such that cops win the game of cops and robber on . We investigate the maximum cop number of geometric intersection graphs,…
On ordered Ramsey numbers of bounded-degree graphs
Martin Balko, Vít Jelínek, Pavel Valtr
An ordered graph is a pair where is a graph and is a total ordering of its vertices. The ordered Ramsey number is th…
Unsplittable classes of separable permutations
Michael Albert, Vít Jelínek
A permutation class is splittable if it is contained in the merge of two of its proper subclasses. We characterise the unsplittable subclasses of the class of separable permutation…