Note on a Ramsey-Type Problem in Geometry. - György Csizmadia; Géza Tóth 001 (J. Comb. Theory A, 1994)

Ramsey-Type Results for Geometric Graphs. - Gyula Károlyi; János Pach; Géza Tóth 001 (SCG, 1996)

Graphs Drawn with Few Crossings Per Edge. - János Pach; Géza Tóth 001 (GD, 1996)

A Ramsey-type problem on right-angled triangles in space. - Miklós Bóna; Géza Tóth 001 (Discret. Math., 1996)

A ramsey-type bound for rectangles. - Géza Tóth 001 (J. Graph Theory, 1996)

Ramsey-Type Results for Geometric Graphs II. - Gyula Károlyi; János Pach; Géza Tóth 001; Pavel Valtr 001 (SCG, 1997)

Three-dimensional Grid Drawings of Graphs. - János Pach; Torsten Thiele; Géza Tóth 001 (GD, 1997)

The Shortest Distance Among Points in General Position. - Géza Tóth 001 (Comput. Geom., 1997)

Ramsey-Type Results for Geometric Graphs, I. - Gyula Károlyi; János Pach; Géza Tóth 001 (Discret. Comput. Geom., 1997)

Geometric Graphs with Few Disjoint Edges. - Géza Tóth 001; Pavel Valtr 001 (SCG, 1998)

Which Crossing Number is it, Anyway? - János Pach; Géza Tóth 001 (FOCS, 1998)

ote on an art gallery problem. - György Csizmadia; Géza Tóth 001 (Comput. Geom., 1998)

A Generalization of the Erdos - Szekeres Theorem to Disjoint Convex Sets. - János Pach; Géza Tóth 001 (Discret. Comput. Geom., 1998)

Note on the Erdos - Szekeres Theorem. - Géza Tóth 001; Pavel Valtr 001 (Discret. Comput. Geom., 1998)

Ramsey-type results for unions of comparability graphs and convex sets inrestricted position. - Adrian Dumitrescu; Géza Tóth 001 (CCCG, 1999)

New Bounds on Crossing Numbers. - János Pach; Joel Spencer; Géza Tóth 001 (SCG, 1999)

Point sets with many k-sets. - Géza Tóth 001 (SCG, 2000)

Unavoidable Configurations in Complete Topological Graphs. - János Pach; Géza Tóth 001 (GD, 2000)

Finding Convex Sets in Convex Position. - Géza Tóth 001 (Comb., 2000)

Note on Geometric Graphs. - Géza Tóth 001 (J. Comb. Theory A, 2000)

Monotone paths in line arrangement. - Rados Radoicic; Géza Tóth 001 (SCG, 2001)

Recognizing String Graphs Is Decidable. - János Pach; Géza Tóth 001 (GD, 2001)

Convex Sets in the Plane with Three of Every Four Meeting. - Daniel J. Kleitman; András Gyárfás; Géza Tóth 001 (Comb., 2001)

Geometric Graphs with No Self-intersecting Path of Length Three. - János Pach; Rom Pinchasi; Gábor Tardos; Géza Tóth 001 (GD, 2002)

Monotone Drawings of Planar Graphs. - János Pach; Géza Tóth 001 (ISAAC, 2002)

Relaxing Planarity for Topological Graphs. - János Pach; Rados Radoicic; Géza Tóth 001 (JCDCG, 2002)

Ramsey-Type Results for Unions of Comparability Graphs. - Adrian Dumitrescu; Géza Tóth 001 (Graphs Comb., 2002)

Crossing numbers of random graphs. - Joel Spencer; Géza Tóth 001 (Random Struct. Algorithms, 2002)

How Many Ways Can One Draw a Graph? - János Pach; Géza Tóth 001 (GD, 2003)

Disjoint Edges in Topological Graphs. - János Pach; Géza Tóth 001 (IJCCGGT, 2003)

