Géza Tóth
Géza Tóth
Renyi Institute and Technical University, Budapest
E-mail confirmado em renyi.mta.hu
Título
Citado por
Citado por
Ano
Graphs drawn with few crossings per edge
J Pach, G Tóth
Combinatorica 17 (3), 427-439, 1997
3091997
Which crossing number is it, anyway?[computational geometry]
J Pach, G Tóth
Foundations of Computer Science, 1998. Proceedings. 39th Annual Symposium on …, 1998
163*1998
Point sets with many k-sets
G Tóth
Discrete & Computational Geometry 26 (2), 187-194, 2001
1302001
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
1252006
The Erdos-Szekeres theorem: upper bounds and related results
G Tóth, P Valtr
Combinatorial and computational geometry 19, 557-568, 2005
1002005
Note on the Erdos-Szekeres theorem
G Tóth, P Valtr
Discrete & Computational Geometry 19 (3), 457-459, 1998
911998
Thirteen problems on crossing numbers
J Pach, G Tóth
Geombinatorics 9 (4), 194-207, 2000
852000
Ramsey-type results for geometric graphs, I
G Karolyi, J Pach, G Toth
Discrete & Computational Geometry 18 (3), 247-255, 1997
811997
Conflict-free colorings
J Pach, G Tóth
ALGORITHMS AND COMBINATORICS 25, 665-672, 2003
762003
Three-dimensional grid drawings of graphs
J Pach, T Thiele, G Toth
Contemporary Mathematics 223, 251-256, 1998
691998
New bounds on crossing numbers
J Pach, J Spencer, G Tóth
Discrete & Computational Geometry 24 (4), 623-644, 2000
682000
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
571997
Note on geometric graphs
G Tóth
Journal of combinatorial theory. Series A 89 (1), 126-132, 2000
542000
Three-dimensional grid drawings of graphs
J Pach, T Thiele, G Toth
Graph Drawing, 47-51, 1997
521997
Decomposition of multiple coverings into many parts
J Pach, G Tóth
Computational Geometry 42 (2), 127-133, 2009
492009
Monotone drawings of planar graphs
J Pach, G Tóth
Journal of Graph Theory 46 (1), 39-47, 2004
482004
Recognizing string graphs is decidable
J Pach, G Tóth
Graph Drawing, 479-482, 2002
482002
Relaxing planarity for topological graphs
J Pach, R Radoičić, G Tóth
Discrete and computational geometry, 221-232, 2003
462003
Indecomposable coverings
J Pach, G Tardos, G Tóth
Discrete Geometry, Combinatorics and Graph Theory, 135-148, 2007
402007
Convex sets in the plane with three of every four meeting
DJ Kleitman, A Gyárfás, G Tóth
Combinatorica 21 (2), 221-232, 2001
392001
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20