| 2008 |
|---|
| 9 | EE | Jakub Cerný:
A simple proof for open cups and caps.
Eur. J. Comb. 29(1): 218-226 (2008) |
| 8 | EE | Henning Bruhn,
Jakub Cerný,
Alexander Hall,
Petr Kolman,
Jiri Sgall:
Single Source Multiroute Flows and Cuts on Uniform Capacity Networks.
Theory of Computing 4(1): 1-20 (2008) |
| 2007 |
|---|
| 7 | EE | Jakub Cerný,
Jan Kyncl,
Géza Tóth:
Improvement on the Decay of Crossing Numbers.
Graph Drawing 2007: 25-30 |
| 6 | EE | Henning Bruhn,
Jakub Cerný,
Alexander Hall,
Petr Kolman:
Single source multiroute flows and cuts on uniform capacity networks.
SODA 2007: 855-863 |
| 5 | 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) |
| 4 | EE | Jakub Cerný:
Coloring circle graphs.
Electronic Notes in Discrete Mathematics 29: 457-461 (2007) |
| 2005 |
|---|
| 3 | EE | Jakub Cerný:
Geometric Graphs with No Three Disjoint Edges.
Discrete & Computational Geometry 34(4): 679-695 (2005) |
| 2003 |
|---|
| 2 | EE | Jakub Cerný,
Zdenek Dvorak,
Vít Jelínek,
Jan Kára:
Noncrossing Hamiltonian Paths in Geometric Graphs.
Graph Drawing 2003: 86-97 |
| 2001 |
|---|
| 1 | EE | Jakub Cerný,
Daniel Král,
Helena Nyklová,
Ondrej Pangrác:
On Intersection Graphs of Segments with Prescribed Slopes.
Graph Drawing 2001: 261-271 |
