 | 2009 |
|---|
| 163 |       | Eyal Ackerman,
Jacob Fox,
János Pach,
Andrew Suk:
On grids in topological graphs.
Symposium on Computational Geometry 2009: 403-412 |
| 162 | | Jacob Fox,
János Pach:
A Separator Theorem for String Graphs and Its Applications.
WALCOM 2009: 1-14 |
| 161 | | Adrian Dumitrescu,
János Pach:
Minimum clique partition in unit disk graphs
CoRR abs/0909.1552: (2009) |
| 160 | | János Pach,
Géza Tóth:
Decomposition of multiple coverings into many parts.
Comput. Geom. 42(2): 127-133 (2009) |
| 159 | | Esther Ezra,
János Pach,
Micha Sharir:
On Regular Vertices of the Union of Planar Convex Objects.
Discrete & Computational Geometry 41(2): 216-231 (2009) |
| 158 | | János Pach,
Géza Tóth:
Degenerate Crossing Numbers.
Discrete & Computational Geometry 41(3): 376-384 (2009) |
| 157 | | Xiaomin Chen,
János Pach,
Mario Szegedy,
Gábor Tardos:
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles.
Random Struct. Algorithms 34(1): 11-23 (2009) |
| 2008 |
|---|
| 156 | | Balázs Keszegh,
János Pach,
Dömötör Pálvölgyi,
Géza Tóth:
Cubic Graphs Have Bounded Slope Parameter.
Graph Drawing 2008: 50-60 |
| 155 | | Xiaomin Chen,
János Pach,
Mario Szegedy,
Gábor Tardos:
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles.
SODA 2008: 94-101 |
| 154 | | Jacob Fox,
János Pach:
Coloring kk-free intersection graphs of geometric objects in the plane.
Symposium on Computational Geometry 2008: 346-354 |
| 153 | | Radoslav Fulek,
Andreas Holmsen,
János Pach:
Intersecting convex sets by rays.
Symposium on Computational Geometry 2008: 385-391 |
| 152 | | 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.
Comput. Geom. 40(2): 138-147 (2008) |
| 151 | | Jacob E. Goodman,
János Pach,
Richard Pollack:
Foreword.
Discrete & Computational Geometry 39(1-3): 1-2 (2008) |
| 150 | | Zoltán Füredi,
Ervin Györi,
János Pach,
Attila Sali:
Guest Editors' Foreword.
Discrete Mathematics 308(19): 4305 (2008) |
| 149 | | Jan Kyncl,
János Pach,
Géza Tóth:
Long alternating paths in bicolored point sets.
Discrete Mathematics 308(19): 4315-4321 (2008) |
| 148 | | János Pach:
On Simplices Embracing a Point.
Electronic Notes in Discrete Mathematics 31: 97 (2008) |
| 147 | | Sergey Bereg,
Adrian Dumitrescu,
János Pach:
Sliding Disks in the Plane.
Int. J. Comput. Geometry Appl. 18(5): 373-387 (2008) |
| 146 | | János Pach,
Micha Sharir:
On planar intersection graphs with forbidden subgraphs.
Journal of Graph Theory 59(3): 205-214 (2008) |
| 145 | | Gruia Calinescu,
Adrian Dumitrescu,
János Pach:
Reconfigurations in Graphs and Grids.
SIAM J. Discrete Math. 22(1): 124-138 (2008) |
| 2007 |
|---|
| 144 | | Jacob Fox,
János Pach,
Csaba D. Tóth:
A Bipartite Strengthening of the Crossing Lemma.
Graph Drawing 2007: 13-24 |
| 143 | | János Pach,
Géza Tóth:
Decomposition of multiple coverings into many parts.
Symposium on Computational Geometry 2007: 133-137 |
| 142 | | Esther Ezra,
János Pach,
Micha Sharir:
On regular vertices on the union of planar objects.
Symposium on Computational Geometry 2007: 220-226 |
| 141 | | János Pach,
Farhad Shahrokhi:
Guest Editors' Foreword.
Algorithmica 47(4): 365 (2007) |
| 140 | | Imre Bárány,
János Pach:
Foreword.
Discrete & Computational Geometry 38(2): 175-176 (2007) |
| 139 | | 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.
Discrete & Computational Geometry 38(2): 399-441 (2007) |
| 138 | | 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.
SIAM J. Comput. 36(5): 1342-1359 (2007) |
| 2006 |
|---|
| 137 | | 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.
Graph Drawing 2006: 114-125 |
| 136 | | Gruia Calinescu,
Adrian Dumitrescu,
János Pach:
Reconfigurations in Graphs and Grids.
LATIN 2006: 262-273 |
| 135 | | János Pach,
Géza Tóth:
Degenerate crossing numbers.
Symposium on Computational Geometry 2006: 255-258 |
| 134 | | János Pach,
Géza Tóth:
How Many Ways Can One Draw A Graph?
Combinatorica 26(5): 559-576 (2006) |
| 133 | | János Pach,
Rados Radoicic,
Jan Vondrák:
Nearly equal distances and Szemerédi's regularity lemma.
Comput. Geom. 34(1): 11-19 (2006) |
| 132 | | János Pach,
Rados Radoicic,
Gábor Tardos,
Géza Tóth:
Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs.
Discrete & Computational Geometry 36(4): 527-552 (2006) |
| 131 | | János Pach,
Dömötör Pálvölgyi:
Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers.
Electr. J. Comb. 13(1): (2006) |
| 130 | | János Pach,
Rados Radoicic,
Jan Vondrák:
On the diameter of separated point sets with many nearly equal distances.
Eur. J. Comb. 27(8): 1321-1332 (2006) |
| 129 | | Adrian Dumitrescu,
János Pach:
Pushing Squares Around.
Graphs and Combinatorics 22(1): 37-50 (2006) |
| 128 | | Károly J. Börözky,
János Pach,
Géza Tóth:
Planar Crossing Numbers of Graphs Embeddable in Another Surface.
Int. J. Found. Comput. Sci. 17(5): 1005-1016 (2006) |
| 2005 |
|---|
| 127 | | János Pach,
Gábor Tardos,
Géza Tóth:
Indecomposable Coverings.
CJCDGCGT 2005: 135-148 |
| 126 | | János Pach,
Géza Tóth:
Crossing Number of Toroidal Graphs.
Graph Drawing 2005: 334-342 |
| 125 | | 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.
SODA 2005: 545-554 |
| 124 | | János Pach,
Gábor Tardos:
Forbidden patterns and unit distances.
Symposium on Computational Geometry 2005: 1-9 |
| 123 | | János Pach,
Rom Pinchasi,
Micha Sharir,
Géza Tóth:
Topological Graphs with No Large Grids.
Graphs and Combinatorics 21(3): 355-364 (2005) |
| 122 | | Noga Alon,
János Pach,
Rom Pinchasi,
Rados Radoicic,
Micha Sharir:
Crossing patterns of semi-algebraic sets.
J. Comb. Theory, Ser. A 111(2): 310-326 (2005) |
| 2004 |
|---|
| 121 |  | János Pach:
Graph Drawing, 12th International Symposium, GD 2004, New York, NY, USA, September 29 - October 2, 2004, Revised Selected Papers
Springer 2004 |
| 120 | | Jan Kyncl,
János Pach,
Géza Tóth:
Long Alternating Paths in Bicolored Point Sets.
Graph Drawing 2004: 340-348 |
| 119 | | Sergey Bereg,
Adrian Dumitrescu,
János Pach:
Sliding Disks in the Plane.
JCDCG 2004: 37-47 |
| 118 | | Adrian Dumitrescu,
János Pach:
Pushing squares around.
Symposium on Computational Geometry 2004: 116-123 |
| 117 | | 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].
Symposium on Computational Geometry 2004: 68-75 |
| 116 | | 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.
Symposium on Computational Geometry 2004: 76-85 |
| 115 | | Boris Aronov,
János Pach,
Micha Sharir,
Gábor Tardos:
Distinct Distances in Three and Higher Dimensions.
Combinatorics, Probability & Computing 13(3): 283-293 (2004) |
| 114 | | János Pach,
Rom Pinchasi,
Gábor Tardos,
Géza Tóth:
Geometric graphs with no self-intersecting path of length three.
Eur. J. Comb. 25(6): 793-811 (2004) |
| 113 | | Pankaj K. Agarwal,
Eran Nevo,
János Pach,
Rom Pinchasi,
Micha Sharir,
Shakhar Smorodinsky:
Lenses in arrangements of pseudo-circles and their applications.
J. ACM 51(2): 139-186 (2004) |
| 112 | | János Pach,
Rom Pinchasi,
Micha Sharir:
On the number of directions determined by a three-dimensional points set.
J. Comb. Theory, Ser. A 108(1): 1-16 (2004) |
| 111 | | János Pach,
Géza Tóth:
Monotone drawings of planar graphs.
Journal of Graph Theory 46(1): 39-47 (2004) |
| 2003 |
|---|
| 110 | | János Pach,
Géza Tóth:
How Many Ways Can One Draw a Graph?
Graph Drawing 2003: 47-58 |
| 109 | | János Pach,
Géza Tóth:
Disjoint Edges in Topological Graphs.
IJCCGGT 2003: 133-140 |
| 108 | | Boris Aronov,
János Pach,
Micha Sharir,
Gábor Tardos:
Distinct distances in three and higher dimensions.
STOC 2003: 541-546 |
| 107 | | János Pach,
Rom Pinchasi,
Micha Sharir:
A tight bound for the number of different directions in three dimensions.
Symposium on Computational Geometry 2003: 106-113 |
| 106 | | János Pach,
Ido Safruti,
Micha Sharir:
The Union of Congruent Cubes in Three Dimensions.
Discrete & Computational Geometry 30(1): 133-160 (2003) |
| 105 | | János Pach,
József Solymosi,
Géza Tóth:
Unavoidable Configurations in Complete Topological Graphs.
Discrete & Computational Geometry 30(2): 311-320 (2003) |
| 2002 |
|---|
| 104 | | János Pach,
Rom Pinchasi,
Gábor Tardos,
Géza Tóth:
Geometric Graphs with No Self-intersecting Path of Length Three.
Graph Drawing 2002: 295-311 |
| 103 | | János Pach,
Géza Tóth:
Monotone Drawings of Planar Graphs.
ISAAC 2002: 647-654 |
| 102 | | János Pach,
Rados Radoicic,
Géza Tóth:
Relaxing Planarity for Topological Graphs.
JCDCG 2002: 221-232 |
| 101 | | Eran Nevo,
János Pach,
Rom Pinchasi,
Micha Sharir,
Shakhar Smorodinsky:
Lenses in arrangements of pseudo-circles and their applications.
Symposium on Computational Geometry 2002: 123-132 |
| 100 | | János Pach,
Gábor Tardos:
Untangling a Polygon.
Discrete & Computational Geometry 28(4): 585-592 (2002) |
| 99 | | János Pach,
Géza Tóth:
Recognizing String Graphs Is Decidable.
Discrete & Computational Geometry 28(4): 593-606 (2002) |
| 98 | | János Pach,
Gábor Tardos:
Isosceles Triangles Determined by a Planar Point Set.
Graphs and Combinatorics 18(4): 769-779 (2002) |
| 97 | | Adrian Dumitrescu,
János Pach:
Partitioning Colored Point Sets into Monochromatic Parts.
Int. J. Comput. Geometry Appl. 12(5): 401-412 (2002) |
| 96 | | János Pach,
Gábor Tardos:
On the Boundary Complexity of the Union of Fat Triangles.
SIAM J. Comput. 31(6): 1745-1760 (2002) |
| 2001 |
|---|
| 95 | | János Pach,
Gábor Tardos:
Untangling a Polygon.
Graph Drawing 2001: 154-161 |
| 94 | | János Pach,
Géza Tóth:
Recognizing String Graphs Is Decidable.
Graph Drawing 2001: 247-260 |
| 93 | | János Pach,
Ido Safruti,
Micha Sharir:
The union of congruent cubes in three dimensions.
Symposium on Computational Geometry 2001: 19-28 |
| 92 | | Adrian Dumitrescu,
János Pach:
Partitioning Colored Point Sets into Monochromatic Parts.
WADS 2001: 264-275 |
| 91 | | Noga Alon,
János Pach,
József Solymosi:
Ramsey-type Theorems with Forbidden Subgraphs.
Combinatorica 21(2): 155-170 (2001) |
| 90 | | János Pach,
Rom Pinchasi:
On the Number of Balanced Lines.
Discrete & Computational Geometry 25(4): 611-628 (2001) |
| 89 | | I. G. Macdonald,
János Pach,
Thorsten Theobald:
Common Tangents to Four Unit Balls in R3.
Discrete & Computational Geometry 26(1): 1-17 (2001) |
| 88 | | János Pach,
Gábor Tardos:
Separating convex sets by straight lines.
Discrete Mathematics 241(1-3): 427-433 (2001) |
| 87 | | János Pach,
Micha Sharir:
Radial Points in the Plane.
Eur. J. Comb. 22(6): 855-863 (2001) |
| 86 | | János Pach,
Rephael Wenger:
Embedding Planar Graphs at Fixed Vertex Locations.
Graphs and Combinatorics 17(4): 717-728 (2001) |
| 85 | | 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).
J. Comb. Theory, Ser. A 94(1): 178-179 (2001) |
| 84 | | János Pach,
József Solymosi:
Crossing Patterns of Segments.
J. Comb. Theory, Ser. A 96(2): 316-325 (2001) |
| 2000 |
|---|
| 83 | | János Pach,
Gábor Tardos:
On the boundary complexity of the union of fat triangles.
FOCS 2000: 423-431 |
| 82 | | János Pach,
Géza Tóth:
Unavoidable Configurations in Complete Topological Graphs.
Graph Drawing 2000: 328-337 |
| 81 | | János Pach:
On the Complexity of the Union of Geometric Objects.
JCDCG 2000: 292-307 |
| 80 | | János Pach,
József Solymosi:
Structure Theorems for Systems of Segments.
JCDCG 2000: 308-317 |
| 79 | | János Pach,
Gábor Tardos:
Cutting glass.
Symposium on Computational Geometry 2000: 360-369 |
| 78 | | János Pach,
Gábor Tardos:
Cutting Glass.
Discrete & Computational Geometry 24(2-3): 481-496 (2000) |
| 77 | | János Pach,
Joel Spencer,
Géza Tóth:
New Bounds on Crossing Numbers.
Discrete & Computational Geometry 24(4): 623-644 (2000) |
| 76 | | Ariel Halpert,
Flórián Lengyel,
János Pach:
Cellular telephone networks and random maps in hypergraphs.
Discrete Applied Mathematics 103(1-3): 111-126 (2000) |
| 75 | | János Pach,
Rom Pinchasi:
Bichromatic Lines with Few Points.
J. Comb. Theory, Ser. A 90(2): 326-335 (2000) |
| 74 | | János Pach,
Géza Tóth:
Which Crossing Number Is It Anyway?
J. Comb. Theory, Ser. B 80(2): 225-246 (2000) |
| 1999 |
|---|
| 73 | | János Pach,
Joel Spencer,
Géza Tóth:
New Bounds on Crossing Numbers.
Symposium on Computational Geometry 1999: 124-133 |
| 72 | | János Pach,
Joel Spencer:
Uniformly Distributed Distances - a Geometric Application of Janson's Inequality.
Combinatorica 19(1): 111-124 (1999) |
| 71 | | János Pach,
Micha Sharir:
On the Boundary of the Union of Planar Convex Sets.
Discrete & Computational Geometry 21(3): 321-328 (1999) |
| 70 | | Paul Erdös,
Gergely Harcos,
János Pach:
Popular distances in 3-space.
Discrete Mathematics 200(1-3): 95-99 (1999) |
| 1998 |
|---|
| 69 | | János Pach,
Géza Tóth:
Which Crossing Number is it, Anyway?
FOCS 1998: 617-627 |
| 68 | | János Pach,
Rephael Wenger:
Embedding Planar Graphs at Fixed Vertex Locations.
Graph Drawing 1998: 263-274 |
| 67 | | János Pach:
Crossing Numbers.
JCDCG 1998: 267-273 |
| 66 | | János Pach,
Micha Sharir:
On the Number of Incidences Between Points and Curves.
Combinatorics, Probability & Computing 7(1): 121-127 (1998) |
| 65 | | János Pach,
Eduardo Rivera-Campo:
On circumscribing polygons for line segments.
Comput. Geom. 10(2): 121-124 (1998) |
| 64 | | János Pach:
A Tverberg-type result on multicolored simplices.
Comput. Geom. 10(2): 71-76 (1998) |
| 63 | | János Pach:
Guest Editor's Foreword.
Discrete & Computational Geometry 19(3): 311-313 (1998) |
| 62 | | János Pach,
József Solymosi:
Canonical Theorems for Convex Sets.
Discrete & Computational Geometry 19(3): 427-435 (1998) |
| 61 | | János Pach,
Géza Tóth:
A Generalization of the Erdos - Szekeres Theorem to Disjoint Convex Sets.
Discrete & Computational Geometry 19(3): 437-445 (1998) |
| 60 | | Tamal K. Dey,
János Pach:
Extremal Problems for Geometric Hypergraphs.
Discrete & Computational Geometry 19(4): 473-484 (1998) |
| 59 | | Gyula Károlyi,
János Pach,
Géza Tóth,
Pavel Valtr:
Ramsey-Type Results for Geometric Graphs, II.
Discrete & Computational Geometry 20(3): 375-388 (1998) |
| 1997 |
|---|
| 58 | | János Pach,
Torsten Thiele,
Géza Tóth:
Three-dimensional Grid Drawings of Graphs.
Graph Drawing 1997: 47-51 |
| 57 | | Gyula Károlyi,
János Pach,
Géza Tóth,
Pavel Valtr:
Ramsey-Type Results for Geometric Graphs II.
Symposium on Computational Geometry 1997: 94-103 |
| 56 | | Pankaj K. Agarwal,
Boris Aronov,
János Pach,
Richard Pollack,
Micha Sharir:
Quasi-Planar Graphs Have a Linear Number of Edges.
Combinatorica 17(1): 1-9 (1997) |
| 55 | | János Pach,
Géza Tóth:
Graphs Drawn with Few Crossings per Edge.
Combinatorica 17(3): 427-439 (1997) |
| 54 | | Gyula Károlyi,
János Pach,
Géza Tóth:
Ramsey-Type Results for Geometric Graphs, I.
Discrete & Computational Geometry 18(3): 247-255 (1997) |
| 53 | | László Lovász,
János Pach,
Mario Szegedy:
On Conway's Thrackle Conjecture.
Discrete & Computational Geometry 18(4): 369-376 (1997) |
| 1996 |
|---|
| 52 | | János Pach,
Géza Tóth:
Graphs Drawn with Few Crossings Per Edge.
Graph Drawing 1996: 345-354 |
| 51 | | Tamal K. Dey,
János Pach:
Extremal Problems for Geometric Hypergraphs.
ISAAC 1996: 105-114 |
| 50 | | Gyula Károlyi,
János Pach,
Géza Tóth:
Ramsey-Type Results for Geometric Graphs.
Symposium on Computational Geometry 1996: 359-365 |
| 49 | | János Pach,
Farhad Shahrokhi,
Mario Szegedy:
Applications of the Crossing Number.
Algorithmica 16(1): 111-117 (1996) |
| 1995 |
|---|
| 48 | | Pankaj K. Agarwal,
Boris Aronov,
János Pach,
Richard Pollack,
Micha Sharir:
Quasi-Planar Graphs Have a Linear Number of Edges.
Graph Drawing 1995: 1-7 |
| 47 | | László Lovász,
János Pach,
Mario Szegedy:
On Conway's Thrackle Conjecture.
Symposium on Computational Geometry 1995: 147-151 |
| 46 | | Imre Bárány,
János Pach:
Guest Editor's Forword.
Discrete & Computational Geometry 13: 243-244 (1995) |
| 45 | | Hubert de Fraysseix,
Patrice Ossona de Mendez,
János Pach:
A Left-First Search Algorithm for Planar Graphs.
Discrete & Computational Geometry 13: 459-468 (1995) |
| 1994 |
|---|
| 44 | | János Pach,
Farhad Shahrokhi,
Mario Szegedy:
Applications of the Crossing Number.
Symposium on Computational Geometry 1994: 198-202 |
| 43 | | Péter Komjáth,
János Pach:
The Complexity of a Class of Infinite Graphs.
Combinatorica 14(1): 121-125 (1994) |
| 42 | | Boris Aronov,
Paul Erdös,
Wayne Goddard,
Daniel J. Kleitman,
Michael Klugerman,
János Pach,
Leonard J. Schulman:
Crossing Families.
Combinatorica 14(2): 127-134 (1994) |
| 41 | | János Pach,
Jenö Töröcsik:
Some Geometric Applications of Dilworth's Theorem.
Discrete & Computational Geometry 12: 1-7 (1994) |
| 40 | | Jirí Matousek,
János Pach,
Micha Sharir,
Shmuel Sifrony,
Emo Welzl:
Fat Triangles Determine Linearly Many Holes.
SIAM J. Comput. 23(1): 154-169 (1994) |
| 1993 |
|---|
| 39 | | János Pach,
Jenö Töröcsik:
Some Geometric Applications of Dilworth's Theorem.
Symposium on Computational Geometry 1993: 264-269 |
| 38 | | János Pach,
Richard Pollack,
Emo Welzl:
Weaving Patterns of Lines and Line Segments in Space.
Algorithmica 9(6): 561-571 (1993) |
| 37 | | Paul Erdös,
Endre Makai,
János Pach:
Nearly Equal Distances in the Plane.
Combinatorics, Probability & Computing 2: 401-408 (1993) |
| 36 | | Hervé Brönnimann,
Bernard Chazelle,
János Pach:
How Hard Is Half-Space Range Searching.
Discrete & Computational Geometry 10: 143-155 (1993) |
| 35 | | Boris Aronov,
Daniel Q. Naiman,
János Pach,
Micha Sharir:
An Invariant Property of Balls in Arrangements of Hyperplanes.
Discrete & Computational Geometry 10: 421-425 (1993) |
| 34 | | Paul Erdös,
Zoltán Füredi,
János Pach,
Imre Z. Ruzsa:
The grid revisted.
Discrete Mathematics 111(1-3): 189-196 (1993) |
| 1992 |
|---|
| 33 | | Imre Bárány,
János Pach:
On the Number of Convex Lattice Polygons.
Combinatorics, Probability & Computing 1: 295-302 (1992) |
| 32 | | János Pach,
William L. Steiger,
Endre Szemerédi:
An Upper Bound on the Number of Planar K-Sets.
Discrete & Computational Geometry 7: 109-123 (1992) |
| 31 | | János Komlós,
János Pach,
Gerhard J. Woeginger:
Almost Tight Bounds for epsilon-Nets.
Discrete & Computational Geometry 7: 163-173 (1992) |
| 30 | | János Pach,
Micha Sharir:
Repeated Angles in the Plane and Related Problems.
J. Comb. Theory, Ser. A 59(1): 12-22 (1992) |
| 29 | | Vasilis Capoyleas,
János Pach:
A turán-type theorem on chords of a convex polygon.
J. Comb. Theory, Ser. B 56(1): 9-15 (1992) |
| 28 | | Herbert Edelsbrunner,
Leonidas J. Guibas,
János Pach,
Richard Pollack,
Raimund Seidel,
Micha Sharir:
Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms.
Theor. Comput. Sci. 92(2): 319-336 (1992) |
| 1991 |
|---|
| 27 | | Jirí Matousek,
Nathaly Miller,
János Pach,
Micha Sharir,
Shmuel Sifrony,
Emo Welzl:
Fat Triangles Determine Linearly Many Holes
FOCS 1991: 49-58 |
| 26 | | Boris Aronov,
Paul Erdös,
Wayne Goddard,
Daniel J. Kleitman,
Michael Klugerman,
János Pach,
Leonard J. Schulman:
Crossing Families.
Symposium on Computational Geometry 1991: 351-356 |
| 25 | | David Avis,
Paul Erdös,
János Pach:
Distinct Distances Determined By Subsets of a Point Set in Space.
Comput. Geom. 1: 1-11 (1991) |
| 24 | | Péter Komjáth,
János Pach:
Universal elements and the complexity of certain classes of infinite graphs.
Discrete Mathematics 95(1-3): 255-270 (1991) |
| 23 | | János Pach,
Micha Sharir:
On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm.
SIAM J. Comput. 20(3): 460-470 (1991) |
| 1990 |
|---|
| 22 | | János Pach,
Richard Pollack,
Emo Welzl:
Weaving Patterns of Lines and Segments in Space.
SIGAL International Symposium on Algorithms 1990: 439-446 |
| 21 | | János Pach,
Gerhard J. Woeginger:
Some New Bounds for Epsilon-Nets.
Symposium on Computational Geometry 1990: 10-15 |
| 20 | | Sylvain E. Cappell,
Jacob E. Goodman,
János Pach,
Richard Pollack,
Micha Sharir,
Rephael Wenger:
The Combinatorial Complexity of Hyperplane Transversals.
Symposium on Computational Geometry 1990: 83-91 |
| 19 | | Hubert de Fraysseix,
János Pach,
Richard Pollack:
How to draw a planar graph on a grid.
Combinatorica 10(1): 41-51 (1990) |
| 18 | | Gábor Fejes Tóth,
János Pach:
Special issue dedicated to discrete and computational geometry.
Combinatorica 10(2): 113-114 (1990) |
| 17 | | Paul Erdös,
János Pach:
Variation on the theme of repeated distances.
Combinatorica 10(3): 261-269 (1990) |
| 16 | | János Pach,
Joel H. Spencer:
Note on vertex-partitions of infinite graphs.
Discrete Mathematics 79(1): 107-108 (1990) |
| 1989 |
|---|
| 15 | | János Pach,
William L. Steiger,
Endre Szemerédi:
An Upper Bound on the Number of Planar k-Sets
FOCS 1989: 72-79 |
| 14 | | János Pach,
Micha Sharir:
The Upper Envelope of Piecewise Linear Functions and the Boundary of a Region Enclosed by Convex Plates: Combinatorial Analysis.
Discrete & Computational Geometry 4: 291-309 (1989) |
| 13 | | 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.
Discrete & Computational Geometry 4: 523-539 (1989) |
| 12 | | Paul Erdös,
János Pach,
Richard Pollack,
Zsolt Tuza:
Radius, diameter, and minimum degree.
J. Comb. Theory, Ser. B 47(1): 73-79 (1989) |
| 1988 |
|---|
| 11 | | Herbert Edelsbrunner,
Leonidas J. Guibas,
János Pach,
Richard Pollack,
Raimund Seidel,
Micha Sharir:
Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms.
ICALP 1988: 214-229 |
| 10 | | Hubert de Fraysseix,
János Pach,
Richard Pollack:
Small Sets Supporting Fáry Embeddings of Planar Graphs
STOC 1988: 426-433 |
| 9 | | 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.
Symposium on Computational Geometry 1988: 258-265 |
| 8 | | János Pach,
Joel Spencer:
Explicit codes with low covering radius.
IEEE Transactions on Information Theory 34(5): 1281-1285 (1988) |
| 7 | | Paul Erdös,
Ralph J. Faudree,
János Pach,
Joel H. Spencer:
How to make a graph bipartite.
J. Comb. Theory, Ser. B 45(1): 86-98 (1988) |
| 1987 |
|---|
| 6 | | Herbert Edelsbrunner,
János Pach,
Jacob T. Schwartz,
Micha Sharir:
On the Lower Envelope of Bivariate Functions and its Applications
FOCS 1987: 27-37 |
| 1986 |
|---|
| 5 | | Klara Kedem,
Ron Livne,
János Pach,
Micha Sharir:
On the Union of Jordan Regions and Collision-Free Translational Motion Amidst Polygonal Obstacles.
Discrete & Computational Geometry 1: 59-70 (1986) |
| 4 | | János Pach:
Covering the Plane with Convex Polygons.
Discrete & Computational Geometry 1: 73-81 (1986) |
| 3 | | 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.
Discrete Mathematics 60: 101-120 (1986) |
| 1984 |
|---|
| 2 | | Peter Frankl,
János Pach:
On disjointly representable sets.
Combinatorica 4(1): 39-45 (1984) |
| 1981 |
|---|
| 1 | | János Pach:
Graphs whose every independent set has a common neighbour.
Discrete Mathematics 37(2-3): 217-228 (1981) |
