Vít Jelínek
Vít Jelínek
Computer Science Institute of Charles University, Prague
Verified email at iuuk.mff.cuni.cz - Homepage
Title
Cited by
Cited by
Year
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
632010
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
582012
On Pattern-Avoiding Partitions
V Jelínek, T Mansour
Electronic Journal of Combinatorics 15, 2008
492008
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
412015
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
362013
Dyck paths and pattern-avoiding matchings
V Jelínek
European Journal of Combinatorics 28 (1), 202-213, 2007
322007
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
302011
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
292008
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
272013
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
272010
The rank-width of the square grid
V Jelínek
International Workshop on Graph-Theoretic Concepts in Computer Science, 230-239, 2008
262008
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
232012
The rank-width of the square grid
V Jelínek
Discrete Applied Mathematics 158 (7), 841-850, 2010
212010
Clustered planarity: Clusters with few outgoing edges
V Jelínek, O Suchý, M Tesař, T Vyskočil
International Symposium on Graph Drawing, 102-113, 2008
172008
Counting general and self-dual interval orders
V Jelínek
Journal of Combinatorial Theory, Series A 119 (3), 599-614, 2012
152012
Composition Matrices, (2+2)-free Posets and their Specializations
M Dukes, V Jelínek, M Kubitzke
Electronic Journal of Combinatorics 18 (1), 2011
152011
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
15*2003
On multiple pattern avoiding set partitions
V Jelínek, T Mansour, M Shattuck
Advances in Applied Mathematics 50 (2), 292-326, 2013
142013
Three optimal algorithms for balls of three colors
Z Dvořák, V Jelínek, J Kynčl, M Saks
Annual Symposium on Theoretical Aspects of Computer Science, 206-217, 2005
142005
Wilf-Equivalence on k-ary Words, Compositions, and Parking Functions
V Jelínek, T Mansour
Electronic Journal of Combinatorics 16 (1), R58, 2009
132009
The system can't perform the operation now. Try again later.
Articles 1–20