dblp.uni-trier.dewww.uni-trier.de

János Pach Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
163EEEyal Ackerman, Jacob Fox, János Pach, Andrew Suk: On grids in topological graphs. Symposium on Computational Geometry 2009: 403-412
162EEJacob Fox, János Pach: A Separator Theorem for String Graphs and Its Applications. WALCOM 2009: 1-14
161EEAdrian Dumitrescu, János Pach: Minimum clique partition in unit disk graphs CoRR abs/0909.1552: (2009)
160EEJános Pach, Géza Tóth: Decomposition of multiple coverings into many parts. Comput. Geom. 42(2): 127-133 (2009)
159EEEsther Ezra, János Pach, Micha Sharir: On Regular Vertices of the Union of Planar Convex Objects. Discrete & Computational Geometry 41(2): 216-231 (2009)
158EEJános Pach, Géza Tóth: Degenerate Crossing Numbers. Discrete & Computational Geometry 41(3): 376-384 (2009)
157EEXiaomin 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
156EEBalá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
155EEXiaomin 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
154EEJacob Fox, János Pach: Coloring kk-free intersection graphs of geometric objects in the plane. Symposium on Computational Geometry 2008: 346-354
153EERadoslav Fulek, Andreas Holmsen, János Pach: Intersecting convex sets by rays. Symposium on Computational Geometry 2008: 385-391
152EEBalá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)
151EEJacob E. Goodman, János Pach, Richard Pollack: Foreword. Discrete & Computational Geometry 39(1-3): 1-2 (2008)
150EEZoltán Füredi, Ervin Györi, János Pach, Attila Sali: Guest Editors' Foreword. Discrete Mathematics 308(19): 4305 (2008)
149EEJan Kyncl, János Pach, Géza Tóth: Long alternating paths in bicolored point sets. Discrete Mathematics 308(19): 4315-4321 (2008)
148EEJános Pach: On Simplices Embracing a Point. Electronic Notes in Discrete Mathematics 31: 97 (2008)
147EESergey Bereg, Adrian Dumitrescu, János Pach: Sliding Disks in the Plane. Int. J. Comput. Geometry Appl. 18(5): 373-387 (2008)
146EEJános Pach, Micha Sharir: On planar intersection graphs with forbidden subgraphs. Journal of Graph Theory 59(3): 205-214 (2008)
145EEGruia Calinescu, Adrian Dumitrescu, János Pach: Reconfigurations in Graphs and Grids. SIAM J. Discrete Math. 22(1): 124-138 (2008)
2007
144EEJacob Fox, János Pach, Csaba D. Tóth: A Bipartite Strengthening of the Crossing Lemma. Graph Drawing 2007: 13-24
143EEJános Pach, Géza Tóth: Decomposition of multiple coverings into many parts. Symposium on Computational Geometry 2007: 133-137
142EEEsther Ezra, János Pach, Micha Sharir: On regular vertices on the union of planar objects. Symposium on Computational Geometry 2007: 220-226
141EEJános Pach, Farhad Shahrokhi: Guest Editors' Foreword. Algorithmica 47(4): 365 (2007)
140EEImre Bárány, János Pach: Foreword. Discrete & Computational Geometry 38(2): 175-176 (2007)
139EEJá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)
138EEKe 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
137EEBalá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
136EEGruia Calinescu, Adrian Dumitrescu, János Pach: Reconfigurations in Graphs and Grids. LATIN 2006: 262-273
135EEJános Pach, Géza Tóth: Degenerate crossing numbers. Symposium on Computational Geometry 2006: 255-258
134EEJános Pach, Géza Tóth: How Many Ways Can One Draw A Graph? Combinatorica 26(5): 559-576 (2006)
133EEJános Pach, Rados Radoicic, Jan Vondrák: Nearly equal distances and Szemerédi's regularity lemma. Comput. Geom. 34(1): 11-19 (2006)
132EEJá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)
131EEJános Pach, Dömötör Pálvölgyi: Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers. Electr. J. Comb. 13(1): (2006)
130EEJá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)
129EEAdrian Dumitrescu, János Pach: Pushing Squares Around. Graphs and Combinatorics 22(1): 37-50 (2006)
128EEKá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
127EEJános Pach, Gábor Tardos, Géza Tóth: Indecomposable Coverings. CJCDGCGT 2005: 135-148
126EEJános Pach, Géza Tóth: Crossing Number of Toroidal Graphs. Graph Drawing 2005: 334-342
125EEAmos 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
124EEJános Pach, Gábor Tardos: Forbidden patterns and unit distances. Symposium on Computational Geometry 2005: 1-9
123EEJános Pach, Rom Pinchasi, Micha Sharir, Géza Tóth: Topological Graphs with No Large Grids. Graphs and Combinatorics 21(3): 355-364 (2005)
122EENoga 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
120EEJan Kyncl, János Pach, Géza Tóth: Long Alternating Paths in Bicolored Point Sets. Graph Drawing 2004: 340-348
119EESergey Bereg, Adrian Dumitrescu, János Pach: Sliding Disks in the Plane. JCDCG 2004: 37-47
118EEAdrian Dumitrescu, János Pach: Pushing squares around. Symposium on Computational Geometry 2004: 116-123
117EEJá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
116EEJá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)
114EEJá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)
113EEPankaj 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)
112EEJá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)
111EEJános Pach, Géza Tóth: Monotone drawings of planar graphs. Journal of Graph Theory 46(1): 39-47 (2004)
2003
110EEJános Pach, Géza Tóth: How Many Ways Can One Draw a Graph? Graph Drawing 2003: 47-58
109EEJános Pach, Géza Tóth: Disjoint Edges in Topological Graphs. IJCCGGT 2003: 133-140
108EEBoris Aronov, János Pach, Micha Sharir, Gábor Tardos: Distinct distances in three and higher dimensions. STOC 2003: 541-546
107EEJá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
106EEJános Pach, Ido Safruti, Micha Sharir: The Union of Congruent Cubes in Three Dimensions. Discrete & Computational Geometry 30(1): 133-160 (2003)
105EEJános Pach, József Solymosi, Géza Tóth: Unavoidable Configurations in Complete Topological Graphs. Discrete & Computational Geometry 30(2): 311-320 (2003)
2002
104EEJá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
103EEJános Pach, Géza Tóth: Monotone Drawings of Planar Graphs. ISAAC 2002: 647-654
102EEJános Pach, Rados Radoicic, Géza Tóth: Relaxing Planarity for Topological Graphs. JCDCG 2002: 221-232
101EEEran 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
100EEJános Pach, Gábor Tardos: Untangling a Polygon. Discrete & Computational Geometry 28(4): 585-592 (2002)
99EEJános Pach, Géza Tóth: Recognizing String Graphs Is Decidable. Discrete & Computational Geometry 28(4): 593-606 (2002)
98EEJános Pach, Gábor Tardos: Isosceles Triangles Determined by a Planar Point Set. Graphs and Combinatorics 18(4): 769-779 (2002)
97EEAdrian Dumitrescu, János Pach: Partitioning Colored Point Sets into Monochromatic Parts. Int. J. Comput. Geometry Appl. 12(5): 401-412 (2002)
96EEJános Pach, Gábor Tardos: On the Boundary Complexity of the Union of Fat Triangles. SIAM J. Comput. 31(6): 1745-1760 (2002)
2001
95EEJános Pach, Gábor Tardos: Untangling a Polygon. Graph Drawing 2001: 154-161
94EEJános Pach, Géza Tóth: Recognizing String Graphs Is Decidable. Graph Drawing 2001: 247-260
93EEJános Pach, Ido Safruti, Micha Sharir: The union of congruent cubes in three dimensions. Symposium on Computational Geometry 2001: 19-28
92EEAdrian Dumitrescu, János Pach: Partitioning Colored Point Sets into Monochromatic Parts. WADS 2001: 264-275
91EENoga Alon, János Pach, József Solymosi: Ramsey-type Theorems with Forbidden Subgraphs. Combinatorica 21(2): 155-170 (2001)
90EEJános Pach, Rom Pinchasi: On the Number of Balanced Lines. Discrete & Computational Geometry 25(4): 611-628 (2001)
89EEI. G. Macdonald, János Pach, Thorsten Theobald: Common Tangents to Four Unit Balls in R3. Discrete & Computational Geometry 26(1): 1-17 (2001)
88EEJános Pach, Gábor Tardos: Separating convex sets by straight lines. Discrete Mathematics 241(1-3): 427-433 (2001)
87EEJános Pach, Micha Sharir: Radial Points in the Plane. Eur. J. Comb. 22(6): 855-863 (2001)
86EEJános Pach, Rephael Wenger: Embedding Planar Graphs at Fixed Vertex Locations. Graphs and Combinatorics 17(4): 717-728 (2001)
85EEPeter 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)
84EEJá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
82EEJános Pach, Géza Tóth: Unavoidable Configurations in Complete Topological Graphs. Graph Drawing 2000: 328-337
81EEJános Pach: On the Complexity of the Union of Geometric Objects. JCDCG 2000: 292-307
80EEJános Pach, József Solymosi: Structure Theorems for Systems of Segments. JCDCG 2000: 308-317
79EEJános Pach, Gábor Tardos: Cutting glass. Symposium on Computational Geometry 2000: 360-369
78EEJános Pach, Gábor Tardos: Cutting Glass. Discrete & Computational Geometry 24(2-3): 481-496 (2000)
77EEJá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)
75EEJános Pach, Rom Pinchasi: Bichromatic Lines with Few Points. J. Comb. Theory, Ser. A 90(2): 326-335 (2000)
74EEJános Pach, Géza Tóth: Which Crossing Number Is It Anyway? J. Comb. Theory, Ser. B 80(2): 225-246 (2000)
1999
73EEJános Pach, Joel Spencer, Géza Tóth: New Bounds on Crossing Numbers. Symposium on Computational Geometry 1999: 124-133
72EEJános Pach, Joel Spencer: Uniformly Distributed Distances - a Geometric Application of Janson's Inequality. Combinatorica 19(1): 111-124 (1999)
71EEJános Pach, Micha Sharir: On the Boundary of the Union of Planar Convex Sets. Discrete & Computational Geometry 21(3): 321-328 (1999)
70EEPaul Erdös, Gergely Harcos, János Pach: Popular distances in 3-space. Discrete Mathematics 200(1-3): 95-99 (1999)
1998
69EEJános Pach, Géza Tóth: Which Crossing Number is it, Anyway? FOCS 1998: 617-627
68EEJá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)
63EEJános Pach: Guest Editor's Foreword. Discrete & Computational Geometry 19(3): 311-313 (1998)
62EEJános Pach, József Solymosi: Canonical Theorems for Convex Sets. Discrete & Computational Geometry 19(3): 427-435 (1998)
61EEJá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)
60EETamal K. Dey, János Pach: Extremal Problems for Geometric Hypergraphs. Discrete & Computational Geometry 19(4): 473-484 (1998)
59EEGyula 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
57EEGyula 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)
54EEGyula Károlyi, János Pach, Géza Tóth: Ramsey-Type Results for Geometric Graphs, I. Discrete & Computational Geometry 18(3): 247-255 (1997)
53EELá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
51EETamal K. Dey, János Pach: Extremal Problems for Geometric Hypergraphs. ISAAC 1996: 105-114
50EEGyula 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
47EELá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
44EEJá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
39EEJá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)
34EEPaul 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)
29EEVasilis 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
26EEBoris 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)
24EEPé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
22EEJános Pach, Richard Pollack, Emo Welzl: Weaving Patterns of Lines and Segments in Space. SIGAL International Symposium on Algorithms 1990: 439-446
21EEJános Pach, Gerhard J. Woeginger: Some New Bounds for Epsilon-Nets. Symposium on Computational Geometry 1990: 10-15
20EESylvain 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)
16EEJá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)
12EEPaul 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
11EEHerbert 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
9EEHerbert 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)
7EEPaul 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)
3EEKá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
1EEJános Pach: Graphs whose every independent set has a common neighbour. Discrete Mathematics 37(2-3): 217-228 (1981)

