The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

János Pach: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hubert de Fraysseix, János Pach, Richard Pollack
    Small Sets Supporting Fáry Embeddings of Planar Graphs [Citation Graph (1, 0)][DBLP]
    STOC, 1988, pp:426-433 [Conf]
  2. Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman
    Crossing Families. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:351-356 [Conf]
  3. Sylvain E. Cappell, Jacob E. Goodman, János Pach, Richard Pollack, Micha Sharir, Rephael Wenger
    The Combinatorial Complexity of Hyperplane Transversals. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:83-91 [Conf]
  4. Adrian Dumitrescu, János Pach
    Pushing squares around. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:116-123 [Conf]
  5. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
    On Arrangements of Jordan Arcs with Three Intersections per Pair. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:258-265 [Conf]
  6. 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]
  7. 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]
  8. László Lovász, János Pach, Mario Szegedy
    On Conway's Thrackle Conjecture. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:147-151 [Conf]
  9. Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky
    Lenses in arrangements of pseudo-circles and their applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:123-132 [Conf]
  10. János Pach, Rom Pinchasi, Micha Sharir
    A tight bound for the number of different directions in three dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:106-113 [Conf]
  11. János Pach, Rom Pinchasi, Micha Sharir
    Solution of Scott's problem on the number of directions determined by a point set in 3-space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:76-85 [Conf]
  12. 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]
  13. János Pach, Ido Safruti, Micha Sharir
    The union of congruent cubes in three dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:19-28 [Conf]
  14. János Pach, Farhad Shahrokhi, Mario Szegedy
    Applications of the Crossing Number. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:198-202 [Conf]
  15. 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]
  16. János Pach, Gábor Tardos
    Cutting glass. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:360-369 [Conf]
  17. János Pach, Gábor Tardos
    Forbidden patterns and unit distances. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:1-9 [Conf]
  18. János Pach, Géza Tóth
    Degenerate crossing numbers. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:255-258 [Conf]
  19. János Pach, Jenö Töröcsik
    Some Geometric Applications of Dilworth's Theorem. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:264-269 [Conf]
  20. János Pach, Gerhard J. Woeginger
    Some New Bounds for Epsilon-Nets. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:10-15 [Conf]
  21. 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]
  22. Esther Ezra, János Pach, Micha Sharir
    On regular vertices on the union of planar objects. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:220-226 [Conf]
  23. Herbert Edelsbrunner, János Pach, Jacob T. Schwartz, Micha Sharir
    On the Lower Envelope of Bivariate Functions and its Applications [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:27-37 [Conf]
  24. Jirí Matousek, Nathaly Miller, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl
    Fat Triangles Determine Linearly Many Holes [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:49-58 [Conf]
  25. János Pach, William L. Steiger, Endre Szemerédi
    An Upper Bound on the Number of Planar k-Sets [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:72-79 [Conf]
  26. János Pach, Gábor Tardos
    On the boundary complexity of the union of fat triangles. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:423-431 [Conf]
  27. János Pach, Géza Tóth
    Which Crossing Number is it, Anyway? [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:617-627 [Conf]
  28. Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir
    Quasi-Planar Graphs Have a Linear Number of Edges. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1995, pp:1-7 [Conf]
  29. 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]
  30. 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]
  31. 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]
  32. János Pach, Gábor Tardos
    Untangling a Polygon. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:154-161 [Conf]
  33. János Pach, Géza Tóth
    Recognizing String Graphs Is Decidable. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:247-260 [Conf]
  34. 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]
  35. János Pach, Géza Tóth
    Crossing Number of Toroidal Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:334-342 [Conf]
  36. 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]
  37. 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]
  38. János Pach, Rephael Wenger
    Embedding Planar Graphs at Fixed Vertex Locations. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:263-274 [Conf]
  39. 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]
  40. Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir
    Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:214-229 [Conf]
  41. Tamal K. Dey, János Pach
    Extremal Problems for Geometric Hypergraphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1996, pp:105-114 [Conf]
  42. János Pach, Géza Tóth
    Monotone Drawings of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:647-654 [Conf]
  43. Sergey Bereg, Adrian Dumitrescu, János Pach
    Sliding Disks in the Plane. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:37-47 [Conf]
  44. János Pach
    On the Complexity of the Union of Geometric Objects. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2000, pp:292-307 [Conf]
  45. János Pach
    Crossing Numbers. [Citation Graph (0, 0)][DBLP]
    JCDCG, 1998, pp:267-273 [Conf]
  46. 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]
  47. János Pach, József Solymosi
    Structure Theorems for Systems of Segments. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2000, pp:308-317 [Conf]
  48. János Pach, Géza Tóth
    Disjoint Edges in Topological Graphs. [Citation Graph (0, 0)][DBLP]
    IJCCGGT, 2003, pp:133-140 [Conf]
  49. Gruia Calinescu, Adrian Dumitrescu, János Pach
    Reconfigurations in Graphs and Grids. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:262-273 [Conf]
  50. János Pach, Richard Pollack, Emo Welzl
    Weaving Patterns of Lines and Segments in Space. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:439-446 [Conf]
  51. Amos Fiat, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl
    Online conflict-free coloring for intervals. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:545-554 [Conf]
  52. Boris Aronov, János Pach, Micha Sharir, Gábor Tardos
    Distinct distances in three and higher dimensions. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:541-546 [Conf]
  53. Adrian Dumitrescu, János Pach
    Partitioning Colored Point Sets into Monochromatic Parts. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:264-275 [Conf]
  54. János Pach, Richard Pollack, Emo Welzl
    Weaving Patterns of Lines and Line Segments in Space. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:9, n:6, pp:561-571 [Journal]
  55. János Pach, Farhad Shahrokhi, Mario Szegedy
    Applications of the Crossing Number. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:1, pp:111-117 [Journal]
  56. Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir
    Quasi-Planar Graphs Have a Linear Number of Edges. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:1, pp:1-9 [Journal]
  57. Noga Alon, János Pach, József Solymosi
    Ramsey-type Theorems with Forbidden Subgraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2001, v:21, n:2, pp:155-170 [Journal]
  58. Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman
    Crossing Families. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1994, v:14, n:2, pp:127-134 [Journal]
  59. Paul Erdös, János Pach
    Variation on the theme of repeated distances. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:3, pp:261-269 [Journal]
  60. Peter Frankl, János Pach
    On disjointly representable sets. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:1, pp:39-45 [Journal]
  61. Hubert de Fraysseix, János Pach, Richard Pollack
    How to draw a planar graph on a grid. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:1, pp:41-51 [Journal]
  62. Péter Komjáth, János Pach
    The Complexity of a Class of Infinite Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1994, v:14, n:1, pp:121-125 [Journal]
  63. János Pach, Joel Spencer
    Uniformly Distributed Distances - a Geometric Application of Janson's Inequality. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1999, v:19, n:1, pp:111-124 [Journal]
  64. 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]
  65. Gábor Fejes Tóth, János Pach
    Special issue dedicated to discrete and computational geometry. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:2, pp:113-114 [Journal]
  66. David Avis, Paul Erdös, János Pach
    Distinct Distances Determined By Subsets of a Point Set in Space. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:1-11 [Journal]
  67. János Pach
    A Tverberg-type result on multicolored simplices. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:10, n:2, pp:71-76 [Journal]
  68. János Pach, Eduardo Rivera-Campo
    On circumscribing polygons for line segments. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:10, n:2, pp:121-124 [Journal]
  69. János Pach, Rados Radoicic, Jan Vondrák
    Nearly equal distances and Szemerédi's regularity lemma. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:34, n:1, pp:11-19 [Journal]
  70. Boris Aronov, János Pach, Micha Sharir, Gábor Tardos
    Distinct Distances in Three and Higher Dimensions. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2004, v:13, n:3, pp:283-293 [Journal]
  71. Imre Bárány, János Pach
    On the Number of Convex Lattice Polygons. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:295-302 [Journal]
  72. Paul Erdös, Endre Makai, János Pach
    Nearly Equal Distances in the Plane. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:401-408 [Journal]
  73. János Pach, Micha Sharir
    On the Number of Incidences Between Points and Curves. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:1, pp:121-127 [Journal]
  74. Ariel Halpert, Flórián Lengyel, János Pach
    Cellular telephone networks and random maps in hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:103, n:1-3, pp:111-126 [Journal]
  75. Boris Aronov, Daniel Q. Naiman, János Pach, Micha Sharir
    An Invariant Property of Balls in Arrangements of Hyperplanes. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:421-425 [Journal]
  76. Imre Bárány, János Pach
    Guest Editor's Forword. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:13, n:, pp:243-244 [Journal]
  77. Hervé Brönnimann, Bernard Chazelle, János Pach
    How Hard Is Half-Space Range Searching. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:143-155 [Journal]
  78. Tamal K. Dey, János Pach
    Extremal Problems for Geometric Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:4, pp:473-484 [Journal]
  79. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
    On Arrangement of Jordan Arcs with Three Intersection per Pair. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:523-539 [Journal]
  80. Hubert de Fraysseix, Patrice Ossona de Mendez, János Pach
    A Left-First Search Algorithm for Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:13, n:, pp:459-468 [Journal]
  81. 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]
  82. 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]
  83. Klara Kedem, Ron Livne, János Pach, Micha Sharir
    On the Union of Jordan Regions and Collision-Free Translational Motion Amidst Polygonal Obstacles. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1986, v:1, n:, pp:59-70 [Journal]
  84. János Komlós, János Pach, Gerhard J. Woeginger
    Almost Tight Bounds for epsilon-Nets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:7, n:, pp:163-173 [Journal]
  85. László Lovász, János Pach, Mario Szegedy
    On Conway's Thrackle Conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1997, v:18, n:4, pp:369-376 [Journal]
  86. I. G. Macdonald, János Pach, Thorsten Theobald
    Common Tangents to Four Unit Balls in R3. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:1, pp:1-17 [Journal]
  87. János Pach
    Covering the Plane with Convex Polygons. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1986, v:1, n:, pp:73-81 [Journal]
  88. János Pach
    Guest Editor's Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:3, pp:311-313 [Journal]
  89. János Pach, Rom Pinchasi
    On the Number of Balanced Lines. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:25, n:4, pp:611-628 [Journal]
  90. János Pach, Micha Sharir
    The Upper Envelope of Piecewise Linear Functions and the Boundary of a Region Enclosed by Convex Plates: Combinatorial Analysis. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:291-309 [Journal]
  91. János Pach, József Solymosi
    Canonical Theorems for Convex Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:3, pp:427-435 [Journal]
  92. János Pach, Micha Sharir
    On the Boundary of the Union of Planar Convex Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:21, n:3, pp:321-328 [Journal]
  93. János Pach, Ido Safruti, Micha Sharir
    The Union of Congruent Cubes in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:30, n:1, pp:133-160 [Journal]
  94. János Pach, William L. Steiger, Endre Szemerédi
    An Upper Bound on the Number of Planar K-Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:7, n:, pp:109-123 [Journal]
  95. 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]
  96. 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]
  97. János Pach, Gábor Tardos
    Cutting Glass. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:24, n:2-3, pp:481-496 [Journal]
  98. János Pach, Gábor Tardos
    Untangling a Polygon. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:28, n:4, pp:585-592 [Journal]
  99. 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]
  100. János Pach, Jenö Töröcsik
    Some Geometric Applications of Dilworth's Theorem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:12, n:, pp:1-7 [Journal]
  101. 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]
  102. 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]
  103. János Pach, Gábor Tardos
    Separating convex sets by straight lines. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:241, n:1-3, pp:427-433 [Journal]
  104. 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]
  105. János Pach, Micha Sharir
    Radial Points in the Plane. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2001, v:22, n:6, pp:855-863 [Journal]
  106. János Pach, Rados Radoicic, Jan Vondrák
    On the diameter of separated point sets with many nearly equal distances. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:8, pp:1321-1332 [Journal]
  107. Adrian Dumitrescu, János Pach
    Pushing Squares Around. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2006, v:22, n:1, pp:37-50 [Journal]
  108. 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]
  109. János Pach, Gábor Tardos
    Isosceles Triangles Determined by a Planar Point Set. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2002, v:18, n:4, pp:769-779 [Journal]
  110. János Pach, Rephael Wenger
    Embedding Planar Graphs at Fixed Vertex Locations. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:4, pp:717-728 [Journal]
  111. Adrian Dumitrescu, János Pach
    Partitioning Colored Point Sets into Monochromatic Parts. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:5, pp:401-412 [Journal]
  112. 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]
  113. Pankaj K. Agarwal, Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky
    Lenses in arrangements of pseudo-circles and their applications. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:2, pp:139-186 [Journal]
  114. Noga Alon, János Pach, Rom Pinchasi, Rados Radoicic, Micha Sharir
    Crossing patterns of semi-algebraic sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2005, v:111, n:2, pp:310-326 [Journal]
  115. Peter Braß, János Pach
    The Maximum Number of Times the Same Distance Can Occur among the Vertices of a Convex n-gon Is O(n log n). [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2001, v:94, n:1, pp:178-179 [Journal]
  116. Vasilis Capoyleas, János Pach
    A turán-type theorem on chords of a convex polygon. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:56, n:1, pp:9-15 [Journal]
  117. Paul Erdös, Ralph J. Faudree, János Pach, Joel H. Spencer
    How to make a graph bipartite. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:45, n:1, pp:86-98 [Journal]
  118. Paul Erdös, János Pach, Richard Pollack, Zsolt Tuza
    Radius, diameter, and minimum degree. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1989, v:47, n:1, pp:73-79 [Journal]
  119. János Pach, Rom Pinchasi
    Bichromatic Lines with Few Points. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2000, v:90, n:2, pp:326-335 [Journal]
  120. János Pach, Rom Pinchasi, Micha Sharir
    On the number of directions determined by a three-dimensional points set. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2004, v:108, n:1, pp:1-16 [Journal]
  121. János Pach, József Solymosi
    Crossing Patterns of Segments. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2001, v:96, n:2, pp:316-325 [Journal]
  122. János Pach, Micha Sharir
    Repeated Angles in the Plane and Related Problems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1992, v:59, n:1, pp:12-22 [Journal]
  123. 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]
  124. Jirí Matousek, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl
    Fat Triangles Determine Linearly Many Holes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:1, pp:154-169 [Journal]
  125. János Pach, Micha Sharir
    On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:3, pp:460-470 [Journal]
  126. János Pach, Gábor Tardos
    On the Boundary Complexity of the Union of Fat Triangles. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:6, pp:1745-1760 [Journal]
  127. Ke Chen, Amos Fiat, Haim Kaplan, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl
    Online Conflict-Free Coloring for Intervals. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:5, pp:1342-1359 [Journal]
  128. Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir
    Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:92, n:2, pp:319-336 [Journal]
  129. János Pach, Joel Spencer
    Explicit codes with low covering radius. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1281-1285 [Journal]
  130. 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]
  131. János Pach, Gábor Tardos, Géza Tóth
    Indecomposable Coverings. [Citation Graph (0, 0)][DBLP]
    CJCDGCGT, 2005, pp:135-148 [Conf]
  132. János Pach, Farhad Shahrokhi
    Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:47, n:4, pp:365- [Journal]
  133. 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]
  134. János Pach
    Graphs whose every independent set has a common neighbour. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:37, n:2-3, pp:217-228 [Journal]
  135. Károly Böröczky, Imre Bárány, Endre Makai, János Pach
    Maximal volume enclosed by plates and proof of the chessboard conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:60, n:, pp:101-120 [Journal]
  136. János Pach, Joel H. Spencer
    Note on vertex-partitions of infinite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:79, n:1, pp:107-108 [Journal]
  137. Paul Erdös, Gergely Harcos, János Pach
    Popular distances in 3-space. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:95-99 [Journal]
  138. Péter Komjáth, János Pach
    Universal elements and the complexity of certain classes of infinite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:95, n:1-3, pp:255-270 [Journal]
  139. Paul Erdös, Zoltán Füredi, János Pach, Imre Z. Ruzsa
    The grid revisted. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:189-196 [Journal]

  140. Coloring kk-free intersection graphs of geometric objects in the plane. [Citation Graph (, )][DBLP]


  141. Intersecting convex sets by rays. [Citation Graph (, )][DBLP]


  142. On grids in topological graphs. [Citation Graph (, )][DBLP]


  143. Tangencies between families of disjoint regions in the plane. [Citation Graph (, )][DBLP]


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


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


  146. Why Are String Graphs So Beautiful? [Citation Graph (, )][DBLP]


  147. A Bipartite Strengthening of the Crossing Lemma. [Citation Graph (, )][DBLP]


  148. Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles. [Citation Graph (, )][DBLP]


  149. Crossings between Curves with Many Tangencies. [Citation Graph (, )][DBLP]


  150. A Separator Theorem for String Graphs and Its Applications. [Citation Graph (, )][DBLP]


  151. Points surrounding the origin. [Citation Graph (, )][DBLP]


  152. Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers. [Citation Graph (, )][DBLP]


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


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


  155. Minimum clique partition in unit disk graphs [Citation Graph (, )][DBLP]


  156. Opaque sets [Citation Graph (, )][DBLP]


  157. Overlap properties of geometric expanders [Citation Graph (, )][DBLP]


  158. Conflict-Free Colourings of Graphs and Hypergraphs. [Citation Graph (, )][DBLP]


  159. Solution of Scott's Problem on the Number of Directions Determined by a Point Set in 3-Space. [Citation Graph (, )][DBLP]


  160. Foreword. [Citation Graph (, )][DBLP]


  161. Foreword. [Citation Graph (, )][DBLP]


  162. On Regular Vertices of the Union of Planar Convex Objects. [Citation Graph (, )][DBLP]


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


  164. Intersecting Convex Sets by Rays. [Citation Graph (, )][DBLP]


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


  166. Guest Editors' Foreword. [Citation Graph (, )][DBLP]


  167. A bipartite analogue of Dilworth's theorem for multiple partial orders. [Citation Graph (, )][DBLP]


Search in 0.049secs, Finished in 0.054secs
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