| 2008 |
|---|
| 12 | EE | Josef Cibulka,
Jan Kyncl,
Viola Mészáros,
Rudolf Stolar,
Pavel Valtr:
Hamiltonian Alternating Paths on Bicolored Double-Chains.
Graph Drawing 2008: 181-192 |
| 11 | EE | Josef Cibulka,
Jan Kyncl,
Viola Mészáros,
Rudolf Stolar,
Pavel Valtr:
Solution of Peter Winkler's Pizza Problem
CoRR abs/0812.4322: (2008) |
| 10 | EE | Jan Kyncl,
János Pach,
Géza Tóth:
Long alternating paths in bicolored point sets.
Discrete Mathematics 308(19): 4315-4321 (2008) |
| 9 | EE | Nathan Chenette,
Luke Postle,
Noah Streib,
Robin Thomas,
Carl Yerger,
Ken-ichi Kawarabayashi,
Daniel Král,
Jan Kyncl,
Bernard Lidický:
Six-Critical Graphs on the Klein Bottle.
Electronic Notes in Discrete Mathematics 31: 235-240 (2008) |
| 8 | EE | Jan Kyncl:
Ramsey-type constructions for arrangements of segments.
Electronic Notes in Discrete Mathematics 31: 265-269 (2008) |
| 2007 |
|---|
| 7 | EE | Jan Kyncl:
The Complexity of Several Realizability Problems for Abstract Topological Graphs.
Graph Drawing 2007: 137-158 |
| 6 | EE | Jakub Cerný,
Jan Kyncl,
Géza Tóth:
Improvement on the Decay of Crossing Numbers.
Graph Drawing 2007: 25-30 |
| 5 | EE | Jan Kyncl:
Enumeration of simple complete topological graphs.
Electronic Notes in Discrete Mathematics 29: 295-299 (2007) |
| 4 | 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) |
| 2005 |
|---|
| 3 | EE | Jan Kyncl,
Pavel Valtr:
On Edges Crossing Few Other Edges in Simple Topological Complete Graphs.
Graph Drawing 2005: 274-284 |
| 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 |
| 2004 |
|---|
| 1 | EE | Jan Kyncl,
János Pach,
Géza Tóth:
Long Alternating Paths in Bicolored Point Sets.
Graph Drawing 2004: 340-348 |
