Vít Jelínek

Upper bounds for the Stanley–Wilf limit of 1324 and other layered patterns

Anders Claesson, Vít Jelínek, Einar Steingrı́msson · Journal of Combinatorial Theory Series A · 2012 · 49 citations · Full text

Discrete Geometry, Extremal Combinatorics, Analytic Combinatorics +2

On Pattern-Avoiding Partitions

Vít Jelínek, Toufik Mansour · The Electronic Journal of Combinatorics · 2008 · 48 citations · Full text

Stirling Numbers, Engineering, Pattern-avoiding Partitions +9

Testing Planarity of Partially Embedded Graphs

Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati et al. · ACM Transactions on Algorithms · 2015 · 46 citations · Full text

Mathematical Programming, Engineering, Planar Graph +19

A Kuratowski-type theorem for planarity of partially embedded graphs

Vít Jelínek, Jan Kratochvı́l, Ignaz Rutter · Computational Geometry · 2012 · 38 citations

Mathematical Programming, Geometric Graph Theory, Engineering +6

The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree

Vít Jelínek, Eva Jelínková, Jan Kratochvı́l et al. · Graphs and Combinatorics · 2012 · 35 citations · Full text

Planar Slope Number, Geometric Graph Theory, Discrete Geometry +7