Graphs drawn with few crossings per edge J Pach, G Tóth Combinatorica 17 (3), 427-439, 1997 | 432 | 1997 |

Which crossing number is it, anyway?[computational geometry] J Pach, G Tóth Foundations of Computer Science, 1998. Proceedings. 39th Annual Symposium on …, 1998 | 193* | 1998 |

Improving the crossing lemma by finding more crossings in sparse graphs J Pach, R Radoicic, G Tardos, G Tóth Discrete & Computational Geometry 36 (4), 527-552, 2006 | 173 | 2006 |

Point sets with many k-sets G Tóth Discrete & Computational Geometry 26 (2), 187-194, 2001 | 167 | 2001 |

The Erdos-Szekeres theorem: upper bounds and related results G Tóth, P Valtr Combinatorial and computational geometry 19, 557-568, 2005 | 114 | 2005 |

Note on the Erdos-Szekeres theorem G Tóth, P Valtr Discrete & Computational Geometry 19 (3), 457-459, 1998 | 107 | 1998 |

Thirteen problems on crossing numbers J Pach, G Tóth Geombinatorics 9 (4), 194-207, 2000 | 99 | 2000 |

Ramsey-type results for geometric graphs, I G Karolyi, J Pach, G Toth Discrete & Computational Geometry 18 (3), 247-255, 1997 | 95 | 1997 |

New bounds on crossing numbers J Pach, J Spencer, G Tóth Discrete & Computational Geometry 24 (4), 623-644, 2000 | 89 | 2000 |

Conflict-free colorings J Pach, G Tóth ALGORITHMS AND COMBINATORICS 25, 665-672, 2003 | 77 | 2003 |

Three-dimensional grid drawings of graphs J Pach, T Thiele, G Toth Contemporary Mathematics 223, 251-256, 1998 | 76 | 1998 |

Recognizing string graphs is decidable J Pach, G Tóth Graph Drawing, 479-482, 2002 | 66 | 2002 |

Unavoidable configurations in complete topological graphs J Pach, J Solymosi, G Tóth Discrete & Computational Geometry 30 (2), 311-320, 2003 | 62 | 2003 |

Note on geometric graphs G Tóth Journal of combinatorial theory. Series A 89 (1), 126-132, 2000 | 62 | 2000 |

Ramsey-type results for geometric graphs. II G Károlyi, J Pach, G Tóth, P Valtr Proceedings of the thirteenth annual symposium on Computational geometry, 94-103, 1997 | 62 | 1997 |

Monotone drawings of planar graphs J Pach, G Tóth Journal of Graph Theory 46 (1), 39-47, 2004 | 59 | 2004 |

Decomposition of multiple coverings into many parts J Pach, G Tóth Computational Geometry 42 (2), 127-133, 2009 | 52 | 2009 |

Relaxing planarity for topological graphs J Pach, R Radoičić, G Tóth Discrete and computational geometry, 221-232, 2003 | 52 | 2003 |

Note on the chromatic number of the space R Radoicic, G Tóth ALGORITHMS AND COMBINATORICS 25, 695-698, 2003 | 50* | 2003 |

Convex sets in the plane with three of every four meeting DJ Kleitman, A Gyárfás, G Tóth Combinatorica 21 (2), 221-232, 2001 | 50 | 2001 |