Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
János Pach
2010 – today
- 2013
[j133]János Pach, Géza Tóth: Monochromatic empty triangles in two-colored point sets. Discrete Applied Mathematics 161(9): 1259-1261 (2013)- [j132]Gabriel Nivasch, János Pach, Rom Pinchasi, Shira Zerbib: The number of distinct distances from a vertex of a convex polygon. JoCG 4(1): 1-12 (2013)
- [j131]Jacob Fox, János Pach, Andrew Suk: The Number of Edges in k-Quasi-planar Graphs. SIAM J. Discrete Math. 27(1): 550-561 (2013)
- [i12]Jacob Fox, János Pach: Applications of a new separator theorem for string graphs. CoRR abs/1302.7228 (2013)
- 2012
- [j130]János Pach, Gábor Tardos, József Solymosi: Remarks on a Ramsey theory for trees. Combinatorica 32(4): 473-482 (2012)
- [j129]Adrian Dumitrescu, János Pach, Géza Tóth: Drawing Hamiltonian Cycles with no Large Angles. Electr. J. Comb. 19(2): P31 (2012)
- [j128]Padmini Mukkamala, János Pach, Dömötör Pálvölgyi: Lower Bounds on the Obstacle Number of Graphs. Electr. J. Comb. 19(2): P32 (2012)
- [j127]János Pach, Andrew Suk, Miroslav Treml: Tangencies between families of disjoint regions in the plane. Comput. Geom. 45(3): 131-138 (2012)
- [j126]Jacob Fox, János Pach: Coloring Kk-free intersection graphs of geometric objects in the plane. Eur. J. Comb. 33(5): 853-866 (2012)
- [j125]János Pach, Gábor Tardos: Piercing quasi-rectangles - On a problem of Danzer and Rogers. J. Comb. Theory, Ser. A 119(7): 1391-1397 (2012)
- [c80]Jacob Fox, János Pach: String graphs and incomparability graphs. Symposium on Computational Geometry 2012: 405-414
- [c79]Gabriel Nivasch, János Pach, Gábor Tardos: The Visible Perimeter of an Arrangement of Disks. Graph Drawing 2012: 364-375
- [c78]Marc J. van Kreveld, Maarten Löffler, János Pach: How Many Potatoes Are in a Mesh? ISAAC 2012: 166-176
- [i11]Gabriel Nivasch, János Pach, Gábor Tardos: The visible perimeter of an arrangement of disks. CoRR abs/1206.1422 (2012)
- [i10]Gabriel Nivasch, János Pach, Rom Pinchasi, Shira Zerbib: The number of distinct distances from a vertex of a convex polygon. CoRR abs/1207.1266 (2012)
- [i9]Marc J. van Kreveld, Maarten Löffler, János Pach: How Many Potatoes are in a Mesh? CoRR abs/1209.3954 (2012)
- 2011
- [j124]Radoslav Fulek, János Pach: A computational approach to Conway's thrackle conjecture. Comput. Geom. 44(6-7): 345-355 (2011)
- [j123]Herbert Edelsbrunner, János Pach, Günter M. Ziegler: Letter from the New Editors-in-Chief. Discrete & Computational Geometry 45(1): 1-2 (2011)
- [j122]Adrian Dumitrescu, János Pach: Minimum Clique Partition in Unit Disk Graphs. Graphs and Combinatorics 27(3): 399-411 (2011)
- [j121]János Pach, Deniz Sariöz: On the Structure of Graphs with Low Obstacle Number. Graphs and Combinatorics 27(3): 465-473 (2011)
- [j120]János Pach, Ethan Sterling: Conway's Conjecture for Monotone Thrackles. The American Mathematical Monthly 118(6): 544-548 (2011)
- [c77]
- [c76]János Pach, Gábor Tardos: Tight lower bounds for the size of epsilon-nets. Symposium on Computational Geometry 2011: 458-463
- [c75]
- [c74]
- [c73]
- [c72]Jacob Fox, Mikhail Gromov, Vincent Lafforgue, Assaf Naor, János Pach: Overlap properties of geometric expanders. SODA 2011: 1188-1197
- [c71]János Pach, Gábor Tardos: Piercing Quasi-Rectangles: On a Problem of Danzer and Rogers. WADS 2011: 654
- [i8]Padmini Mukkamala, János Pach, Dömötör Pálvölgyi: Lower bounds on the obstacle number of graphs. CoRR abs/1103.2724 (2011)
- [i7]Jacob Fox, János Pach, Andrew Suk: The number of edges in k-quasi-planar graphs. CoRR abs/1112.2361 (2011)
- 2010
- [j119]Christian Blanvillain, János Pach: "square trisection". dissection of a square in three congruent partitions. BIAA 86: 7-18 (2010)
- [j118]Jacob Fox, János Pach: A Separator Theorem for String Graphs and its Applications. Combinatorics, Probability & Computing 19(3): 371-390 (2010)
- [j117]Jacob Fox, János Pach, Csaba D. Tóth: A bipartite strengthening of the Crossing Lemma. J. Comb. Theory, Ser. B 100(1): 23-35 (2010)
- [j116]János Pach, Gábor Tardos: Coloring axis-parallel rectangles. J. Comb. Theory, Ser. A 117(6): 776-782 (2010)
- [j115]Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth: Cubic graphs have bounded slope parameter. J. Graph Algorithms Appl. 14(1): 5-17 (2010)
- [j114]János Pach, József Solymosi, Gábor Tardos: Crossing numbers of imbalanced graphs. Journal of Graph Theory 64(1): 12-21 (2010)
- [c70]János Pach, Andrew Suk, Miroslav Treml: Tangencies between families of disjoint regions in the plane. Symposium on Computational Geometry 2010: 423-428
- [c69]Giuseppe Di Battista, Fabrizio Frati, János Pach: On the Queue Number of Planar Graphs. FOCS 2010: 365-374
- [c68]Radoslav Fulek, János Pach: A Computational Approach to Conway's Thrackle Conjecture. Graph Drawing 2010: 226-237
- [c67]Balázs Keszegh, János Pach, Dömötör Pálvölgyi: Drawing Planar Graphs of Bounded Degree with Few Slopes. Graph Drawing 2010: 293-304
- [c66]Jacob Fox, Fabrizio Frati, János Pach, Rom Pinchasi: Crossings between Curves with Many Tangencies. WALCOM 2010: 1-8
- [c65]
- [i6]Jacob Fox, Mikhail Gromov, Vincent Lafforgue, Assaf Naor, János Pach: Overlap properties of geometric expanders. CoRR abs/1005.1392 (2010)
- [i5]
- [i4]Balázs Keszegh, János Pach, Dömötör Pálvölgyi: Drawing planar graphs of bounded degree with few slopes. CoRR abs/1009.1315 (2010)
- [i3]János Pach, Gábor Tardos: Tight lower bounds for the size of epsilon-nets. CoRR abs/1012.1240 (2010)
- [i2]János Pach, Deniz Sariöz: Small (2,s)-colorable graphs without 1-obstacle representations. CoRR abs/1012.5907 (2010)
2000 – 2009
- 2009
- [j113]János Pach, Géza Tóth: Decomposition of multiple coverings into many parts. Comput. Geom. 42(2): 127-133 (2009)
- [j112]János Pach, Gábor Tardos: Conflict-Free Colourings of Graphs and Hypergraphs. Combinatorics, Probability & Computing 18(5): 819-834 (2009)
- [j111]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)
- [j110]János Pach, Géza Tóth: Degenerate Crossing Numbers. Discrete & Computational Geometry 41(3): 376-384 (2009)
- [j109]Radoslav Fulek, Andreas Holmsen, János Pach: Intersecting Convex Sets by Rays. Discrete & Computational Geometry 42(3): 343-358 (2009)
- [j108]Jacob Fox, János Pach: A bipartite analogue of Dilworth's theorem for multiple partial orders. Eur. J. Comb. 30(8): 1846-1853 (2009)
- [j107]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)
- [c64]Eyal Ackerman, Jacob Fox, János Pach, Andrew Suk: On grids in topological graphs. Symposium on Computational Geometry 2009: 403-412
- [c63]
- [c62]Adrian Dumitrescu, János Pach, Géza Tóth: Drawing Hamiltonian Cycles with No Large Angles. Graph Drawing 2009: 3-14
- [c61]Jacob Fox, János Pach: A Separator Theorem for String Graphs and Its Applications. WALCOM 2009: 1-14
- [i1]Adrian Dumitrescu, János Pach: Minimum clique partition in unit disk graphs. CoRR abs/0909.1552 (2009)
- 2008
- [j106]Andreas Holmsen, János Pach, Helge Tverberg: Points surrounding the origin. Combinatorica 28(6): 633-644 (2008)
- [j105]Friedrich Eisenbrand, János Pach, Thomas Rothvoß, Nir B. Sopher: Convexly Independent Subsets of the Minkowski Sum of Planar Point Sets. Electr. J. Comb. 15(1) (2008)
- [j104]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)
- [j103]Jacob E. Goodman, János Pach, Richard Pollack: Foreword. Discrete & Computational Geometry 39(1-3): 1-2 (2008)
- [j102]Zoltán Füredi, Ervin Györi, János Pach, Attila Sali: Guest Editors' Foreword. Discrete Mathematics 308(19): 4305 (2008)
- [j101]Jan Kyncl, János Pach, Géza Tóth: Long alternating paths in bicolored point sets. Discrete Mathematics 308(19): 4315-4321 (2008)
- [j100]
- [j99]Sergey Bereg, Adrian Dumitrescu, János Pach: Sliding Disks in the Plane. Int. J. Comput. Geometry Appl. 18(5): 373-387 (2008)
- [j98]János Pach, Micha Sharir: On planar intersection graphs with forbidden subgraphs. Journal of Graph Theory 59(3): 205-214 (2008)
- [j97]Gruia Calinescu, Adrian Dumitrescu, János Pach: Reconfigurations in Graphs and Grids. SIAM J. Discrete Math. 22(1): 124-138 (2008)
- [c60]Jacob Fox, János Pach: Coloring kk-free intersection graphs of geometric objects in the plane. Symposium on Computational Geometry 2008: 346-354
- [c59]Radoslav Fulek, Andreas Holmsen, János Pach: Intersecting convex sets by rays. Symposium on Computational Geometry 2008: 385-391
- [c58]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
- [c57]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
- 2007
- [j96]
- [j95]
- [j94]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)
- [j93]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)
- [c56]János Pach, Géza Tóth: Decomposition of multiple coverings into many parts. Symposium on Computational Geometry 2007: 133-137
- [c55]Esther Ezra, János Pach, Micha Sharir: On regular vertices on the union of planar objects. Symposium on Computational Geometry 2007: 220-226
- [c54]Jacob Fox, János Pach, Csaba D. Tóth: A Bipartite Strengthening of the Crossing Lemma. Graph Drawing 2007: 13-24
- [c53]
- 2006
- [j92]
- [j91]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)
- [j90]János Pach, Rados Radoicic, Jan Vondrák: Nearly equal distances and Szemerédi's regularity lemma. Comput. Geom. 34(1): 11-19 (2006)
- [j89]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)
- [j88]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)
- [j87]
- [j86]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)
- [c52]János Pach, Géza Tóth: Degenerate crossing numbers. Symposium on Computational Geometry 2006: 255-258
- [c51]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
- [c50]Gruia Calinescu, Adrian Dumitrescu, János Pach: Reconfigurations in Graphs and Grids. LATIN 2006: 262-273
- 2005
- [b2]Peter Brass, William O. J. Moser, János Pach: Research problems in discrete geometry. Springer 2005, pp. I-XII, 1-499
- [j85]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)
- [j84]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)
- [j83]Emden R. Gansner, János Pach: Guest Editor's Foreword. J. Graph Algorithms Appl. 9(3): 301-304 (2005)
- [c49]
- [c48]János Pach, Gábor Tardos: Forbidden patterns and unit distances. Symposium on Computational Geometry 2005: 1-9
- [c47]
- [c46]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
- 2004
- [j82]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)
- [j81]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)
- [j80]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)
- [j79]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)
- [j78]János Pach, Géza Tóth: Monotone drawings of planar graphs. Journal of Graph Theory 46(1): 39-47 (2004)
- [c45]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
- [c44]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
- [c43]Adrian Dumitrescu, János Pach: Pushing squares around. Symposium on Computational Geometry 2004: 116-123
- [c42]Jan Kyncl, János Pach, Géza Tóth: Long Alternating Paths in Bicolored Point Sets. Graph Drawing 2004: 340-348
- [c41]
- [e1]János Pach (Ed.): Graph Drawing, 12th International Symposium, GD 2004, New York, NY, USA, September 29 - October 2, 2004, Revised Selected Papers. Lecture Notes in Computer Science 3383, Springer 2004, ISBN 3-540-24528-6
- 2003
- [j77]János Pach, Ido Safruti, Micha Sharir: The Union of Congruent Cubes in Three Dimensions. Discrete & Computational Geometry 30(1): 133-160 (2003)
- [j76]János Pach, József Solymosi, Géza Tóth: Unavoidable Configurations in Complete Topological Graphs. Discrete & Computational Geometry 30(2): 311-320 (2003)
- [j75]János Pach, Rom Pinchasi: How Many Unit Equilateral Triangles Can Be Generated by N Points in Convex Position? The American Mathematical Monthly 110(5): 400-406 (2003)
- [c40]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
- [c39]
- [c38]
- [c37]Boris Aronov, János Pach, Micha Sharir, Gábor Tardos: Distinct distances in three and higher dimensions. STOC 2003: 541-546
- 2002
- [j74]János Pach, Gábor Tardos: Untangling a Polygon. Discrete & Computational Geometry 28(4): 585-592 (2002)
- [j73]János Pach, Géza Tóth: Recognizing String Graphs Is Decidable. Discrete & Computational Geometry 28(4): 593-606 (2002)
- [j72]János Pach, Gábor Tardos: Isosceles Triangles Determined by a Planar Point Set. Graphs and Combinatorics 18(4): 769-779 (2002)
- [j71]Adrian Dumitrescu, János Pach: Partitioning Colored Point Sets into Monochromatic Parts. Int. J. Comput. Geometry Appl. 12(5): 401-412 (2002)
- [j70]Imre Bárány, Gergely Harcos, János Pach, Gábor Tardos: Covering lattice points by subspaces. Periodica Mathematica Hungarica 43(1-2): 93-103 (2002)
- [j69]János Pach, Gábor Tardos: On the Boundary Complexity of the Union of Fat Triangles. SIAM J. Comput. 31(6): 1745-1760 (2002)
- [c36]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
- [c35]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
- [c34]
- [c33]János Pach, Rados Radoicic, Géza Tóth: Relaxing Planarity for Topological Graphs. JCDCG 2002: 221-232
- 2001
- [j68]Noga Alon, János Pach, József Solymosi: Ramsey-type Theorems with Forbidden Subgraphs. Combinatorica 21(2): 155-170 (2001)
- [j67]János Pach, Rom Pinchasi: On the Number of Balanced Lines. Discrete & Computational Geometry 25(4): 611-628 (2001)
- [j66]I. G. Macdonald, János Pach, Thorsten Theobald: Common Tangents to Four Unit Balls in R3. Discrete & Computational Geometry 26(1): 1-17 (2001)
- [j65]János Pach, Gábor Tardos: Separating convex sets by straight lines. Discrete Mathematics 241(1-3): 427-433 (2001)
- [j64]
- [j63]János Pach, Rephael Wenger: Embedding Planar Graphs at Fixed Vertex Locations. Graphs and Combinatorics 17(4): 717-728 (2001)
- [j62]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)
- [j61]János Pach, József Solymosi: Crossing Patterns of Segments. J. Comb. Theory, Ser. A 96(2): 316-325 (2001)
- [c32]János Pach, Ido Safruti, Micha Sharir: The union of congruent cubes in three dimensions. Symposium on Computational Geometry 2001: 19-28
- [c31]
- [c30]
- [c29]Adrian Dumitrescu, János Pach: Partitioning Colored Point Sets into Monochromatic Parts. WADS 2001: 264-275
- 2000
- [j60]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)
- [j59]
- [j58]János Pach, Joel Spencer, Géza Tóth: New Bounds on Crossing Numbers. Discrete & Computational Geometry 24(4): 623-644 (2000)
- [j57]János Pach, Géza Tóth: Which Crossing Number Is It Anyway? J. Comb. Theory, Ser. B 80(2): 225-246 (2000)
- [j56]János Pach, Rom Pinchasi: Bichromatic Lines with Few Points. J. Comb. Theory, Ser. A 90(2): 326-335 (2000)
- [c28]
- [c27]János Pach, Gábor Tardos: On the boundary complexity of the union of fat triangles. FOCS 2000: 423-431
- [c26]János Pach, Géza Tóth: Unavoidable Configurations in Complete Topological Graphs. Graph Drawing 2000: 328-337
- [c25]
- [c24]
1990 – 1999
- 1999
- [j55]János Pach, Joel Spencer: Uniformly Distributed Distances - a Geometric Application of Janson's Inequality. Combinatorica 19(1): 111-124 (1999)
- [j54]János Pach, Micha Sharir: On the Boundary of the Union of Planar Convex Sets. Discrete & Computational Geometry 21(3): 321-328 (1999)
- [j53]Paul Erdös, Gergely Harcos, János Pach: Popular distances in 3-space. Discrete Mathematics 200(1-3): 95-99 (1999)
- [c23]János Pach, Joel Spencer, Géza Tóth: New Bounds on Crossing Numbers. Symposium on Computational Geometry 1999: 124-133
- 1998
- [j52]
- [j51]János Pach, Eduardo Rivera-Campo: On circumscribing polygons for line segments. Comput. Geom. 10(2): 121-124 (1998)
- [j50]János Pach, Micha Sharir: On the Number of Incidences Between Points and Curves. Combinatorics, Probability & Computing 7(1): 121-127 (1998)
- [j49]
- [j48]János Pach, József Solymosi: Canonical Theorems for Convex Sets. Discrete & Computational Geometry 19(3): 427-435 (1998)
- [j47]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)
- [j46]Tamal K. Dey, János Pach: Extremal Problems for Geometric Hypergraphs. Discrete & Computational Geometry 19(4): 473-484 (1998)
- [j45]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)
- [c22]
- [c21]János Pach, Rephael Wenger: Embedding Planar Graphs at Fixed Vertex Locations. Graph Drawing 1998: 263-274
- [c20]
- 1997
- [j44]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)
- [j43]János Pach, Géza Tóth: Graphs Drawn with Few Crossings per Edge. Combinatorica 17(3): 427-439 (1997)
- [j42]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)
- [j41]László Lovász, János Pach, Mario Szegedy: On Conway's Thrackle Conjecture. Discrete & Computational Geometry 18(4): 369-376 (1997)
- [c19]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
- [c18]János Pach, Torsten Thiele, Géza Tóth: Three-dimensional Grid Drawings of Graphs. Graph Drawing 1997: 47-51
- 1996
- [j40]János Pach, Farhad Shahrokhi, Mario Szegedy: Applications of the Crossing Number. Algorithmica 16(1): 111-117 (1996)
- [c17]Gyula Károlyi, János Pach, Géza Tóth: Ramsey-Type Results for Geometric Graphs. Symposium on Computational Geometry 1996: 359-365
- [c16]
- [c15]
- 1995
- [b1]János Pach, Pankaj K. Agarwal: Combinatorial geometry. Wiley-Interscience series in discrete mathematics and optimization, Wiley 1995, ISBN 978-0-471-58890-0, pp. I-XIII, 1-354
- [j39]Imre Bárány, János Pach: Guest Editor's Forword. Discrete & Computational Geometry 13: 243-244 (1995)
- [j38]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)
- [c14]László Lovász, János Pach, Mario Szegedy: On Conway's Thrackle Conjecture. Symposium on Computational Geometry 1995: 147-151
- [c13]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
- 1994
- [j37]Péter Komjáth, János Pach: The Complexity of a Class of Infinite Graphs. Combinatorica 14(1): 121-125 (1994)
- [j36]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)
- [j35]János Pach, Jenö Töröcsik: Some Geometric Applications of Dilworth's Theorem. Discrete & Computational Geometry 12: 1-7 (1994)
- [j34]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)
- [c12]János Pach, Farhad Shahrokhi, Mario Szegedy: Applications of the Crossing Number. Symposium on Computational Geometry 1994: 198-202
- 1993
- [j33]János Pach, Richard Pollack, Emo Welzl: Weaving Patterns of Lines and Line Segments in Space. Algorithmica 9(6): 561-571 (1993)
- [j32]Paul Erdös, Endre Makai, János Pach: Nearly Equal Distances in the Plane. Combinatorics, Probability & Computing 2: 401-408 (1993)
- [j31]Hervé Brönnimann, Bernard Chazelle, János Pach: How Hard Is Half-Space Range Searching. Discrete & Computational Geometry 10: 143-155 (1993)
- [j30]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)
- [j29]Paul Erdös, Zoltán Füredi, János Pach, Imre Z. Ruzsa: The grid revisted. Discrete Mathematics 111(1-3): 189-196 (1993)
- [c11]János Pach, Jenö Töröcsik: Some Geometric Applications of Dilworth's Theorem. Symposium on Computational Geometry 1993: 264-269
- 1992
- [j28]Imre Bárány, János Pach: On the Number of Convex Lattice Polygons. Combinatorics, Probability & Computing 1: 295-302 (1992)
- [j27]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)
- [j26]János Komlós, János Pach, Gerhard J. Woeginger: Almost Tight Bounds for epsilon-Nets. Discrete & Computational Geometry 7: 163-173 (1992)
- [j25]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)
- [j24]János Pach, Micha Sharir: Repeated Angles in the Plane and Related Problems. J. Comb. Theory, Ser. A 59(1): 12-22 (1992)
- [j23]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
- [j22]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)
- [j21]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)
- [j20]Ervin Györi, János Pach, Miklós Simonovits: On the maximal number of certain subgraphs inKr-free graphs. Graphs and Combinatorics 7(1): 31-37 (1991)
- [j19]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)
- [c10]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
- [c9]Jirí Matousek, Nathaly Miller, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl: Fat Triangles Determine Linearly Many Holes. FOCS 1991: 49-58
- 1990
- [j18]Hubert de Fraysseix, János Pach, Richard Pollack: How to draw a planar graph on a grid. Combinatorica 10(1): 41-51 (1990)
- [j17]Gábor Fejes Tóth, János Pach: Special issue dedicated to discrete and computational geometry. Combinatorica 10(2): 113-114 (1990)
- [j16]Paul Erdös, János Pach: Variation on the theme of repeated distances. Combinatorica 10(3): 261-269 (1990)
- [j15]János Pach, Joel H. Spencer: Note on vertex-partitions of infinite graphs. Discrete Mathematics 79(1): 107-108 (1990)
- [c8]János Pach, Gerhard J. Woeginger: Some New Bounds for Epsilon-Nets. Symposium on Computational Geometry 1990: 10-15
- [c7]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
- [c6]János Pach, Richard Pollack, Emo Welzl: Weaving Patterns of Lines and Segments in Space. SIGAL International Symposium on Algorithms 1990: 439-446
1980 – 1989
- 1989
- [j14]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)
- [j13]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)
- [j12]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)
- [c5]János Pach, William L. Steiger, Endre Szemerédi: An Upper Bound on the Number of Planar k-Sets. FOCS 1989: 72-79
- 1988
- [j11]David Avis, Paul Erdös, János Pach: Repeated distances in space. Graphs and Combinatorics 4(1): 207-217 (1988)
- [j10]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)
- [j9]Paul Erdös, Mark Goldberg, János Pach, Joel Spencer: Cutting a graph into two dissimilar halves. Journal of Graph Theory 12(1): 121-131 (1988)
- [j8]Peter Frankl, János Pach: An extremal problem on Kr-free graphs. Journal of Graph Theory 12(4): 519-523 (1988)
- [j7]János Pach, Joel Spencer: Explicit codes with low covering radius. IEEE Transactions on Information Theory 34(5): 1281-1285 (1988)
- [c4]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
- [c3]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
- [c2]Hubert de Fraysseix, János Pach, Richard Pollack: Small Sets Supporting Fáry Embeddings of Planar Graphs. STOC 1988: 426-433
- 1987
- [j6]Peter Frankl, Zoltán Füredi, János Pach: Bounding one-way differences. Graphs and Combinatorics 3(1): 341-347 (1987)
- [c1]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
- [j5]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)
- [j4]János Pach: Covering the Plane with Convex Polygons. Discrete & Computational Geometry 1: 73-81 (1986)
- [j3]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
- [j2]
- 1981
- [j1]János Pach: Graphs whose every independent set has a common neighbour. Discrete Mathematics 37(2-3): 217-228 (1981)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-13 23:10 CEST by the dblp team