Géza Tóth

	2009
62		János Pach, Géza Tóth: Decomposition of multiple coverings into many parts. Comput. Geom. 42(2): 127-133 (2009)
61		János Pach, Géza Tóth: Degenerate Crossing Numbers. Discrete & Computational Geometry 41(3): 376-384 (2009)
	2008
60		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
59		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)
58		Géza Tóth: QUBIT4MATLAB V3.0: A program package for quantum information science and quantum optics for MATLAB. Computer Physics Communications 179(6): 430-437 (2008)
57		Géza Tóth: Note on the Pair-crossing Number and the Odd-crossing Number. Discrete & Computational Geometry 39(4): 791-799 (2008)
56		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		Jakub Cerný, Jan Kyncl, Géza Tóth: Improvement on the Decay of Crossing Numbers. Graph Drawing 2007: 25-30
53		János Pach, Géza Tóth: Decomposition of multiple coverings into many parts. Symposium on Computational Geometry 2007: 133-137
52		Gábor Tardos, Géza Tóth: Multiple Coverings of the Plane with Triangles. Discrete & Computational Geometry 38(2): 443-450 (2007)
51		Gábor Tardos, Géza Tóth: Crossing Stars in Topological Graphs. SIAM J. Discrete Math. 21(3): 737-749 (2007)
	2006
50		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		János Pach, Géza Tóth: Degenerate crossing numbers. Symposium on Computational Geometry 2006: 255-258
48		János Pach, Géza Tóth: How Many Ways Can One Draw A Graph? Combinatorica 26(5): 559-576 (2006)
47		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		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		János Pach, Gábor Tardos, Géza Tóth: Indecomposable Coverings. CJCDGCGT 2005: 135-148
44		János Pach, Géza Tóth: Crossing Number of Toroidal Graphs. Graph Drawing 2005: 334-342
43		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		Jan Kyncl, János Pach, Géza Tóth: Long Alternating Paths in Bicolored Point Sets. Graph Drawing 2004: 340-348
41		Gábor Tardos, Géza Tóth: Crossing Stars in Topological Graphs. JCDCG 2004: 184-197
40		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		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		János Pach, Géza Tóth: Monotone drawings of planar graphs. Journal of Graph Theory 46(1): 39-47 (2004)
	2003
37		János Pach, Géza Tóth: How Many Ways Can One Draw a Graph? Graph Drawing 2003: 47-58
36		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		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		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		János Pach, Géza Tóth: Monotone Drawings of Planar Graphs. ISAAC 2002: 647-654
31		János Pach, Rados Radoicic, Géza Tóth: Relaxing Planarity for Topological Graphs. JCDCG 2002: 221-232
30		János Pach, Géza Tóth: Recognizing String Graphs Is Decidable. Discrete & Computational Geometry 28(4): 593-606 (2002)
29		Adrian Dumitrescu, Géza Tóth: Ramsey-Type Results for Unions of Comparability Graphs. Graphs and Combinatorics 18(2): 245-251 (2002)
28		Joel Spencer, Géza Tóth: Crossing numbers of random graphs. Random Struct. Algorithms 21(3-4): 347-358 (2002)
	2001
27		János Pach, Géza Tóth: Recognizing String Graphs Is Decidable. Graph Drawing 2001: 247-260
26		Rados Radoicic, Géza Tóth: Monotone paths in line arrangement. Symposium on Computational Geometry 2001: 312-314
25		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		János Pach, Géza Tóth: Unavoidable Configurations in Complete Topological Graphs. Graph Drawing 2000: 328-337
23		Géza Tóth: Point sets with many k-sets. Symposium on Computational Geometry 2000: 37-42
22		Géza Tóth: Finding Convex Sets in Convex Position. Combinatorica 20(4): 589-596 (2000)
21		János Pach, Joel Spencer, Géza Tóth: New Bounds on Crossing Numbers. Discrete & Computational Geometry 24(4): 623-644 (2000)
20		Géza Tóth: Note on Geometric Graphs. J. Comb. Theory, Ser. A 89(1): 126-132 (2000)
19		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		Adrian Dumitrescu, Géza Tóth: Ramsey-type results for unions of comparability graphs and convex sets inrestricted position. CCCG 1999
17		János Pach, Joel Spencer, Géza Tóth: New Bounds on Crossing Numbers. Symposium on Computational Geometry 1999: 124-133
16		Géza Tóth, Pavel Valtr: Geometric Graphs with Few Disjoint Edges. Discrete & Computational Geometry 22(4): 633-642 (1999)
	1998
15		János Pach, Géza Tóth: Which Crossing Number is it, Anyway? FOCS 1998: 617-627
14		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		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		Géza Tóth, Pavel Valtr: Note on the Erdos - Szekeres Theorem. Discrete & Computational Geometry 19(3): 457-459 (1998)
10		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		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		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		Gyula Károlyi, János Pach, Géza Tóth: Ramsey-Type Results for Geometric Graphs. Symposium on Computational Geometry 1996: 359-365
2		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)

Coauthor Index

1	Miklós Bóna	[2]
2	Károly J. Börözky	[46]
3	Jakub Cerný	[54]
4	György Csizmadia	[1] [13]
5	Adrian Dumitrescu	[18] [29]
6	András Gyárfás	[25]
7	Gyula Károlyi	[3] [5] [8] [10]
8	Balázs Keszegh	[50] [59] [60]
9	Daniel J. Kleitman	[25]
10	Jan Kyncl	[42] [54] [56]
11	János Pach	[3] [4] [5] [7] [8] [9] [10] [12] [15] [17] [19] [21] [24] [27] [30] [31] [32] [33] [34] [36] [37] [38] [39] [40] [42] [43] [44] [45] [46] [47] [48] [49] [50] [53] [56] [59] [60] [61] [62]
12	Dömötör Pálvölgyi	[50] [59] [60]
13	Rom Pinchasi	[33] [39] [43]
14	Rados Radoicic	[26] [31] [35] [40] [47]
15	Micha Sharir	[43]
16	József Solymosi	[34]
17	Joel H. Spencer (Joel Spencer)	[17] [21] [28]
18	Gábor Tardos	[33] [39] [40] [41] [45] [47] [51] [52]
19	Torsten Thiele	[9]
20	Pavel Valtr	[8] [10] [11] [14] [16]

Colors in the list of coauthors