Jan Kyncl

Jakub Cerný, Jan Kyncl, Géza Tóth: Improvement on the Decay of Crossing Numbers. Graphs and Combinatorics 29(3): 365-371 (2013)

Jan Kyncl: Ramsey-type constructions for arrangements of segments. Eur. J. Comb. 33(3): 336-339 (2012)

Josef Cibulka, Jan Kyncl: Tight bounds on the maximum size of a set of permutations with bounded VC-dimension. J. Comb. Theory, Ser. A 119(7): 1461-1478 (2012)

Josef Cibulka, Jan Kyncl: Tight bounds on the maximum size of a set of permutations with bounded VC-dimension. SODA 2012: 1113-1122

Jakub Cerný, Jan Kyncl, Géza Tóth: Improvement on the decay of crossing numbers. CoRR abs/1201.5421 (2012)

Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr: Graph sharing games: complexity and connectivity. CoRR abs/1202.0847 (2012)

Jan Kyncl: Improved enumeration of simple topological graphs. CoRR abs/1212.2950 (2012)

Jan Kyncl: Simple Realizability of Complete Abstract Topological Graphs in P. Discrete & Computational Geometry 45(3): 383-399 (2011)

Jan Kyncl, Martin Novotný: Education of Digital and Analog Circuits supported by computer algebra system. ISCAS 2011: 341-344

Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr: Universal Sets for Straight-Line Embeddings of Bicolored Graphs. CoRR abs/1102.0874 (2011)

Josef Cibulka, Jan Kyncl: Tight bounds on the maximum size of a set of permutations with bounded VC-dimension. CoRR abs/1104.5007 (2011)

Jan Kyncl, Tomás Vyskocil: Logspace Reduction of Directed Reachability for Bounded Genus Graphs to the Planar Case. TOCT 1(3) (2010)

Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr: On Three Parameters of Invisibility Graphs. COCOON 2010: 192-198

Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr: Graph Sharing Games: Complexity and Connectivity. TAMC 2010: 340-349

Vít Jelínek, Jan Kyncl, Rudolf Stolar, Tomás Valla: Monochromatic triangles in two-colored plane. Combinatorica 29(6): 699-718 (2009)

Jan Kyncl, Pavel Valtr: On edges crossing few other edges in simple topological complete graphs. Discrete Mathematics 309(7): 1917-1923 (2009)

Jan Kyncl: Enumeration of simple complete topological graphs. Eur. J. Comb. 30(7): 1676-1685 (2009)

Ken-ichi Kawarabayashi, Daniel Král, Jan Kyncl, Bernard Lidický: 6-Critical Graphs on the Klein Bottle. SIAM J. Discrete Math. 23(1): 372-383 (2009)

Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr: Solution of Peter Winkler's Pizza Problem. IWOCA 2009: 356-367

Jan Kyncl, Tomás Vyskocil: Logspace reduction of directed reachability for bounded genus graphs to the planar case. Electronic Colloquium on Computational Complexity (ECCC) 16: 50 (2009)

Jan Kyncl, Martin Tancer: The Maximum Piercing Number for some Classes of Convex Sets with the (4, 3)-property. Electr. J. Comb. 15(1) (2008)

Jan Kyncl, János Pach, Géza Tóth: Long alternating paths in bicolored point sets. Discrete Mathematics 308(19): 4315-4321 (2008)

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)

Jan Kyncl: Ramsey-type constructions for arrangements of segments. Electronic Notes in Discrete Mathematics 31: 265-269 (2008)

Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr: Hamiltonian Alternating Paths on Bicolored Double-Chains. Graph Drawing 2008: 181-192

Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr: Solution of Peter Winkler's Pizza Problem. CoRR abs/0812.4322 (2008)

Jan Kyncl: Enumeration of simple complete topological graphs. Electronic Notes in Discrete Mathematics 29: 295-299 (2007)

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)

Jakub Cerný, Jan Kyncl, Géza Tóth: Improvement on the Decay of Crossing Numbers. Graph Drawing 2007: 25-30

Jan Kyncl: The Complexity of Several Realizability Problems for Abstract Topological Graphs. Graph Drawing 2007: 137-158

Jan Kyncl, Pavel Valtr: On Edges Crossing Few Other Edges in Simple Topological Complete Graphs. Graph Drawing 2005: 274-284

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

Jan Kyncl, János Pach, Géza Tóth: Long Alternating Paths in Bicolored Point Sets. Graph Drawing 2004: 340-348