Géza Tóth

ORCID

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 28

Top Venues

CoRR

Discret. Comput. Geom.

Graph Drawing

SoCG

Publications

János Pach, Gábor Tardos, Géza Tóth
Disjointness graphs of short polygonal chains. J. Comb. Theory, Ser. B 164 (2024)
János Barát, András Gyárfás, Géza Tóth
Monochromatic spanning trees and matchings in ordered complete graphs. J. Graph Theory 105 (4) (2024)
Markus Ausserhofer, Susanna Dann, Zsolt Lángi, Géza Tóth
Corrigendum to "An algorithm to find maximum area polygons circumscribed about a convex polygon" [Discrete Appl. Math. 255 (2019) 98-108]. Discret. Appl. Math. 353 (2024)
Adrian Dumitrescu, János Pach, Géza Tóth
Two trees are better than one. CoRR (2023)
Csaba Biró, Jeno Lehel, Géza Tóth
Helly-Type Theorems for the Ordering of the Vertices of a Hypergraph. Order 40 (3) (2023)
János Barát, Géza Tóth
Saturated 2-plane drawings with few edges. Ars Math. Contemp. 24 (1) (2023)
János Karl, Géza Tóth
Crossing lemma for the odd-crossing number. Comput. Geom. 108 (2023)
János Pach, Gábor Tardos, Géza Tóth
Crossings between non-homotopic edges. J. Comb. Theory, Ser. B 156 (2022)
János Pach, Gábor Tardos, Géza Tóth
Disjointness Graphs of Short Polygonal Chains. SoCG (2022)
János Barát, Géza Tóth
Improvement on the Crossing Number of Crossing-Critical Graphs. Discret. Comput. Geom. 67 (2) (2022)
János Pach, Gábor Tardos, Géza Tóth
Disjointness graphs of segments in the space. Comb. Probab. Comput. 30 (4) (2021)
Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt
The number of crossings in multigraphs with no empty lens. J. Graph Algorithms Appl. 25 (1) (2021)
István Kovács, Géza Tóth
Dense Point Sets with Many Halving Lines. Discret. Comput. Geom. 64 (3) (2020)
János Barát, Géza Tóth
Improvement on the Crossing Number of Crossing-Critical Graphs. Graph Drawing (2020)
János Pach, Géza Tóth
A Crossing Lemma for Multigraphs. Discret. Comput. Geom. 63 (4) (2020)
János Pach, Gábor Tardos, Géza Tóth
Crossings Between Non-homotopic Edges. Graph Drawing (2020)
Adam S. Jobson, André E. Kézdy, Jeno Lehel, Timothy J. Pervenecki, Géza Tóth
Petruska's question on planar convex sets. Discret. Math. 343 (9) (2020)
János Pach, Géza Tóth
Many touchings force many crossings. J. Comb. Theory, Ser. B 137 (2019)
Markus Ausserhofer, Susanna Dann, Zsolt Lángi, Géza Tóth
An algorithm to find maximum area polygons circumscribed about a convex polygon. Discret. Appl. Math. 255 (2019)
Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt
The number of crossings in multigraphs with no empty lens. CoRR (2018)
János Pach, László A. Székely, Csaba D. Tóth, Géza Tóth
Note on k-planar crossing numbers. Comput. Geom. 68 (2018)
János Pach, Géza Tóth
A Crossing Lemma for Multigraphs. SoCG (2018)
Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt
The Number of Crossings in Multigraphs with No Empty Lens. Graph Drawing (2018)
János Barát, Géza Tóth
Improvements on the density of maximal 1-planar graphs. J. Graph Theory 88 (1) (2018)
János Pach, Gábor Tardos, Géza Tóth
Disjointness Graphs of Segments. SoCG (2017)
István Kovács, Géza Tóth
Dense point sets with many halving lines. CoRR (2017)
János Pach, Géza Tóth
Many Touchings Force Many Crossings. Graph Drawing (2017)
Zsolt Lángi, Márton Naszódi, János Pach, Gábor Tardos, Géza Tóth
Separation with restricted families of sets. J. Comb. Theory, Ser. A 144 (2016)
István Kovács, Géza Tóth
Multiple Coverings with Closed Polygons. Electron. J. Comb. 22 (1) (2015)
Jan Kyncl, János Pach, Rados Radoicic, Géza Tóth
Saturated simple and k-simple topological graphs. Comput. Geom. 48 (4) (2015)
Imre Bárány, Edgardo Roldán-Pensado, Géza Tóth
Erdős-Szekeres Theorem for Lines. Discret. Comput. Geom. 54 (3) (2015)
István Kovács, Géza Tóth
Multiple coverings with closed polygons. CoRR (2014)
Eyal Ackerman, János Pach, Rom Pinchasi, Rados Radoicic, Géza Tóth
A Note on Coloring Line Arrangements. Electron. J. Comb. 21 (2) (2014)
János Pach, Géza Tóth
Monochromatic empty triangles in two-colored point sets. Discret. Appl. Math. 161 (9) (2013)
Dániel Gerbner, Géza Tóth
Separating families of convex sets. Comput. Geom. 46 (9) (2013)
Jakub Cerný, Jan Kyncl, Géza Tóth
Improvement on the Decay of Crossing Numbers. Graphs Comb. 29 (3) (2013)
Adrian Dumitrescu, János Pach, Géza Tóth
Drawing Hamiltonian Cycles with no Large Angles. Electron. J. Comb. 19 (2) (2012)
Jakub Cerný, Jan Kyncl, Géza Tóth
Improvement on the decay of crossing numbers CoRR (2012)
Gyula Károlyi, Géza Tóth
Erdős-Szekeres Theorem for Point Sets with Forbidden Subconfigurations. Discret. Comput. Geom. 48 (2) (2012)
Panagiotis Cheilaris, Géza Tóth
Graph unique-maximum and conflict-free colorings. J. Discrete Algorithms 9 (3) (2011)
János Pach, Géza Tóth
Monotone Crossing Number. Graph Drawing (2011)
János Pach, Rados Radoicic, Géza Tóth
Tangled Thrackles. EGC (2011)
Panagiotis Cheilaris, Géza Tóth
Graph Unique-Maximum and Conflict-Free Colorings. CIAC (2010)
Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth
Cubic graphs have bounded slope parameter. J. Graph Algorithms Appl. 14 (1) (2010)
János Barát, Géza Tóth
Towards the Albertson Conjecture. Electron. J. Comb. 17 (1) (2010)
Dömötör Pálvölgyi, Géza Tóth
Convex Polygons are Cover-Decomposable. Discret. Comput. Geom. 43 (3) (2010)
János Pach, Géza Tóth
Decomposition of multiple coverings into many parts. Comput. Geom. 42 (2) (2009)
Panagiotis Cheilaris, Géza Tóth
Graph unique-maximum and conflict-free colorings CoRR (2009)
Adrian Dumitrescu, János Pach, Géza Tóth
Drawing Hamiltonian Cycles with No Large Angles. Graph Drawing (2009)
János Pach, Géza Tóth
Degenerate Crossing Numbers. Discret. Comput. Geom. 41 (3) (2009)
Géza Tóth
Note on the Pair-crossing Number and the Odd-crossing Number. Discret. Comput. Geom. 39 (4) (2008)
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) (2008)
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)
Jan Kyncl, János Pach, Géza Tóth
Long alternating paths in bicolored point sets. Discret. Math. 308 (19) (2008)
Gábor Tardos, Géza Tóth
Crossing Stars in Topological Graphs. SIAM J. Discret. Math. 21 (3) (2007)
János Pach, Géza Tóth
Decomposition of multiple coverings into many parts. SCG (2007)
Jakub Cerný, Jan Kyncl, Géza Tóth
Improvement on the Decay of Crossing Numbers. Graph Drawing (2007)
Gábor Tardos, Géza Tóth
Multiple Coverings of the Plane with Triangles. Discret. Comput. Geom. 38 (2) (2007)
Géza Tóth
Note on the Pair-Crossing Number and the Odd-Crossing Number. CCCG (2007)
János Pach, Géza Tóth
How Many Ways Can One Draw A Graph? Comb. 26 (5) (2006)
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)
Károly J. Böröczky, János Pach, Géza Tóth
Planar Crossing Numbers of Graphs Embeddable in Another Surface. Int. J. Found. Comput. Sci. 17 (5) (2006)
János Pach, Rados Radoicic, Gábor Tardos, Géza Tóth
Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs. Discret. Comput. Geom. 36 (4) (2006)
János Pach, Géza Tóth
Degenerate crossing numbers. SCG (2006)
János Pach, Rom Pinchasi, Micha Sharir, Géza Tóth
Topological Graphs with No Large Grids. Graphs Comb. 21 (3) (2005)
János Pach, Gábor Tardos, Géza Tóth
Indecomposable Coverings. CJCDGCGT (2005)
János Pach, Géza Tóth
Crossing Number of Toroidal Graphs. Graph Drawing (2005)
Jan Kyncl, János Pach, Géza Tóth
Long Alternating Paths in Bicolored Point Sets. Graph Drawing (2004)
János Pach, Géza Tóth
Monotone drawings of planar graphs. J. Graph Theory 46 (1) (2004)
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) (2004)
Gábor Tardos, Géza Tóth
Crossing Stars in Topological Graphs. JCDCG (2004)
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]. SCG (2004)
János Pach, Géza Tóth
How Many Ways Can One Draw a Graph? Graph Drawing (2003)
János Pach, Géza Tóth
Disjoint Edges in Topological Graphs. IJCCGGT (2003)
János Pach, József Solymosi, Géza Tóth
Unavoidable Configurations in Complete Topological Graphs. Discret. Comput. Geom. 30 (2) (2003)
Rados Radoicic, Géza Tóth
Monotone paths in line arrangements. Comput. Geom. 24 (3) (2003)
János Pach, Géza Tóth
Recognizing String Graphs Is Decidable. Discret. Comput. Geom. 28 (4) (2002)
Joel Spencer, Géza Tóth
Crossing numbers of random graphs. Random Struct. Algorithms 21 (3-4) (2002)
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)
Adrian Dumitrescu, Géza Tóth
Ramsey-Type Results for Unions of Comparability Graphs. Graphs Comb. 18 (2) (2002)
János Pach, Rados Radoicic, Géza Tóth
Relaxing Planarity for Topological Graphs. JCDCG (2002)
János Pach, Géza Tóth
Monotone Drawings of Planar Graphs. ISAAC (2002)
János Pach, Géza Tóth
Recognizing String Graphs Is Decidable. Graph Drawing (2001)
Rados Radoicic, Géza Tóth
Monotone paths in line arrangement. SCG (2001)
Géza Tóth
-Sets. Discret. Comput. Geom. 26 (2) (2001)
Daniel J. Kleitman, András Gyárfás, Géza Tóth
Convex Sets in the Plane with Three of Every Four Meeting. Comb. 21 (2) (2001)
Géza Tóth
Finding Convex Sets in Convex Position. Comb. 20 (4) (2000)
János Pach, Géza Tóth
Unavoidable Configurations in Complete Topological Graphs. Graph Drawing (2000)
János Pach, Joel Spencer, Géza Tóth
New Bounds on Crossing Numbers. Discret. Comput. Geom. 24 (4) (2000)
Géza Tóth
Note on Geometric Graphs. J. Comb. Theory, Ser. A 89 (1) (2000)
János Pach, Géza Tóth
Which Crossing Number Is It Anyway? J. Comb. Theory, Ser. B 80 (2) (2000)
Géza Tóth
-sets. SCG (2000)
Géza Tóth, Pavel Valtr
Geometric Graphs with Few Disjoint Edges. Discret. Comput. Geom. 22 (4) (1999)
Adrian Dumitrescu, Géza Tóth
Ramsey-type results for unions of comparability graphs and convex sets inrestricted position. CCCG (1999)
János Pach, Joel Spencer, Géza Tóth
New Bounds on Crossing Numbers. SCG (1999)
György Csizmadia, Géza Tóth
ote on an art gallery problem. Comput. Geom. 10 (1) (1998)
Géza Tóth, Pavel Valtr
Note on the Erdos - Szekeres Theorem. Discret. Comput. Geom. 19 (3) (1998)
János Pach, Géza Tóth
A Generalization of the Erdos - Szekeres Theorem to Disjoint Convex Sets. Discret. Comput. Geom. 19 (3) (1998)
János Pach, Géza Tóth
Which Crossing Number is it, Anyway? FOCS (1998)
Gyula Károlyi, János Pach, Géza Tóth, Pavel Valtr
Ramsey-Type Results for Geometric Graphs, II. Discret. Comput. Geom. 20 (3) (1998)

Géza Tóth.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Géza Tóth