 | 2012 |
| 25 |  | Vít Jelínek,
Jan Kratochvíl,
Ignaz Rutter:
A Kuratowski-Type Theorem for Planarity of Partially Embedded Graphs
CoRR abs/1204.2915: (2012) |
| 24 |  | Vít Jelínek:
Counting general and self-dual interval orders.
J. Comb. Theory, Ser. A 119(3): 599-614 (2012) |
| 2011 |
| 23 |  | Vít Jelínek,
Jan Kratochvíl,
Ignaz Rutter:
A kuratowski-type theorem for planarity of partially embedded graphs.
Symposium on Computational Geometry 2011: 107-116 |
| 22 |  | Mark Dukes,
Vít Jelínek,
Martina Kubitzke:
Composition Matrices, (2+2)-Free Posets and their Specializations.
Electr. J. Comb. 18(1): (2011) |
| 21 |  | Anders Claesson,
Vít Jelínek,
Eva Jelínková,
Sergey Kitaev:
Pattern Avoidance in Partial Permutations.
Electr. J. Comb. 18(1): (2011) |
| 20 |  | Vít Jelínek,
Martin Klazar:
Embedding dualities for set partitions and for relational structures.
Eur. J. Comb. 32(7): 1084-1096 (2011) |
| 2010 |
| 19 |  | Patrizio Angelini,
Giuseppe Di Battista,
Fabrizio Frati,
Vít Jelínek,
Jan Kratochvíl,
Maurizio Patrignani,
Ignaz Rutter:
Testing Planarity of Partially Embedded Graphs.
SODA 2010: 202-221 |
| 18 |  | Vít Jelínek:
The rank-width of the square grid.
Discrete Applied Mathematics 158(7): 841-850 (2010) |
| 17 |  | Vít Jelínek,
Toufik Mansour:
Matchings and Partial Patterns.
Electr. J. Comb. 17(1): (2010) |
| 2009 |
| 16 |  | Vít Jelínek,
Eva Jelínková,
Jan Kratochvíl,
Bernard Lidický,
Marek Tesar,
Tomás Vyskocil:
The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree.
Graph Drawing 2009: 304-315 |
| 15 |  | Vít Jelínek,
Jan Kyncl,
Rudolf Stolar,
Tomás Valla:
Monochromatic triangles in two-colored plane.
Combinatorica 29(6): 699-718 (2009) |
| 14 |  | Vít Jelínek,
Toufik Mansour:
Wilf-Equivalence on k-ary Words, Compositions, and Parking Functions.
Electr. J. Comb. 16(1): (2009) |
| 2008 |
| 13 |  | Vít Jelínek,
Ondrej Suchý,
Marek Tesar,
Tomás Vyskocil:
Clustered Planarity: Clusters with Few Outgoing Edges.
Graph Drawing 2008: 102-113 |
| 12 |  | Vít Jelínek,
Eva Jelínková,
Jan Kratochvíl,
Bernard Lidický:
Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters.
Graph Drawing 2008: 121-132 |
| 11 |  | Vít Jelínek:
The Rank-Width of the Square Grid.
WG 2008: 230-239 |
| 10 |  | Vít Jelínek,
Toufik Mansour:
On Pattern-Avoiding Partitions.
Electr. J. Comb. 15(1): (2008) |
| 2007 |
| 9 |  | Jakub Cerný,
Zdenek Dvorak,
Vít Jelínek,
Jan Kára:
Noncrossing Hamiltonian paths in geometric graphs.
Discrete Applied Mathematics 155(9): 1096-1105 (2007) |
| 8 |  | Vít Jelínek,
Martin Klazar:
Generalizations of Khovanski's theorem on growth of sumsets in abelian semigroups: (extended abstract).
Electronic Notes in Discrete Mathematics 29: 273-276 (2007) |
| 7 |  | Vít Jelínek:
Dyck paths and pattern-avoiding matchings.
Eur. J. Comb. 28(1): 202-213 (2007) |
| 6 |  | Zdenek Dvorak,
Vít Jelínek,
Daniel Král,
Jan Kyncl,
Michael E. Saks:
Probabilistic strategies for the partition and plurality problems.
Random Struct. Algorithms 30(1-2): 63-77 (2007) |
| 5 |  | Robert Babilon,
Vít Jelínek,
Daniel Král,
Pavel Valtr:
Labelings of Graphs with Fixed and Variable Edge-Weights.
SIAM J. Discrete Math. 21(3): 688-706 (2007) |
| 2006 |
| 4 |  | Vít Jelínek,
Nelson Y. Li,
Toufik Mansour,
Sherry H. F. Yan:
Matchings Avoiding Partial Patterns and Lattice Paths.
Electr. J. Comb. 13(1): (2006) |
| 2005 |
| 3 |  | Zdenek Dvorak,
Vít Jelínek:
On the Complexity of the G-Reconstruction Problem.
ISAAC 2005: 196-205 |
| 2 |  | Zdenek Dvorak,
Vít Jelínek,
Daniel Král,
Jan Kyncl,
Michael E. Saks:
Three Optimal Algorithms for Balls of Three Colors.
STACS 2005: 206-217 |
| 2003 |
| 1 |  | Jakub Cerný,
Zdenek Dvorak,
Vít Jelínek,
Jan Kára:
Noncrossing Hamiltonian Paths in Geometric Graphs.
Graph Drawing 2003: 86-97 |