Monotone paths in line arrangements. - Rados Radoicic; Géza Tóth 001 (Comput. Geom., 2003)

Unavoidable Configurations in Complete Topological Graphs. - János Pach; József Solymosi; Géza Tóth 001 (Discret. Comput. Geom., 2003)

Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract]. - János Pach; Rados Radoicic; Gábor Tardos; Géza Tóth 001 (SCG, 2004)

Long Alternating Paths in Bicolored Point Sets. - Jan Kyncl; János Pach; Géza Tóth 001 (GD, 2004)

Crossing Stars in Topological Graphs. - Gábor Tardos; Géza Tóth 001 (JCDCG, 2004)

Indecomposable Coverings. - János Pach; Gábor Tardos; Géza Tóth 001 (CJCDGCGT, 2005)

Crossing Number of Toroidal Graphs. - János Pach; Géza Tóth 001 (GD, 2005)

Topological Graphs with No Large Grids. - János Pach; Rom Pinchasi; Micha Sharir; Géza Tóth 001 (Graphs Comb., 2005)

Degenerate crossing numbers. - János Pach; Géza Tóth 001 (SCG, 2006)

Drawing Cubic Graphs with at Most Five Slopes. - Balázs Keszegh; János Pach; Dömötör Pálvölgyi; Géza Tóth 001 (GD, 2006)

Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs. - János Pach; Rados Radoicic; Gábor Tardos; Géza Tóth 001 (Discret. Comput. Geom., 2006)

Planar Crossing Numbers of Graphs Embeddable in Another Surface. - Károly J. Böröczky; János Pach; Géza Tóth 001 (Int. J. Found. Comput. Sci., 2006)

Note on the Pair-Crossing Number and the Odd-Crossing Number. - Géza Tóth 001 (CCCG, 2007)

Decomposition of multiple coverings into many parts. - János Pach; Géza Tóth 001 (SCG, 2007)

Improvement on the Decay of Crossing Numbers. - Jakub Cerný; Jan Kyncl; Géza Tóth 001 (GD, 2007)

Multiple Coverings of the Plane with Triangles. - Gábor Tardos; Géza Tóth 001 (Discret. Comput. Geom., 2007)

Cubic Graphs Have Bounded Slope Parameter. - Balázs Keszegh; János Pach; Dömötör Pálvölgyi; Géza Tóth 001 (GD, 2008)

Drawing Hamiltonian Cycles with No Large Angles. - Adrian Dumitrescu; János Pach; Géza Tóth 001 (GD, 2009)

Graph Unique-Maximum and Conflict-Free Colorings. - Panagiotis Cheilaris; Géza Tóth 001 (CIAC, 2010)

Towards the Albertson Conjecture. - János Barát; Géza Tóth 001 (Electron. J. Comb., 2010)

Convex Polygons are Cover-Decomposable. - Dömötör Pálvölgyi; Géza Tóth 001 (Discret. Comput. Geom., 2010)

Monotone Crossing Number. - János Pach; Géza Tóth 001 (GD, 2011)

Tangled Thrackles. - János Pach; Rados Radoicic; Géza Tóth 001 (EGC, 2011)

Erdős-Szekeres Theorem for Point Sets with Forbidden Subconfigurations. - Gyula Károlyi; Géza Tóth 001 (Discret. Comput. Geom., 2012)

Separating families of convex sets. - Dániel Gerbner; Géza Tóth 001 (Comput. Geom., 2013)

Monochromatic empty triangles in two-colored point sets. - János Pach; Géza Tóth 001 (Discret. Appl. Math., 2013)

A Note on Coloring Line Arrangements. - Eyal Ackerman; János Pach; Rom Pinchasi; Rados Radoicic; Géza Tóth 001 (Electron. J. Comb., 2014)

Multiple Coverings with Closed Polygons. - István Kovács; Géza Tóth 001 (Electron. J. Comb., 2015)

Saturated simple and k-simple topological graphs. - Jan Kyncl; János Pach; Rados Radoicic; Géza Tóth 001 (Comput. Geom., 2015)

