Crossing Numbers and Combinatorial Characterization of Monotone Drawings of K_n M Balko, R Fulek, J Kynčl Discrete & Computational Geometry 53 (1), 107-143, 2015 | 53 | 2015 |

Ramsey numbers of ordered graphs M Balko, J Cibulka, K Král, J Kynčl arXiv preprint arXiv:1310.7208, 2013 | 52 | 2013 |

Simple Realizability of Complete Abstract Topological Graphs in P J Kynčl Discrete and Computational Geometry, 1-17, 2011 | 50* | 2011 |

Enumeration of simple complete topological graphs J Kyncl European Journal of Combinatorics 30 (7), 1676-1685, 2009 | 43 | 2009 |

Improved enumeration of simple topological graphs J Kynčl Discrete & Computational Geometry 50 (3), 727-770, 2013 | 40 | 2013 |

Long alternating paths in bicolored point sets J Kynčl, J Pach, G Tóth Discrete Mathematics 308 (19), 4315-4321, 2008 | 33 | 2008 |

Tight bounds on the maximum size of a set of permutations with bounded VC-dimension J Cibulka, J Kynčl Journal of Combinatorial Theory, Series A 119 (7), 1461-1478, 2012 | 32 | 2012 |

6-critical graphs on the Klein bottle K Kawarabayashi, D Král, J KYNCL, B LIDICKY SIAM journal on discrete mathematics 23 (1), 372-383, 2010 | 32 | 2010 |

Clustered planarity testing revisited R Fulek, J Kynčl, I Malinović, D Pálvölgyi The Electronic Journal of Combinatorics 22 (4), P4. 24, 2015 | 29* | 2015 |

Irreversible 2-conversion set in graphs of bounded degree T Vyskočil, B Lidický, J Kynčl Discrete Mathematics & Theoretical Computer Science 19, 2017 | 26* | 2017 |

Solution of Peter Winkler’s Pizza Problem*† J Cibulka, R Stolař, J Kynčl, V Mészáros, P Valtr, V Mészáros Fete of Combinatorics and Computer Science, 63-93, 2010 | 25 | 2010 |

Better upper bounds on the Füredi-Hajnal limits of permutations J Cibulka, J Kynčl Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 24* | 2017 |

Graph sharing games: complexity and connectivity J Cibulka, J Kynčl, V Mészáros, R Stolař, P Valtr Theoretical Computer Science 494, 49-62, 2013 | 24 | 2013 |

Probabilistic strategies for the partition and plurality problems Z Dvořák, V Jelínek, D Král, J Kynčl, M Saks Random Structures & Algorithms 30 (1‐2), 63-77, 2007 | 24* | 2007 |

Logspace reduction of directed reachability for bounded genus graphs to the planar case J Kynčl, T Vyskočil ACM Transactions on Computation Theory (TOCT) 1 (3), 1-11, 2010 | 22 | 2010 |

Simple realizability of complete abstract topological graphs simplified J Kynčl Discrete & Computational Geometry 64 (1), 1-27, 2020 | 21* | 2020 |

Hanani-Tutte for approximating maps of graphs R Fulek, J Kynčl arXiv preprint arXiv:1705.05243, 2017 | 19 | 2017 |

Hardness of permutation pattern matching V Jelínek, J Kynčl Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 19 | 2017 |

The maximum piercing number for some classes of convex sets with the (4, 3)-property J Kyncl, M Tancer the electronic journal of combinatorics 15 (R27), 1, 2008 | 18 | 2008 |

Saturated simple and k-simple topological graphs J Kynčl, J Pach, R Radoičić, G Tóth Computational Geometry 48 (4), 295-310, 2015 | 17 | 2015 |