|
[76] Universal elements and the complexity of certain classes of infinite graphs (with P. Komjáth), in: Directions in Infinite Graph Theory (R. Diestel, ed.), Discr. Math. 95 (1991), 255-270. [77] On the combinatorial complexity of the space of hyperplane transversals (with S.E. Cappell, J.E. Goodman, R. Pollack, M. Sharir, R. Wenger), Proc. 6th ACM Symposium on Comput. Geom., 1990, 83-91. Expanded version: Common tangents and common transversals, Advances of Math. 106 (1994), 198-215. [78] Repeated angles in the plane and related problems (with M. Sharir), J. Combinat. Theory Ser. A 59 (1992), 12-22. [79] Gaps in difference sets, and the graph of nearly equal distances (with P. Erdős, E. Makai and J. Spencer), in: The Victor Klee Festschrift (P. Gritzmann, B. Sturmfels, eds), DIMACS Series, Vol. 4, Amer. Math. Soc., Providence, 1991, 265-273. [80] A Turán-type theorem on chords of a convex polygon (with V. Capoyleas), J. Combinat. Theory, Ser B 56 (1992), 9-15. [81] Recent developments in combinatorial geometry (with W. Moser), in: New Trends in Discrete and Computational Geometry (J. Pach, ed.), Springer-Verlag, Berlin-Heidelberg-New York, 1993, 281-302. [82] Fat triangles determine linearly many holes (with J. Matousek, N. Miller, M. Sharir, S. Sifrony and E. Welzl), FOCS, Proc. 32nd Symposium, 1991, 49-58. Also in: SIAM J. Computing 23 (1994), 154-169. [83] Distinct distances determined by subsets of a point set in space (with D. Avis and P. Erdős), Computational Geometry: Theory and Applications 1 (1991), 1-11. [84] On the perimeter of a point set in the plane (with V. Capoyleas), Proc. 3rd Canadian Conference on Comput. Geom. (1991) 54-57. Also in: Discrete and Computational Geometry (J.E. Goodman et al, eds), DIMACS 6 (1991), 67-76. [85] Separating bi-chromatic points by parallel lines (with T. Asano, J. Hershberger, E. Sontag, D. Souvaine and S. Suri), Proc. 2nd Canadian Conference on Computational Geom., University of Ottawa, Ontario, 1990, 46-49. [86] Crossing families (with B. Aronov, P. Erdős, W. Goddard, D.J. Kleitman, M. Klugerman, L.J. Schulman), Proc. 7th ACM Symposium on Comput. Geom., 1991, 351-356. Also in: Combinatorica 14 (1994), 127-134. [87] The grid revisited, (with P. Erdős, Z. Füredi, I.Z. Ruzsa), Proc. Symp. on Combinatorics and Graph Theory, Marseille, 1990, Discrete Mathematics 111 (1993), 189-196. [88] The complexity of a class of infinite graphs (with P. Komjáth), Combinatorica 14 (1994), 121-125. [89] Touching convex sets in the plane (with M. Katchalski), Bull. Canad. Math. Soc. 37 (1994), 495-504. [90] Layout of rooted trees (with J. Törőcsik), in: Planar Graphs (W.T. Trotter, ed.), DIMACS Series, Vol. 9, Amer. Math. Soc., Providence, 1993, 131-137. [91] Combinatorial Geometry (with P.K. Agarwal), J. Wiley, New York, 1995. Chinese translation: Chinese Science Press, Beijing, 2008. [92] Notes on geometric graph theory, in: Discrete and Computational Geometry (J.E. Goodman et al, eds.), DIMACS Series, Vol 6, Amer. Math. Soc., Providence, 1991, 273-285. [93] On the number of convex lattice polygons (with I. Bárány), Combinatorics, Probability and Computing 1 (1992), 295-302. [94] An invariant property of balls in arrangements of hyperplanes (with B. Aronov, D. Naiman, M. Sharir), Discrete Comput. Geom. 10 (1993), 421-425. [95] Sphere-of-influence graphs in higher dimensions (with L. Guibas, M. Sharir), in: Intuitive Geometry (K. Böröczky, G. Fejes Tóth, eds), Coll. Math. Soc. J. Bolyai 63, North-Holland, Amsterdam, 1994, 131-137. [96] A Ramsey-type result for planar convex sets (with D. Larman, J. Matoušek, J. Törőcsik), Bull. London Math. Soc. 26 (1994), 132-136. [97] How hard is halfspace range searching? (with H. Brönnimann, B. Chazelle), Discrete Computational Geometry 10 (1993), 143-155. [98] Traces of finite sets: extremal problems and geometric applications (with Z. Füredi), in: Extremal Problems for Finite Sets, Visegrád 1991, Bolyai Society Mathematical Studies, Vol. 3, Bolyai Society, Budapest, 1994, 251-282. [99] Uniformly distributed distances -a geometric application of Janson's inequality (with J. Spencer), Combinatorica 19 (1999), 111-124. [100] Representation of planar graphs by segments (with H. de Fraysseix, P. O. de Mendez), in: Intuitive Geometry (K. Böröczky, G. Fejes Tóth, eds), Coll. Math. Soc. J. Bolyai 63, North-Holland, Amsterdam, 1994, 109-117. |
|