Erdős-Szekeres Theorem for Lines. - Imre Bárány; Edgardo Roldán-Pensado; Géza Tóth 001 (Discret. Comput. Geom., 2015)

Separation with restricted families of sets. - Zsolt Lángi; Márton Naszódi; János Pach; Gábor Tardos; Géza Tóth 001 (J. Comb. Theory A, 2016)

Disjointness Graphs of Segments. - János Pach; Gábor Tardos; Géza Tóth 001 (SoCG, 2017)

Many Touchings Force Many Crossings. - János Pach; Géza Tóth 001 (GD, 2017)

A Crossing Lemma for Multigraphs. - János Pach; Géza Tóth 001 (SoCG, 2018)

The Number of Crossings in Multigraphs with No Empty Lens. - Michael Kaufmann 001; János Pach; Géza Tóth 001; Torsten Ueckerdt (GD, 2018)

Note on k-planar crossing numbers. - János Pach; László A. Székely; Csaba D. Tóth; Géza Tóth 001 (Comput. Geom., 2018)

Improvements on the density of maximal 1-planar graphs. - János Barát; Géza Tóth 001 (J. Graph Theory, 2018)

An algorithm to find maximum area polygons circumscribed about a convex polygon. - Markus Ausserhofer; Susanna Dann; Zsolt Lángi; Géza Tóth 001 (Discret. Appl. Math., 2019)

Improvement on the Crossing Number of Crossing-Critical Graphs. - János Barát; Géza Tóth 001 (GD, 2020)

Crossings Between Non-homotopic Edges. - János Pach; Gábor Tardos; Géza Tóth 001 (GD, 2020)

Dense Point Sets with Many Halving Lines. - István Kovács; Géza Tóth 001 (Discret. Comput. Geom., 2020)

Petruska's question on planar convex sets. - Adam S. Jobson; André E. Kézdy; Jeno Lehel; Timothy J. Pervenecki; Géza Tóth 001 (Discret. Math., 2020)

Disjointness graphs of segments in the space. - János Pach; Gábor Tardos; Géza Tóth 001 (Comb. Probab. Comput., 2021)

Disjointness Graphs of Short Polygonal Chains. - János Pach; Gábor Tardos; Géza Tóth 001 (SoCG, 2022)

Saturated 2-plane drawings with few edges. - János Barát; Géza Tóth 001 (Ars Math. Contemp., 2023)

Crossing lemma for the odd-crossing number. - János Karl; Géza Tóth 001 (Comput. Geom., 2023)

Helly-Type Theorems for the Ordering of the Vertices of a Hypergraph. - Csaba Biró; Jeno Lehel; Géza Tóth 001 (Order, 2023)

1-Planar Unit Distance Graphs. - Panna Gehér; Géza Tóth 001 (GD, 2024)

Corrigendum to "An algorithm to find maximum area polygons circumscribed about a convex polygon" [Discrete Appl. Math. 255 (2019) 98-108]. - Markus Ausserhofer; Susanna Dann; Zsolt Lángi; Géza Tóth 001 (Discret. Appl. Math., 2024)

Monochromatic spanning trees and matchings in ordered complete graphs. - János Barát; András Gyárfás; Géza Tóth 001 (J. Graph Theory, 2024)

Progressions in Euclidean Ramsey theory. - Jakob Führer; Géza Tóth 001 (Eur. J. Comb., 2025)

Two Trees Are Better than One. - Adrian Dumitrescu; János Pach; Géza Tóth 001 (SIAM J. Discret. Math., 2025)

Peeling Sequences. - Adrian Dumitrescu; Géza Tóth 001 (Discret. Comput. Geom., 2025)

Monochromatic Infinite Sets in Minkowski Planes. - Nóra Frankl; Panna Gehér; Arsenii Sagdeev; Géza Tóth 001 (Discret. Comput. Geom., 2025)