- Comment on Fox News Janos Pach # and Geza Toth +
- Unavoidable configurations in complete topological graphs Janos Pach
- Note on the pair-crossing number and the odd-crossing number Geza Toth
- Crossing stars in topological graphs Gabor Tardos
- Ramsey{Type Results for Geometric Graphs. II Gyula K arolyi
- An Erd}os-Szekeres type problem in the plane Gyula K arolyi
- Monotone drawings of planar graphs Janos Pach #
- Monotone paths in line arrangements Rado s Radoi ci c
- Indecomposable coverings Janos Pach # Gabor Tardos + Geza Toth #
- A Ramsey-type bound for rectangles G eza T oth
- Note on the chromatic number of the space Rados Radoicic
- Drawing cubic graphs with at most five slopes # Balazs Keszegh + Janos Pach # Domotor Palvolgyi Geza Toth
- Monotone drawings of planar graphs Janos Pach
- Decomposition of multiple coverings into many parts Janos Pach
- Graphs drawn with few crossings per edge J anos Pach and G eza T oth y
- Crossing numbers of random graphs Joel Spencer
- The maximum number of empty congruent triangles determined by a point set
- "!$#&%'(!0)12#&35462#78#93@#'A!CB 4DE8F2#
- How many ways can one draw a graph? Janos Pach1
- Improving the Crossing Lemma by finding more crossings in sparse graphs
- Disjoint edges in topological graphs Janos Pach
- The Erdos-Szekeres theorem: upper bounds and related results Geza Toth
- Multiple coverings of the plane with triangles Gabor Tardos
- The maximum number of empty congruent triangles determined by a point set
- Indecomposable coverings Janos Pach
- Comment on Fox News Janos Pach
- Drawing cubic graphs with at most five slopes Balazs Keszegh
- Families of convex sets not representable by points Janos Pach
- Convex polygons are cover-decomposable Dmtr Plvlgyi # Gza Tth +
- An algorithm for nding many disjoint monochromatic edges in a complete 2-colored geometric graph
- Geometric graphs with no selfintersecting path of length three #
- Conflictfree colorings Janos Pach #
- New bounds on crossing numbers J anos Pach
- Geometric graphs with no self-intersecting path of length three
- Thirteen Problems on Crossing Numbers
- Note on geometric graphs G eza T oth
- Note on a Ramsey-type problem in geometry Gy orgy Csizmadia and G eza T oth
- Disjoint edges in topological graphs # Janos Pach + Geza Toth #
- Contemporary Mathematics The discharging method in combinatorial geometry and the
- Crossing number of toroidal graphs Janos Pach
- Contemporary Mathematics A generalization of quasi-planarity
- Improvement on the decay of crossing numbers Cerny # Jan Kyncl + Geza Toth #
- The shortest distance among points in general G eza T oth
- The ErdosSzekeres theorem: upper bounds and related results Geza Toth #
- On the independence number of coin graphs
- Crossing stars in topological graphs # Gabor Tardos + Geza Toth #
- Long Alternating Paths in Bicolored Point Sets Jan Kyn cl y J anos Pach z G eza T oth x
- Note on the Erd}os-Szekeres theorem G eza T oth
- Topological graphs with no large grids J anos Pach 1 , Rom Pinchasi 2 , Micha Sharir 3 , G eza T oth 4
- Convex Sets in the Plane with Three of Every Four Meeting Daniel J. Kleitman
- Families of convex sets not representable by points Janos Pach # and Geza Toth +
- How many ways can one draw a graph? # Janos Pach 1 and Geza Toth 1
- Degenerate crossing numbers Janos Pach # and Geza Toth +
- Degenerate crossing numbers Janos Pach
- Contemporary Mathematics The discharging method in combinatorial geometry and the
- Relaxing planarity for topological graphs Janos Pach1
- Drawing Hamiltonian cycles with no large angles Adrian Dumitrescu
- A Ramsey-type problem on right-angled triangles in Mikl os B ona
- Three-dimensional grid drawings of graphs J anos Pach
- Unavoidable configurations in complete topological graphs Janos Pach #
- Geometric graphs with few disjoint edges G eza T oth
- Improving the Crossing Lemma by finding more crossings in sparse graphs
- Crossing number of toroidal graphs Janos Pach # and Geza Toth +
- Monochromatic empty triangles in twocolored point sets Janos Pach # and Geza Toth +
- Ramsey t pus u t etelek es feladatok T oth G eza
- A generalization of the Erd}os-Szekeres theorem to disjoint convex sets
- TOWARDS THE ALBERTSON CONJECTURE AT AND G EZA T
- Relaxing planarity for topological graphs # Janos Pach 1 , Rados Radoicic 2 , and Geza Toth 3
- Improvement on the decay of crossing numbers Jakub Cerny
- Which crossing number is it, anyway? J anos Pach
- Note on an Art Gallery Problem Gyorgy Csizmadia and G eza T oth
- Note on the paircrossing number and the oddcrossing number Geza Toth #
- Point sets with many k-sets G eza T oth
- Multiple coverings of the plane with triangles Gabor Tardos # Geza Toth +
- Cubic graphs have bounded slope parameter , D. Palvolgyi
- Ramsey{Type Results for Geometric Graphs. I Gyula K arolyi
- Cubic graphs have bounded slope parameter B. Keszegh # , J. Pach + , D. Palvolgyi # , and G. Toth
- Contemporary Mathematics A generalization of quasiplanarity
- Finding convex sets in convex position G eza T oth
- Decomposition of multiple coverings into many parts Janos Pach # and Geza Toth +
- Conflict-free colorings Janos Pach
- Erd}os-Szekeres-type theorems for segments and non-crossing convex sets
- TOWARDS THE ALBERTSON CONJECTURE JANOS BARAT AND GEZA TOTH
- Note on the chromatic number of the space Rados Radoicic
- Drawing Hamiltonian cycles with no large angles Adrian Dumitrescu # Janos Pach + Geza Toth #