Coauthor Index

1Eyal Ackerman [163]
2Pankaj K. Agarwal [48] [56] [113]
3Noga Alon [91] [122]
4Boris Aronov [26] [35] [42] [48] [56] [108] [115]
5David Avis [25]
6Imre Bárány [3] [33] [46] [140]
7Sergey Bereg (Sergei Bespamyatnikh) [119] [147]
8Károly Böröczky [3]
9Károly J. Börözky [128]
10Peter Braß (Peter Brass) [85]
11Hervé Brönnimann [36]
12Gruia Calinescu [136] [145]
13Vasilis Capoyleas [29]
14Sylvain E. Cappell [20]
15Bernard Chazelle [36]
16Ke Chen [138]
17Xiaomin Chen [155] [157]
18Tamal K. Dey [51] [60]
19Adrian Dumitrescu [92] [97] [118] [119] [129] [136] [145] [147] [161]
20Herbert Edelsbrunner [6] [9] [11] [13] [28]
21Paul Erdös [7] [12] [17] [25] [26] [34] [37] [42] [70]
22Esther Ezra (Eti Ezra) [142] [159]
23Ralph J. Faudree [7]
24Amos Fiat [125] [138]
25Jacob Fox [144] [154] [162] [163]
26Peter Frankl [2]
27Hubert de Fraysseix [10] [19] [45]
28Radoslav Fulek [153]
29Zoltán Füredi [34] [150]
30Wayne Goddard [26] [42]
31Jacob E. Goodman [20] [151]
32Leonidas J. Guibas [9] [11] [13] [28]
33Ervin Györi [150]
34Ariel Halpert [76]
35Gergely Harcos [70]
36John Hershberger [9] [13]
37Andreas Holmsen [153]
38Haim Kaplan [138]
39Gyula Károlyi [50] [54] [57] [59]
40Klara Kedem [5]
41Balázs Keszegh [137] [152] [156]
42Daniel J. Kleitman [26] [42]
43Michael Klugerman [26] [42]
44Péter Komjáth [24] [43]
45János Komlós [31]
46Jan Kyncl [120] [149]
47Flórián Lengyel [76]
48Meital Levy [125] [138]
49Ron Livne [5]
50László Lovász [47] [53]
51I. G. Macdonald [89]
52Endre Makai [3] [37]
53Jirí Matousek [27] [40] [125] [138]
54Patrice Ossona de Mendez [45]
55Nathaly Miller [27]
56Elchanan Mossel [125] [138]
57Daniel Q. Naiman [35]
58Eran Nevo [101] [113]
59Dömötör Pálvölgyi [131] [137] [152] [156]
60Rom Pinchasi [75] [90] [101] [104] [107] [112] [113] [114] [116] [122] [123] [139]
61Richard Pollack [9] [10] [11] [12] [13] [19] [20] [22] [28] [38] [48] [56] [151]
62Rados Radoicic [102] [117] [122] [130] [132] [133]
63Eduardo Rivera-Campo [65]
64Imre Z. Ruzsa [34]
65Ido Safruti [93] [106]
66Attila Sali [150]
67Leonard J. Schulman [26] [42]
68Jacob T. Schwartz [6]
69Raimund Seidel [9] [11] [13] [28]
70Farhad Shahrokhi [44] [49] [141]
71Micha Sharir [5] [6] [9] [11] [13] [14] [20] [23] [27] [28] [30] [35] [40] [48] [56] [66] [71] [87] [93] [101] [106] [107] [108] [112] [113] [115] [116] [122] [123] [125] [138] [139] [142] [146] [159]
72Shmuel Sifrony [27] [40]
73Shakhar Smorodinsky [101] [113] [125] [138]
74Jack Snoeyink [9] [13]
75József Solymosi [62] [80] [84] [91] [105]
76Joel H. Spencer (Joel Spencer) [7] [8] [16] [72] [73] [77]
77William L. Steiger [15] [32]
78Andrew Suk [163]
79Mario Szegedy [44] [47] [49] [53] [155] [157]
80Endre Szemerédi [15] [32]
81Gábor Tardos [78] [79] [83] [88] [95] [96] [98] [100] [104] [108] [114] [115] [117] [124] [127] [132] [155] [157]
82Thorsten Theobald [89]
83Torsten Thiele [58]
84Jenö Töröcsik [39] [41]
85Csaba D. Tóth [144]
86Gábor Fejes Tóth [18]
87Géza Tóth [50] [52] [54] [55] [57] [58] [59] [61] [69] [73] [74] [77] [82] [94] [99] [102] [103] [104] [105] [109] [110] [111] [114] [117] [120] [123] [126] [127] [128] [132] [134] [135] [137] [143] [149] [152] [156] [158] [160]
88Zsolt Tuza [12]
89Pavel Valtr [57] [59]
90Jan Vondrák [130] [133]
91Uli Wagner [125] [138]
92Emo Welzl [22] [27] [38] [40] [125] [138]
93Rephael Wenger [20] [68] [86]
94Gerhard J. Woeginger [21] [31]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)