The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Géza Tóth: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Adrian Dumitrescu, Géza Tóth
    Ramsey-type results for unions of comparability graphs and convex sets inrestricted position. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  2. Gyula Károlyi, János Pach, Géza Tóth
    Ramsey-Type Results for Geometric Graphs. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:359-365 [Conf]
  3. Gyula Károlyi, János Pach, Géza Tóth, Pavel Valtr
    Ramsey-Type Results for Geometric Graphs II. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:94-103 [Conf]
  4. 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]. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:68-75 [Conf]
  5. János Pach, Joel Spencer, Géza Tóth
    New Bounds on Crossing Numbers. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:124-133 [Conf]
  6. János Pach, Géza Tóth
    Degenerate crossing numbers. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:255-258 [Conf]
  7. Rados Radoicic, Géza Tóth
    Monotone paths in line arrangement. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:312-314 [Conf]
  8. János Pach, Géza Tóth
    Decomposition of multiple coverings into many parts. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:133-137 [Conf]
  9. Géza Tóth
    Point sets with many k-sets. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:37-42 [Conf]
  10. Géza Tóth, Pavel Valtr
    Geometric Graphs with Few Disjoint Edges. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:184-191 [Conf]
  11. János Pach, Géza Tóth
    Which Crossing Number is it, Anyway? [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:617-627 [Conf]
  12. Jan Kyncl, János Pach, Géza Tóth
    Long Alternating Paths in Bicolored Point Sets. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:340-348 [Conf]
  13. János Pach, Rom Pinchasi, Gábor Tardos, Géza Tóth
    Geometric Graphs with No Self-intersecting Path of Length Three. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:295-311 [Conf]
  14. János Pach, Géza Tóth
    Unavoidable Configurations in Complete Topological Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2000, pp:328-337 [Conf]
  15. János Pach, Géza Tóth
    Recognizing String Graphs Is Decidable. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:247-260 [Conf]
  16. János Pach, Géza Tóth
    How Many Ways Can One Draw a Graph? [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:47-58 [Conf]
  17. János Pach, Géza Tóth
    Crossing Number of Toroidal Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:334-342 [Conf]
  18. János Pach, Géza Tóth
    Graphs Drawn with Few Crossings Per Edge. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1996, pp:345-354 [Conf]
  19. János Pach, Torsten Thiele, Géza Tóth
    Three-dimensional Grid Drawings of Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:47-51 [Conf]
  20. 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. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2006, pp:114-125 [Conf]
  21. János Pach, Géza Tóth
    Monotone Drawings of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:647-654 [Conf]
  22. János Pach, Rados Radoicic, Géza Tóth
    Relaxing Planarity for Topological Graphs. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:221-232 [Conf]
  23. János Pach, Géza Tóth
    Disjoint Edges in Topological Graphs. [Citation Graph (0, 0)][DBLP]
    IJCCGGT, 2003, pp:133-140 [Conf]
  24. Gábor Tardos, Géza Tóth
    Crossing Stars in Topological Graphs. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:184-197 [Conf]
  25. Daniel J. Kleitman, András Gyárfás, Géza Tóth
    Convex Sets in the Plane with Three of Every Four Meeting. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2001, v:21, n:2, pp:221-232 [Journal]
  26. János Pach, Géza Tóth
    Graphs Drawn with Few Crossings per Edge. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:3, pp:427-439 [Journal]
  27. Géza Tóth
    Finding Convex Sets in Convex Position. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2000, v:20, n:4, pp:589-596 [Journal]
  28. György Csizmadia, Géza Tóth
    ote on an art gallery problem. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:10, n:1, pp:47-55 [Journal]
  29. Géza Tóth
    The Shortest Distance Among Points in General Position. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:33-38 [Journal]
  30. Rados Radoicic, Géza Tóth
    Monotone paths in line arrangements. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:24, n:3, pp:129-134 [Journal]
  31. Gyula Károlyi, János Pach, Géza Tóth
    Ramsey-Type Results for Geometric Graphs, I. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1997, v:18, n:3, pp:247-255 [Journal]
  32. Gyula Károlyi, János Pach, Géza Tóth, Pavel Valtr
    Ramsey-Type Results for Geometric Graphs, II. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:20, n:3, pp:375-388 [Journal]
  33. János Pach, Joel Spencer, Géza Tóth
    New Bounds on Crossing Numbers. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:24, n:4, pp:623-644 [Journal]
  34. János Pach, József Solymosi, Géza Tóth
    Unavoidable Configurations in Complete Topological Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:30, n:2, pp:311-320 [Journal]
  35. János Pach, Géza Tóth
    Recognizing String Graphs Is Decidable. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:28, n:4, pp:593-606 [Journal]
  36. János Pach, Géza Tóth
    A Generalization of the Erdos - Szekeres Theorem to Disjoint Convex Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:3, pp:437-445 [Journal]
  37. Géza Tóth, Pavel Valtr
    Note on the Erdos - Szekeres Theorem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:3, pp:457-459 [Journal]
  38. Géza Tóth, Pavel Valtr
    Geometric Graphs with Few Disjoint Edges. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:22, n:4, pp:633-642 [Journal]
  39. János Pach, Rados Radoicic, Gábor Tardos, Géza Tóth
    Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:36, n:4, pp:527-552 [Journal]
  40. János Pach, Rom Pinchasi, Gábor Tardos, Géza Tóth
    Geometric graphs with no self-intersecting path of length three. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2004, v:25, n:6, pp:793-811 [Journal]
  41. Adrian Dumitrescu, Géza Tóth
    Ramsey-Type Results for Unions of Comparability Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2002, v:18, n:2, pp:245-251 [Journal]
  42. János Pach, Rom Pinchasi, Micha Sharir, Géza Tóth
    Topological Graphs with No Large Grids. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:3, pp:355-364 [Journal]
  43. Károly J. Börözky, János Pach, Géza Tóth
    Planar Crossing Numbers of Graphs Embeddable in Another Surface. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:5, pp:1005-1016 [Journal]
  44. György Csizmadia, Géza Tóth
    Note on a Ramsey-Type Problem in Geometry. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1994, v:65, n:2, pp:302-306 [Journal]
  45. János Pach, Géza Tóth
    Which Crossing Number Is It Anyway? [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:80, n:2, pp:225-246 [Journal]
  46. Géza Tóth
    Note on Geometric Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2000, v:89, n:1, pp:126-132 [Journal]
  47. Joel Spencer, Géza Tóth
    Crossing numbers of random graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:21, n:3-4, pp:347-358 [Journal]
  48. János Pach, Géza Tóth
    Monotone drawings of planar graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:46, n:1, pp:39-47 [Journal]
  49. Géza Tóth
    Note on the Pair-Crossing Number and the Odd-Crossing Number. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:3-6 [Conf]
  50. János Pach, Gábor Tardos, Géza Tóth
    Indecomposable Coverings. [Citation Graph (0, 0)][DBLP]
    CJCDGCGT, 2005, pp:135-148 [Conf]
  51. János Pach, Géza Tóth
    How Many Ways Can One Draw A Graph? [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2006, v:26, n:5, pp:559-576 [Journal]
  52. Miklós Bóna, Géza Tóth
    A Ramsey-type problem on right-angled triangles in space. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:61-67 [Journal]

  53. Graph Unique-Maximum and Conflict-Free Colorings. [Citation Graph (, )][DBLP]


  54. Drawing Hamiltonian Cycles with No Large Angles. [Citation Graph (, )][DBLP]


  55. Cubic Graphs Have Bounded Slope Parameter. [Citation Graph (, )][DBLP]


  56. Improvement on the Decay of Crossing Numbers. [Citation Graph (, )][DBLP]


  57. Drawing cubic graphs with at most five slopes. [Citation Graph (, )][DBLP]


  58. Decomposition of multiple coverings into many parts. [Citation Graph (, )][DBLP]


  59. Graph unique-maximum and conflict-free colorings [Citation Graph (, )][DBLP]


  60. Multiple Coverings of the Plane with Triangles. [Citation Graph (, )][DBLP]


  61. Note on the Pair-crossing Number and the Odd-crossing Number. [Citation Graph (, )][DBLP]


  62. Degenerate Crossing Numbers. [Citation Graph (, )][DBLP]


  63. Convex Polygons are Cover-Decomposable. [Citation Graph (, )][DBLP]


  64. Long alternating paths in bicolored point sets. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002