Géza Tóth
Géza Tóth
Renyi Institute and Technical University, Budapest
Verified email at renyi.mta.hu
Title
Cited by
Cited by
Year
Graphs drawn with few crossings per edge
J Pach, G Tóth
Combinatorica 17 (3), 427-439, 1997
3411997
Which crossing number is it, anyway?[computational geometry]
J Pach, G Tóth
Foundations of Computer Science, 1998. Proceedings. 39th Annual Symposium on …, 1998
165*1998
Point sets with many k-sets
G Tóth
Discrete & Computational Geometry 26 (2), 187-194, 2001
1432001
Improving the crossing lemma by finding more crossings in sparse graphs
J Pach, R Radoicic, G Tardos, G Tóth
Discrete & Computational Geometry 36 (4), 527-552, 2006
1412006
The Erdos-Szekeres theorem: upper bounds and related results
G Tóth, P Valtr
Combinatorial and computational geometry 19, 557-568, 2005
1012005
Note on the Erdos-Szekeres theorem
G Tóth, P Valtr
Discrete & Computational Geometry 19 (3), 457-459, 1998
951998
Thirteen problems on crossing numbers
J Pach, G Tóth
Geombinatorics 9 (4), 194-207, 2000
912000
Ramsey-type results for geometric graphs, I
G Karolyi, J Pach, G Toth
Discrete & Computational Geometry 18 (3), 247-255, 1997
851997
Conflict-free colorings
J Pach, G Tóth
ALGORITHMS AND COMBINATORICS 25, 665-672, 2003
772003
New bounds on crossing numbers
J Pach, J Spencer, G Tóth
Discrete & Computational Geometry 24 (4), 623-644, 2000
732000
Three-dimensional grid drawings of graphs
J Pach, T Thiele, G Toth
Contemporary Mathematics 223, 251-256, 1998
711998
Note on geometric graphs
G Tóth
Journal of combinatorial theory. Series A 89 (1), 126-132, 2000
562000
Ramsey-type results for geometric graphs. II
G Károlyi, J Pach, G Tóth, P Valtr
Proceedings of the thirteenth annual symposium on Computational geometry, 94-103, 1997
551997
Recognizing string graphs is decidable
J Pach, G Tóth
Graph Drawing, 479-482, 2002
532002
Three-dimensional grid drawings of graphs
J Pach, T Thiele, G Toth
Graph Drawing, 47-51, 1997
531997
Monotone drawings of planar graphs
J Pach, G Tóth
Journal of Graph Theory 46 (1), 39-47, 2004
502004
Decomposition of multiple coverings into many parts
J Pach, G Tóth
Computational Geometry 42 (2), 127-133, 2009
492009
Relaxing planarity for topological graphs
J Pach, R Radoičić, G Tóth
Discrete and computational geometry, 221-232, 2003
472003
Indecomposable coverings
J Pach, G Tardos, G Tóth
Discrete Geometry, Combinatorics and Graph Theory, 135-148, 2007
412007
Topological graphs with no large grids
J Pach, R Pinchasi, M Sharir, G Tóth
Graphs and Combinatorics 21 (3), 355-364, 2005
402005
The system can't perform the operation now. Try again later.
Articles 1–20