default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGéza Tóth 0001
Person information
- affiliation: Hungarian Academy of Sciences, Rényi Institute, Budapest, Hungary
Other persons with the same name
- Géza Tóth 0002
![[0000-0002-9233-1899]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-9233-1899")
— Hungarian Central Statistical Office, Dissemination Department, Hungary (and 1 more) - Géza Tóth 0003 — University of the Basque Country, Department of Theoretical Physics and History of Science, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j67]Jakob Führer, Géza Tóth:
Progressions in Euclidean Ramsey theory. Eur. J. Comb. 125: 104105 (2025)- 2024
- [j66]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: 222-226 (2024) - [j65]János Pach, Gábor Tardos, Géza Tóth:
Disjointness graphs of short polygonal chains. J. Comb. Theory B 164: 29-43 (2024) - [j64]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): 523-541 (2024) - [c40]Panna Gehér, Géza Tóth:
1-Planar Unit Distance Graphs. GD 2024: 6:1-6:9 - 2023
- [j63]János Barát, Géza Tóth:
Saturated 2-plane drawings with few edges. Ars Math. Contemp. 24(1): 1 (2023) - [j62]János Karl, Géza Tóth:
Crossing lemma for the odd-crossing number. Comput. Geom. 108: 101901 (2023) - [j61]Csaba Biró, Jeno Lehel, Géza Tóth:
Helly-Type Theorems for the Ordering of the Vertices of a Hypergraph. Order 40(3): 665-682 (2023) - [i6]Adrian Dumitrescu, János Pach, Géza Tóth:
Two trees are better than one. CoRR abs/2312.09916 (2023) - 2022
- [j60]János Barát, Géza Tóth:
Improvement on the Crossing Number of Crossing-Critical Graphs. Discret. Comput. Geom. 67(2): 595-604 (2022) - [j59]János Pach, Gábor Tardos, Géza Tóth:
Crossings between non-homotopic edges. J. Comb. Theory B 156: 389-404 (2022) - [c39]János Pach, Gábor Tardos, Géza Tóth:
Disjointness Graphs of Short Polygonal Chains. SoCG 2022: 56:1-56:12 - 2021
- [j58]János Pach, Gábor Tardos, Géza Tóth:
Disjointness graphs of segments in the space. Comb. Probab. Comput. 30(4): 498-512 (2021) - [j57]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): 383-396 (2021) - 2020
- [j56]János Pach, Géza Tóth:
A Crossing Lemma for Multigraphs. Discret. Comput. Geom. 63(4): 918-933 (2020) - [j55]István Kovács, Géza Tóth:
Dense Point Sets with Many Halving Lines. Discret. Comput. Geom. 64(3): 965-984 (2020) - [j54]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): 111956 (2020) - [c38]János Pach, Gábor Tardos, Géza Tóth:
Crossings Between Non-homotopic Edges. GD 2020: 359-371 - [c37]János Barát, Géza Tóth:
Improvement on the Crossing Number of Crossing-Critical Graphs. GD 2020: 372-381
2010 – 2019
- 2019
- [j53]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: 98-108 (2019) - [j52]János Pach, Géza Tóth:
Many touchings force many crossings. J. Comb. Theory B 137: 104-111 (2019) - 2018
- [j51]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: 2-6 (2018) - [j50]János Barát, Géza Tóth:
Improvements on the density of maximal 1-planar graphs. J. Graph Theory 88(1): 101-109 (2018) - [c36]János Pach, Géza Tóth:
A Crossing Lemma for Multigraphs. SoCG 2018: 65:1-65:13 - [c35]Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt:
The Number of Crossings in Multigraphs with No Empty Lens. GD 2018: 242-254 - [i5]Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt:
The number of crossings in multigraphs with no empty lens. CoRR abs/1808.10480 (2018) - 2017
- [c34]János Pach, Gábor Tardos, Géza Tóth:
Disjointness Graphs of Segments. SoCG 2017: 59:1-59:15 - [c33]János Pach, Géza Tóth:
Many Touchings Force Many Crossings. GD 2017: 153-159 - [i4]István Kovács, Géza Tóth:
Dense point sets with many halving lines. CoRR abs/1704.00229 (2017) - 2016
- [j49]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 A 144: 292-305 (2016) - 2015
- [j48]István Kovács, Géza Tóth:
Multiple Coverings with Closed Polygons. Electron. J. Comb. 22(1): 1 (2015) - [j47]Jan Kyncl, János Pach, Rados Radoicic, Géza Tóth:
Saturated simple and k-simple topological graphs. Comput. Geom. 48(4): 295-310 (2015) - [j46]Imre Bárány, Edgardo Roldán-Pensado, Géza Tóth:
Erdős-Szekeres Theorem for Lines. Discret. Comput. Geom. 54(3): 669-685 (2015) - 2014
- [j45]Eyal Ackerman, János Pach, Rom Pinchasi, Rados Radoicic, Géza Tóth:
A Note on Coloring Line Arrangements. Electron. J. Comb. 21(2): 2 (2014) - [i3]István Kovács, Géza Tóth:
Multiple coverings with closed polygons. CoRR abs/1403.2653 (2014) - 2013
- [j44]Dániel Gerbner, Géza Tóth:
Separating families of convex sets. Comput. Geom. 46(9): 1056-1058 (2013) - [j43]János Pach, Géza Tóth:
Monochromatic empty triangles in two-colored point sets. Discret. Appl. Math. 161(9): 1259-1261 (2013) - [j42]Jakub Cerný, Jan Kyncl, Géza Tóth:
Improvement on the Decay of Crossing Numbers. Graphs Comb. 29(3): 365-371 (2013) - 2012
- [j41]Adrian Dumitrescu, János Pach, Géza Tóth:
Drawing Hamiltonian Cycles with no Large Angles. Electron. J. Comb. 19(2): 31 (2012) - [j40]Gyula Károlyi, Géza Tóth:
Erdős-Szekeres Theorem for Point Sets with Forbidden Subconfigurations. Discret. Comput. Geom. 48(2): 441-452 (2012) - [i2]Jakub Cerný, Jan Kyncl, Géza Tóth:
Improvement on the decay of crossing numbers. CoRR abs/1201.5421 (2012) - 2011
- [j39]Panagiotis Cheilaris, Géza Tóth:
Graph unique-maximum and conflict-free colorings. J. Discrete Algorithms 9(3): 241-251 (2011) - [c32]János Pach, Géza Tóth:
Monotone Crossing Number. GD 2011: 278-289 - [c31]János Pach, Rados Radoicic, Géza Tóth:
Tangled Thrackles. EGC 2011: 45-53 - 2010
- [j38]János Barát, Géza Tóth:
Towards the Albertson Conjecture. Electron. J. Comb. 17(1) (2010) - [j37]Dömötör Pálvölgyi, Géza Tóth:
Convex Polygons are Cover-Decomposable. Discret. Comput. Geom. 43(3): 483-496 (2010) - [j36]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): 5-17 (2010) - [c30]Panagiotis Cheilaris, Géza Tóth:
Graph Unique-Maximum and Conflict-Free Colorings. CIAC 2010: 143-154
2000 – 2009
- 2009
- [j35]János Pach, Géza Tóth:
Decomposition of multiple coverings into many parts. Comput. Geom. 42(2): 127-133 (2009) - [j34]János Pach, Géza Tóth:
Degenerate Crossing Numbers. Discret. Comput. Geom. 41(3): 376-384 (2009) - [c29]Adrian Dumitrescu, János Pach, Géza Tóth:
Drawing Hamiltonian Cycles with No Large Angles. GD 2009: 3-14 - [i1]Panagiotis Cheilaris, Géza Tóth:
Graph unique-maximum and conflict-free colorings. CoRR abs/0912.3004 (2009) - 2008
- [j33]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) - [j32]Géza Tóth:
Note on the Pair-crossing Number and the Odd-crossing Number. Discret. Comput. Geom. 39(4): 791-799 (2008) - [j31]Jan Kyncl, János Pach, Géza Tóth:
Long alternating paths in bicolored point sets. Discret. Math. 308(19): 4315-4321 (2008) - [c28]Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth:
Cubic Graphs Have Bounded Slope Parameter. GD 2008: 50-60 - 2007
- [j30]Gábor Tardos, Géza Tóth:
Multiple Coverings of the Plane with Triangles. Discret. Comput. Geom. 38(2): 443-450 (2007) - [j29]Gábor Tardos, Géza Tóth:
Crossing Stars in Topological Graphs. SIAM J. Discret. Math. 21(3): 737-749 (2007) - [c27]Géza Tóth:
Note on the Pair-Crossing Number and the Odd-Crossing Number. CCCG 2007: 3-6 - [c26]János Pach, Géza Tóth:
Decomposition of multiple coverings into many parts. SCG 2007: 133-137 - [c25]Jakub Cerný, Jan Kyncl, Géza Tóth:
Improvement on the Decay of Crossing Numbers. GD 2007: 25-30 - 2006
- [j28]János Pach, Géza Tóth:
How Many Ways Can One Draw A Graph? Comb. 26(5): 559-576 (2006) - [j27]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): 527-552 (2006) - [j26]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): 1005-1016 (2006) - [c24]János Pach, Géza Tóth:
Degenerate crossing numbers. SCG 2006: 255-258 - [c23]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. GD 2006: 114-125 - 2005
- [j25]János Pach, Rom Pinchasi, Micha Sharir, Géza Tóth:
Topological Graphs with No Large Grids. Graphs Comb. 21(3): 355-364 (2005) - [c22]János Pach, Gábor Tardos, Géza Tóth:
Indecomposable Coverings. CJCDGCGT 2005: 135-148 - [c21]János Pach, Géza Tóth:
Crossing Number of Toroidal Graphs. GD 2005: 334-342 - 2004
- [j24]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) - [j23]János Pach, Géza Tóth:
Monotone drawings of planar graphs. J. Graph Theory 46(1): 39-47 (2004) - [c20]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: 68-75 - [c19]Jan Kyncl, János Pach, Géza Tóth:
Long Alternating Paths in Bicolored Point Sets. GD 2004: 340-348 - [c18]Gábor Tardos, Géza Tóth:
Crossing Stars in Topological Graphs. JCDCG 2004: 184-197 - 2003
- [j22]Rados Radoicic, Géza Tóth:
Monotone paths in line arrangements. Comput. Geom. 24(3): 129-134 (2003) - [j21]János Pach, József Solymosi, Géza Tóth:
Unavoidable Configurations in Complete Topological Graphs. Discret. Comput. Geom. 30(2): 311-320 (2003) - [c17]János Pach, Géza Tóth:
How Many Ways Can One Draw a Graph? GD 2003: 47-58 - [c16]János Pach, Géza Tóth:
Disjoint Edges in Topological Graphs. IJCCGGT 2003: 133-140 - 2002
- [j20]János Pach, Géza Tóth:
Recognizing String Graphs Is Decidable. Discret. Comput. Geom. 28(4): 593-606 (2002) - [j19]Adrian Dumitrescu, Géza Tóth:
Ramsey-Type Results for Unions of Comparability Graphs. Graphs Comb. 18(2): 245-251 (2002) - [j18]Joel Spencer, Géza Tóth:
Crossing numbers of random graphs. Random Struct. Algorithms 21(3-4): 347-358 (2002) - [c15]János Pach, Rom Pinchasi, Gábor Tardos, Géza Tóth:
Geometric Graphs with No Self-intersecting Path of Length Three. GD 2002: 295-311 - [c14]János Pach, Géza Tóth:
Monotone Drawings of Planar Graphs. ISAAC 2002: 647-654 - [c13]János Pach, Rados Radoicic, Géza Tóth:
Relaxing Planarity for Topological Graphs. JCDCG 2002: 221-232 - 2001
- [j17]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): 221-232 (2001) - [j16]Géza Tóth:
Point Sets with Many k-Sets. Discret. Comput. Geom. 26(2): 187-194 (2001) - [c12]Rados Radoicic, Géza Tóth:
Monotone paths in line arrangement. SCG 2001: 312-314 - [c11]János Pach, Géza Tóth:
Recognizing String Graphs Is Decidable. GD 2001: 247-260 - 2000
- [j15]Géza Tóth:
Finding Convex Sets in Convex Position. Comb. 20(4): 589-596 (2000) - [j14]János Pach, Joel Spencer, Géza Tóth:
New Bounds on Crossing Numbers. Discret. Comput. Geom. 24(4): 623-644 (2000) - [j13]János Pach, Géza Tóth:
Which Crossing Number Is It Anyway? J. Comb. Theory B 80(2): 225-246 (2000) - [j12]Géza Tóth:
Note on Geometric Graphs. J. Comb. Theory A 89(1): 126-132 (2000) - [c10]Géza Tóth:
Point sets with many k-sets. SCG 2000: 37-42 - [c9]János Pach, Géza Tóth:
Unavoidable Configurations in Complete Topological Graphs. GD 2000: 328-337
1990 – 1999
- 1999
- [j11]Géza Tóth, Pavel Valtr:
Geometric Graphs with Few Disjoint Edges. Discret. Comput. Geom. 22(4): 633-642 (1999) - [c8]Adrian Dumitrescu, Géza Tóth:
Ramsey-type results for unions of comparability graphs and convex sets inrestricted position. CCCG 1999 - [c7]János Pach, Joel Spencer, Géza Tóth:
New Bounds on Crossing Numbers. SCG 1999: 124-133 - 1998
- [j10]György Csizmadia, Géza Tóth:
ote on an art gallery problem. Comput. Geom. 10(1): 47-55 (1998) - [j9]János Pach, Géza Tóth:
A Generalization of the Erdos - Szekeres Theorem to Disjoint Convex Sets. Discret. Comput. Geom. 19(3): 437-445 (1998) - [j8]Géza Tóth, Pavel Valtr:
Note on the Erdos - Szekeres Theorem. Discret. Comput. Geom. 19(3): 457-459 (1998) - [j7]Gyula Károlyi, János Pach, Géza Tóth, Pavel Valtr:
Ramsey-Type Results for Geometric Graphs, II. Discret. Comput. Geom. 20(3): 375-388 (1998) - [c6]Géza Tóth, Pavel Valtr:
Geometric Graphs with Few Disjoint Edges. SCG 1998: 184-191 - [c5]János Pach, Géza Tóth:
Which Crossing Number is it, Anyway? FOCS 1998: 617-627 - 1997
- [j6]János Pach, Géza Tóth:
Graphs Drawn with Few Crossings per Edge. Comb. 17(3): 427-439 (1997) - [j5]Géza Tóth:
The Shortest Distance Among Points in General Position. Comput. Geom. 8: 33-38 (1997) - [j4]Gyula Károlyi, János Pach, Géza Tóth:
Ramsey-Type Results for Geometric Graphs, I. Discret. Comput. Geom. 18(3): 247-255 (1997) - [c4]Gyula Károlyi, János Pach, Géza Tóth, Pavel Valtr:
Ramsey-Type Results for Geometric Graphs II. SCG 1997: 94-103 - [c3]János Pach, Torsten Thiele, Géza Tóth:
Three-dimensional Grid Drawings of Graphs. GD 1997: 47-51 - 1996
- [j3]Miklós Bóna, Géza Tóth:
A Ramsey-type problem on right-angled triangles in space. Discret. Math. 150(1-3): 61-67 (1996) - [j2]Géza Tóth:
A ramsey-type bound for rectangles. J. Graph Theory 23(1): 53-56 (1996) - [c2]Gyula Károlyi, János Pach, Géza Tóth:
Ramsey-Type Results for Geometric Graphs. SCG 1996: 359-365 - [c1]János Pach, Géza Tóth:
Graphs Drawn with Few Crossings Per Edge. GD 1996: 345-354 - 1994
- [j1]György Csizmadia, Géza Tóth:
Note on a Ramsey-Type Problem in Geometry. J. Comb. Theory A 65(2): 302-306 (1994)
Coauthor Index
[j65] [i6] [j59] [c39] [j58] [j57] [j56] [c38] [j52] [j51] [c36] [c35] [i5] [c34] [c33] [j49] [j47] [j45] [j43] [j41] [c32] [c31] [j36] [j35] [j34] [c29] [j33] [j31] [c28] [c26] [j28] [j27] [j26] [c24] [c23] [j25] [c22] [c21] [j24] [j23] [c20] [c19] [j21] [c17] [c16] [j20] [c15] [c14] [c13] [c11] [j14] [j13] [c9] [c7] [j9] [j7] [c5] [j6] [j4] [c4] [c3] [c2] [c1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
