| 2009 |
|---|
| 60 | EE | János Pach,
Géza Tóth:
Decomposition of multiple coverings into many parts.
Comput. Geom. 42(2): 127-133 (2009) |
| 2008 |
|---|
| 59 | EE | Balázs Keszegh,
János Pach,
Dömötör Pálvölgyi,
Géza Tóth:
Cubic Graphs Have Bounded Slope Parameter.
Graph Drawing 2008: 50-60 |
| 58 | EE | Balázs Keszegh,
János Pach,
Dömötör Pálvölgyi,
Géza Tóth:
Drawing cubic graphs with at most five slopes.
Comput. Geom. 40(2): 138-147 (2008) |
| 57 | EE | Géza Tóth:
Note on the Pair-crossing Number and the Odd-crossing Number.
Discrete & Computational Geometry 39(4): 791-799 (2008) |
| 56 | EE | Jan Kyncl,
János Pach,
Géza Tóth:
Long alternating paths in bicolored point sets.
Discrete Mathematics 308(19): 4315-4321 (2008) |
| 2007 |
|---|
| 55 | | Géza Tóth:
Note on the Pair-Crossing Number and the Odd-Crossing Number.
CCCG 2007: 3-6 |
| 54 | EE | Jakub Cerný,
Jan Kyncl,
Géza Tóth:
Improvement on the Decay of Crossing Numbers.
Graph Drawing 2007: 25-30 |
| 53 | EE | János Pach,
Géza Tóth:
Decomposition of multiple coverings into many parts.
Symposium on Computational Geometry 2007: 133-137 |
| 52 | EE | Gábor Tardos,
Géza Tóth:
Multiple Coverings of the Plane with Triangles.
Discrete & Computational Geometry 38(2): 443-450 (2007) |
| 51 | EE | Gábor Tardos,
Géza Tóth:
Crossing Stars in Topological Graphs.
SIAM J. Discrete Math. 21(3): 737-749 (2007) |
| 2006 |
|---|
| 50 | EE | Balázs Keszegh,
János Pach,
Dömötör Pálvölgyi,
Géza Tóth:
Drawing Cubic Graphs with at Most Five Slopes.
Graph Drawing 2006: 114-125 |
| 49 | EE | János Pach,
Géza Tóth:
Degenerate crossing numbers.
Symposium on Computational Geometry 2006: 255-258 |
| 48 | EE | János Pach,
Géza Tóth:
How Many Ways Can One Draw A Graph?
Combinatorica 26(5): 559-576 (2006) |
| 47 | EE | János Pach,
Rados Radoicic,
Gábor Tardos,
Géza Tóth:
Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs.
Discrete & Computational Geometry 36(4): 527-552 (2006) |
| 46 | EE | Károly J. Börözky,
János Pach,
Géza Tóth:
Planar Crossing Numbers of Graphs Embeddable in Another Surface.
Int. J. Found. Comput. Sci. 17(5): 1005-1016 (2006) |
| 2005 |
|---|
| 45 | EE | János Pach,
Gábor Tardos,
Géza Tóth:
Indecomposable Coverings.
CJCDGCGT 2005: 135-148 |
| 44 | EE | János Pach,
Géza Tóth:
Crossing Number of Toroidal Graphs.
Graph Drawing 2005: 334-342 |
| 43 | EE | János Pach,
Rom Pinchasi,
Micha Sharir,
Géza Tóth:
Topological Graphs with No Large Grids.
Graphs and Combinatorics 21(3): 355-364 (2005) |
| 2004 |
|---|
| 42 | EE | Jan Kyncl,
János Pach,
Géza Tóth:
Long Alternating Paths in Bicolored Point Sets.
Graph Drawing 2004: 340-348 |
| 41 | EE | Gábor Tardos,
Géza Tóth:
Crossing Stars in Topological Graphs.
JCDCG 2004: 184-197 |
| 40 | EE | János Pach,
Rados Radoicic,
Gábor Tardos,
Géza Tóth:
Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract].
Symposium on Computational Geometry 2004: 68-75 |
| 39 | EE | János Pach,
Rom Pinchasi,
Gábor Tardos,
Géza Tóth:
Geometric graphs with no self-intersecting path of length three.
Eur. J. Comb. 25(6): 793-811 (2004) |
| 38 | EE | János Pach,
Géza Tóth:
Monotone drawings of planar graphs.
Journal of Graph Theory 46(1): 39-47 (2004) |
| 2003 |
|---|
| 37 | EE | János Pach,
Géza Tóth:
How Many Ways Can One Draw a Graph?
Graph Drawing 2003: 47-58 |
| 36 | EE | János Pach,
Géza Tóth:
Disjoint Edges in Topological Graphs.
IJCCGGT 2003: 133-140 |
| 35 | | Rados Radoicic,
Géza Tóth:
Monotone paths in line arrangements.
Comput. Geom. 24(3): 129-134 (2003) |
| 34 | EE | János Pach,
József Solymosi,
Géza Tóth:
Unavoidable Configurations in Complete Topological Graphs.
Discrete & Computational Geometry 30(2): 311-320 (2003) |
| 2002 |
|---|
| 33 | EE | János Pach,
Rom Pinchasi,
Gábor Tardos,
Géza Tóth:
Geometric Graphs with No Self-intersecting Path of Length Three.
Graph Drawing 2002: 295-311 |
| 32 | EE | János Pach,
Géza Tóth:
Monotone Drawings of Planar Graphs.
ISAAC 2002: 647-654 |
| 31 | EE | János Pach,
Rados Radoicic,
Géza Tóth:
Relaxing Planarity for Topological Graphs.
JCDCG 2002: 221-232 |
| 30 | EE | János Pach,
Géza Tóth:
Recognizing String Graphs Is Decidable.
Discrete & Computational Geometry 28(4): 593-606 (2002) |
| 29 | EE | Adrian Dumitrescu,
Géza Tóth:
Ramsey-Type Results for Unions of Comparability Graphs.
Graphs and Combinatorics 18(2): 245-251 (2002) |
| 28 | EE | Joel Spencer,
Géza Tóth:
Crossing numbers of random graphs.
Random Struct. Algorithms 21(3-4): 347-358 (2002) |
| 2001 |
|---|
| 27 | EE | János Pach,
Géza Tóth:
Recognizing String Graphs Is Decidable.
Graph Drawing 2001: 247-260 |
| 26 | EE | Rados Radoicic,
Géza Tóth:
Monotone paths in line arrangement.
Symposium on Computational Geometry 2001: 312-314 |
| 25 | EE | Daniel J. Kleitman,
András Gyárfás,
Géza Tóth:
Convex Sets in the Plane with Three of Every Four Meeting.
Combinatorica 21(2): 221-232 (2001) |
| 2000 |
|---|
| 24 | EE | János Pach,
Géza Tóth:
Unavoidable Configurations in Complete Topological Graphs.
Graph Drawing 2000: 328-337 |
| 23 | EE | Géza Tóth:
Point sets with many k-sets.
Symposium on Computational Geometry 2000: 37-42 |
| 22 | EE | Géza Tóth:
Finding Convex Sets in Convex Position.
Combinatorica 20(4): 589-596 (2000) |
| 21 | EE | János Pach,
Joel Spencer,
Géza Tóth:
New Bounds on Crossing Numbers.
Discrete & Computational Geometry 24(4): 623-644 (2000) |
| 20 | EE | Géza Tóth:
Note on Geometric Graphs.
J. Comb. Theory, Ser. A 89(1): 126-132 (2000) |
| 19 | EE | János Pach,
Géza Tóth:
Which Crossing Number Is It Anyway?
J. Comb. Theory, Ser. B 80(2): 225-246 (2000) |
| 1999 |
|---|
| 18 | EE | Adrian Dumitrescu,
Géza Tóth:
Ramsey-type results for unions of comparability graphs and convex sets inrestricted position.
CCCG 1999 |
| 17 | EE | János Pach,
Joel Spencer,
Géza Tóth:
New Bounds on Crossing Numbers.
Symposium on Computational Geometry 1999: 124-133 |
| 16 | EE | Géza Tóth,
Pavel Valtr:
Geometric Graphs with Few Disjoint Edges.
Discrete & Computational Geometry 22(4): 633-642 (1999) |
| 1998 |
|---|
| 15 | EE | János Pach,
Géza Tóth:
Which Crossing Number is it, Anyway?
FOCS 1998: 617-627 |
| 14 | EE | Géza Tóth,
Pavel Valtr:
Geometric Graphs with Few Disjoint Edges.
Symposium on Computational Geometry 1998: 184-191 |
| 13 | | György Csizmadia,
Géza Tóth:
ote on an art gallery problem.
Comput. Geom. 10(1): 47-55 (1998) |
| 12 | EE | János Pach,
Géza Tóth:
A Generalization of the Erdos - Szekeres Theorem to Disjoint Convex Sets.
Discrete & Computational Geometry 19(3): 437-445 (1998) |
| 11 | EE | Géza Tóth,
Pavel Valtr:
Note on the Erdos - Szekeres Theorem.
Discrete & Computational Geometry 19(3): 457-459 (1998) |
| 10 | EE | Gyula Károlyi,
János Pach,
Géza Tóth,
Pavel Valtr:
Ramsey-Type Results for Geometric Graphs, II.
Discrete & Computational Geometry 20(3): 375-388 (1998) |
| 1997 |
|---|
| 9 | | János Pach,
Torsten Thiele,
Géza Tóth:
Three-dimensional Grid Drawings of Graphs.
Graph Drawing 1997: 47-51 |
| 8 | EE | Gyula Károlyi,
János Pach,
Géza Tóth,
Pavel Valtr:
Ramsey-Type Results for Geometric Graphs II.
Symposium on Computational Geometry 1997: 94-103 |
| 7 | | János Pach,
Géza Tóth:
Graphs Drawn with Few Crossings per Edge.
Combinatorica 17(3): 427-439 (1997) |
| 6 | | Géza Tóth:
The Shortest Distance Among Points in General Position.
Comput. Geom. 8: 33-38 (1997) |
| 5 | EE | Gyula Károlyi,
János Pach,
Géza Tóth:
Ramsey-Type Results for Geometric Graphs, I.
Discrete & Computational Geometry 18(3): 247-255 (1997) |
| 1996 |
|---|
| 4 | | János Pach,
Géza Tóth:
Graphs Drawn with Few Crossings Per Edge.
Graph Drawing 1996: 345-354 |
| 3 | EE | Gyula Károlyi,
János Pach,
Géza Tóth:
Ramsey-Type Results for Geometric Graphs.
Symposium on Computational Geometry 1996: 359-365 |
| 2 | EE | Miklós Bóna,
Géza Tóth:
A Ramsey-type problem on right-angled triangles in space.
Discrete Mathematics 150(1-3): 61-67 (1996) |
| 1994 |
|---|
| 1 | | György Csizmadia,
Géza Tóth:
Note on a Ramsey-Type Problem in Geometry.
J. Comb. Theory, Ser. A 65(2): 302-306 (1994) |
