2 citations · 3 across the 6 of their papers we have counts for
9 papers
Long paths make pattern-counting hard, and deep trees make it harder
Vít Jelínek, Michal Opler, Jakub Pekárek
We study the counting problem known as #PPM, whose input is a pair of permutations and (called pattern and text, respectively), and the task is to find the number of subseq…
Griddings of permutations and hardness of pattern matching
Vít Jelínek, Michal Opler, Jakub Pekárek
We study the complexity of the decision problem known as Permutation Pattern Matching, or PPM. The input of PPM consists of a pair of permutations (the `text') and (the `pa…
On 3-Coloring of -Free Graphs
Vít Jelínek, Tereza Klimošová, Tomáš Masařík +2
The 3-coloring of hereditary graph classes has been a deeply-researched problem in the last decade. A hereditary graph class is characterized by a (possibly infinite) list of minim…
A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes
Vít Jelínek, Michal Opler, Jakub Pekárek
Permutation Pattern Matching (PPM) is the problem of deciding for a given pair of permutations P and T whether the pattern P is contained in the text T. Bose, Buss and Lubiw showed…
Fillings of skew shapes avoiding diagonal patterns
Vít Jelínek, Mark Karpilovskij
A skew shape is the difference of two top-left justified Ferrers shapes sharing the same top-left corner. We study integer fillings of skew shapes. As our first main result, we sho…
Two examples of Wilf-collapse
Michael Albert, Vít Jelínek, Michal Opler
Two permutation classes, the X-class and subpermutations of the increasing oscillation are shown to exhibit an exponential Wilf-collapse. This means that the number of distinct enu…