| Hanani–Tutte, monotone drawings, and level-planarity R Fulek, MJ Pelsmajer, M Schaefer, D Štefankovič Thirty essays on geometric graph theory, 263-287, 2013 | 48 | 2013 |
| Graphs that admit right angle crossing drawings K Arikushi, R Fulek, B Keszegh, F Morić, CD Tóth Computational Geometry 45 (4), 169-177, 2012 | 48 | 2012 |
| Crossing Numbers and Combinatorial Characterization of Monotone Drawings of M Balko, R Fulek, J Kynčl Discrete & Computational Geometry 53, 107-143, 2015 | 46 | 2015 |
| A computational approach to Conwayʼs thrackle conjecture R Fulek, J Pach Computational Geometry 44 (6-7), 345-355, 2011 | 43 | 2011 |
| Extending partial representations of circle graphs S Chaplick, R Fulek, P Klavík Graph Drawing: 21st International Symposium, GD 2013, Bordeaux, France …, 2013 | 36 | 2013 |
| Clustered planarity testing revisited R Fulek, J Kynčl, I Malinović, D Pálvölgyi arXiv preprint arXiv:1305.4519, 2013 | 24 | 2013 |
| Universal point sets for planar three-trees R Fulek, CD Tóth Journal of Discrete Algorithms 30, 101-112, 2015 | 22 | 2015 |
| Linear bound on extremal functions of some forbidden patterns in 0–1 matrices R Fulek Discrete Mathematics 309 (6), 1736-1739, 2009 | 21 | 2009 |
| Recognizing weak embeddings of graphs HA Akitaya, R Fulek, CD Tóth ACM Transactions on Algorithms (TALG) 15 (4), 1-27, 2019 | 20 | 2019 |
| Intersecting convex sets by rays R Fulek, AF Holmsen, J Pach Proceedings of the twenty-fourth annual symposium on Computational geometry …, 2008 | 20 | 2008 |
| Orthogeodesic point-set embedding of trees E Di Giacomo, F Frati, R Fulek, L Grilli, M Krug Computational Geometry 46 (8), 929-944, 2013 | 19 | 2013 |
| Topological graphs: empty triangles and disjoint matchings R Fulek, AJ Ruiz-Vargas Proceedings of the twenty-ninth annual symposium on Computational geometry …, 2013 | 19 | 2013 |
| Adjacent crossings do matter R Fulek, MJ Pelsmajer, M Schaefer, D Štefankovič Graph Drawing: 19th International Symposium, GD 2011, Eindhoven, The …, 2012 | 19 | 2012 |
| On the page number of upward planar directed acyclic graphs F Frati, R Fulek, AJ Ruiz-Vargas Graph Drawing: 19th International Symposium, GD 2011, Eindhoven, The …, 2012 | 18 | 2012 |
| Outerplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete p-Partite Graphs R Fulek, H He, O Sýkora, I Vrťo SOFSEM 2005: Theory and Practice of Computer Science: 31st Conference on …, 2005 | 18 | 2005 |
| Convex obstacle numbers of outerplanar graphs and bipartite permutation graphs R Fulek, N Saeedi, D Sarıöz Thirty essays on geometric graph theory, 249-261, 2012 | 15 | 2012 |
| Atomic embeddability, clustered planarity, and thickenability R Fulek, CD Tóth ACM Journal of the ACM (JACM) 69 (2), 1-34, 2022 | 14 | 2022 |
| On the size of graphs that admit polyline drawings with few bends and crossing angles E Ackerman, R Fulek, CD Tóth Graph Drawing: 18th International Symposium, GD 2010, Konstanz, Germany …, 2011 | 13 | 2011 |
| Counterexample to an Extension of the Hanani-Tutte Theorem on the Surface of Genus 4 R Fulek, J Kynčl Combinatorica 39 (6), 1267-1279, 2019 | 12 | 2019 |
| Graphs that admit polyline drawings with few crossing angles E Ackerman, R Fulek, CD Tóth SIAM Journal on Discrete Mathematics 26 (1), 305-320, 2012 | 12 | 2012 |
Jan KynčlCharles University, PragueVerified email at kam.mff.cuni.cz
