Gézá Tóth

1.7k total citations
74 papers, 615 citations indexed

About

Gézá Tóth is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Gézá Tóth has authored 74 papers receiving a total of 615 indexed citations (citations by other indexed papers that have themselves been cited), including 54 papers in Computer Graphics and Computer-Aided Design, 37 papers in Computational Theory and Mathematics and 22 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Gézá Tóth's work include Computational Geometry and Mesh Generation (54 papers), Advanced Graph Theory Research (29 papers) and Limits and Structures in Graph Theory (19 papers). Gézá Tóth is often cited by papers focused on Computational Geometry and Mesh Generation (54 papers), Advanced Graph Theory Research (29 papers) and Limits and Structures in Graph Theory (19 papers). Gézá Tóth collaborates with scholars based in Hungary, United States and Switzerland. Gézá Tóth's co-authors include János Pach, Gábor Tardos, Gyula Károlyi, Pável Valtr, Radoš Radoičić, Dömötör Pálvölgyi, György Károlyi, András Gyárfás, Joel Spencer and J. Spencer and has published in prestigious journals such as Computers & Mathematics with Applications, Mathematische Annalen and Discrete Applied Mathematics.

In The Last Decade

Gézá Tóth

67 papers receiving 563 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Gézá Tóth Hungary	15	459	331	154	113	111	74	615
Pável Valtr Czechia	13	321 0.7×	244 0.7×	165 1.1×	98 0.9×	98 0.9×	74	509
Shakhar Smorodinsky Israel	15	447 1.0×	374 1.1×	139 0.9×	80 0.7×	74 0.7×	53	626
János Pach Hungary	6	197 0.4×	180 0.5×	91 0.6×	54 0.5×	30 0.3×	15	365
R. Bruce Richter Canada	17	371 0.8×	550 1.7×	125 0.8×	210 1.9×	18 0.2×	82	771
M. Sharir United States	11	366 0.8×	153 0.5×	194 1.3×	14 0.1×	51 0.5×	13	477
Hubert de Fraysseix France	10	381 0.8×	256 0.8×	180 1.2×	62 0.5×	9 0.1×	18	520
Vida Dujmović Canada	14	291 0.6×	370 1.1×	147 1.0×	76 0.7×	8 0.1×	82	594
Michel Pocchiola France	11	300 0.7×	116 0.4×	180 1.2×	51 0.5×	21 0.2×	21	422
F. Hurtado Spain	10	228 0.5×	140 0.4×	73 0.5×	53 0.5×	14 0.1×	29	322
Hannes Krasser Austria	11	273 0.6×	167 0.5×	105 0.7×	52 0.5×	27 0.2×	28	313

Countries citing papers authored by Gézá Tóth

Since Specialization

Citations

This map shows the geographic impact of Gézá Tóth's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Gézá Tóth with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Gézá Tóth more than expected).

Fields of papers citing papers by Gézá Tóth

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Gézá Tóth. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Gézá Tóth. The network helps show where Gézá Tóth may publish in the future.

Co-authorship network of co-authors of Gézá Tóth

This figure shows the co-authorship network connecting the top 25 collaborators of Gézá Tóth. A scholar is included among the top collaborators of Gézá Tóth based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Gézá Tóth. Gézá Tóth is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Tóth, Gézá, et al.. (2024). Monochromatic Infinite Sets in Minkowski Planes. Discrete & Computational Geometry. 74(2). 569–583.

Dumitrescu, Adrian & Gézá Tóth. (2024). Peeling Sequences. Discrete & Computational Geometry. 73(3). 837–849. 1 indexed citations

Barát, János, András Gyárfás, & Gézá Tóth. (2023). Monochromatic spanning trees and matchings in ordered complete graphs. Journal of Graph Theory. 105(4). 523–541. 2 indexed citations

Barát, János & Gézá Tóth. (2018). Improvements on the density of maximal 1-planar graphs. ELTE Digital Institutional Repository (EDIT) (Eötvös Loránd University). 4 indexed citations

Pach, János, Łászló A. Székely, Csaba D. Tóth, & Gézá Tóth. (2017). Note on k-planar crossing numbers. Computational Geometry. 68. 2–6. 2 indexed citations

Gerbner, Dániel & Gézá Tóth. (2013). Separating families of convex sets. Computational Geometry. 46(9). 1056–1058.

Pach, János & Gézá Tóth. (2011). Monochromatic empty triangles in two-colored point sets. Discrete Applied Mathematics. 161(9). 1259–1261. 7 indexed citations

Tóth, Gézá, et al.. (2011). Graph unique-maximum and conflict-free colorings. Journal of Discrete Algorithms. 9(3). 241–251. 20 indexed citations

Dumitrescu, Adrian, János Pach, & Gézá Tóth. (2009). A note on blocking visibility between points. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 19(1). 67–73. 5 indexed citations

10.

Keszegh, Balázs, János Pach, Dömötör Pálvölgyi, & Gézá Tóth. (2007). Drawing cubic graphs with at most five slopes. Computational Geometry. 40(2). 138–147. 10 indexed citations

11.

Kynčl, Jan, János Pach, & Gézá Tóth. (2007). Long alternating paths in bicolored point sets. Discrete Mathematics. 308(19). 4315–4321. 8 indexed citations

12.

Pach, János & Gézá Tóth. (2007). Decomposition of multiple coverings into many parts. 133–133. 9 indexed citations

13.

Pach, János, Rom Pinchasi, Gábor Tardos, & Gézá Tóth. (2004). Geometric graphs with no self-intersecting path of length three. European Journal of Combinatorics. 25(6). 793–811. 5 indexed citations

14.

Pach, János, Radoš Radoičić, Gábor Tardos, & Gézá Tóth. (2004). Improving the crossing lemma by finding more crossings in sparse graphs. 12. 68–75. 7 indexed citations

15.

Kleitman, Daniel J., András Gyárfás, & Gézá Tóth. (2001). Convex Sets in the Plane with Three of Every Four Meeting. COMBINATORICA. 21(2). 221–232. 17 indexed citations

16.

Pach, János & Gézá Tóth. (2000). Thirteen problems on crossing numbers. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 9(4). 194–207. 35 indexed citations

17.

Pach, János & Gézá Tóth. (2000). Which Crossing Number Is It Anyway?. Journal of Combinatorial Theory Series B. 80(2). 225–246. 6 indexed citations

18.

Tóth, Gézá. (2000). Finding Convex Sets in Convex Position. COMBINATORICA. 20(4). 589–596. 3 indexed citations

19.

Bóna, Miklós & Gézá Tóth. (1996). A Ramsey-type problem on right-angled triangles in space. Discrete Mathematics. 150(1-3). 61–67. 2 indexed citations

20.

Tóth, Gézá, et al.. (1994). Note on a Ramsey-type problem in geometry. Journal of Combinatorial Theory Series A. 65(2). 302–306. 5 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact