| Testing planarity of partially embedded graphs P Angelini, G Di Battista, F Frati, V Jelínek, J Kratochvíl, M Patrignani, ... ACM Transactions on Algorithms (TALG) 11 (4), 1-42, 2015 | 76 | 2015 |
| Upper bounds for the Stanley–Wilf limit of 1324 and other layered patterns A Claesson, V Jelínek, E Steingrímsson Journal of Combinatorial Theory, Series A 119 (8), 1680-1691, 2012 | 71 | 2012 |
| Testing planarity of partially embedded graphs P Angelini, G Di Battista, F Frati, V Jelínek, J Kratochvíl, M Patrignani, ... Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010 | 68 | 2010 |
| On Pattern-Avoiding Partitions V Jelínek, T Mansour Electronic Journal of Combinatorics 15, 2008 | 58 | 2008 |
| A Kuratowski-type theorem for planarity of partially embedded graphs V Jelínek, J Kratochvíl, I Rutter Computational Geometry 46 (4), 466-492, 2013 | 56 | 2013 |
| The planar slope number of planar partial 3-trees of bounded degree V Jelínek, E Jelínková, J Kratochvíl, B Lidický, M Tesař, T Vyskočil Graphs and Combinatorics 29 (4), 981-1005, 2013 | 47 | 2013 |
| The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree V Jelínek, E Jelínková, J Kratochvíl, B Lidický, M Tesař, T Vyskočil Proceedings of Graph Drawing 2009, Lecture Notes in Computer Science 5849 …, 2010 | 47 | 2010 |
| Bend-bounded path intersection graphs: Sausages, noodles, and waffles on a grill S Chaplick, V Jelínek, J Kratochvíl, T Vyskočil International Workshop on Graph-Theoretic Concepts in Computer Science, 274-285, 2012 | 41 | 2012 |
| The rank-width of the square grid V Jelínek Discrete Applied Mathematics 158 (7), 841-850, 2010 | 38 | 2010 |
| The rank-width of the square grid V Jelínek International Workshop on Graph-Theoretic Concepts in Computer Science, 230-239, 2008 | 38 | 2008 |
| The Möbius function of separable and decomposable permutations A Burstein, V Jelínek, E Jelínková, E Steingrímsson Journal of Combinatorial Theory, Series A 118 (8), 2346-2364, 2011 | 36 | 2011 |
| Dyck paths and pattern-avoiding matchings V Jelínek European Journal of Combinatorics 28 (1), 202-213, 2007 | 36 | 2007 |
| Clustered planarity: Embedded clustered graphs with two-component clusters V Jelínek, E Jelínková, J Kratochvíl, B Lidický International Symposium on Graph Drawing, 121-132, 2008 | 32 | 2008 |
| On multiple pattern avoiding set partitions V Jelínek, T Mansour, M Shattuck Advances in Applied Mathematics 50 (2), 292-326, 2013 | 25 | 2013 |
| Counting general and self-dual interval orders V Jelínek Journal of Combinatorial Theory, Series A 119 (3), 599-614, 2012 | 25 | 2012 |
| Cops and robbers on intersection graphs T Gavenčiak, V Jelínek, P Klavík, J Kratochvíl International Symposium on Algorithms and Computation, 174-184, 2013 | 24* | 2013 |
| On grounded L-graphs and their relatives V Jelínek, M Töpfer arXiv preprint arXiv:1808.04148, 2018 | 22 | 2018 |
| Hardness of permutation pattern matching V Jelínek, J Kynčl Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 22 | 2017 |
| Wilf-Equivalence on k-ary Words, Compositions, and Parking Functions V Jelínek, T Mansour Electronic Journal of Combinatorics 16 (1), R58, 2009 | 22 | 2009 |
| Noncrossing Hamiltonian paths in geometric graphs J Černý, Z Dvořák, V Jelínek, J Kára International Symposium on Graph Drawing, 86-97, 2003 | 22* | 2003 |
Jan Kratochvilprofessor, Charles university in Prague, Univerzita KarlovaE-mailová adresa ověřena na: kam.mff.cuni.cz
