| 2008 |
|---|
| 12 | EE | Vít Jelínek,
Ondrej Suchý,
Marek Tesar,
Tomás Vyskocil:
Clustered Planarity: Clusters with Few Outgoing Edges.
Graph Drawing 2008: 102-113 |
| 11 | EE | 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 |
| 10 | EE | Vít Jelínek:
The Rank-Width of the Square Grid.
WG 2008: 230-239 |
| 2007 |
|---|
| 9 | EE | 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 | EE | 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 | EE | Vít Jelínek:
Dyck paths and pattern-avoiding matchings.
Eur. J. Comb. 28(1): 202-213 (2007) |
| 6 | EE | 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 | EE | 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 | EE | 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 | EE | Zdenek Dvorak,
Vít Jelínek:
On the Complexity of the G-Reconstruction Problem.
ISAAC 2005: 196-205 |
| 2 | EE | 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 | EE | Jakub Cerný,
Zdenek Dvorak,
Vít Jelínek,
Jan Kára:
Noncrossing Hamiltonian Paths in Geometric Graphs.
Graph Drawing 2003: 86-97 |
