Mountain climbing, ladder moving, and the ring width of a polygon (with J. E. Goodman and Chee K. Yap), Amer. Math. Monthly 96 (1989), 494-510.
 On the lower envelope of bivariate functions and its applications (with H. Edelsbrunner, J. T. Schwartz and M. Sharir), Proc. 28th FOCS Symposium 1987, 27-38.
 Some universal graphs (with P. Komjáth and A. H. Mekler), Israel Journal of Mathematics 64 (1988), 158-168.
 On arrangements of Jordan arcs with three intersections per pair (with H. Edelsbrunner, L. Guibas, J. Hershberger, R. Pollack, R. Seidel, M. Sharir and J. Snoeyink), Proc. 4th ACM Symposium on Computational Geometry, 1988, 258-265.
See also Discrete and Comp. Geom. 4 (1989), 523-539.
 Arrangements of curves in the plane - Topology, Combinatorics and Algorithms (with H. Edelsbrunner, L. Guibas, R. Pollack, R. Seidel and M. Sharir). '88 ICALP Proc. 214-229.
Also in: Theoretical Computer Science 92 (1992), 319-336.
 A problem of Leo Moser about repeated distances on the sphere (with P. Erdős and D. Hickerson), Amer. Math. Monthly 96 (1989), 569-575.
 Small sets supporting Fáry embeddings of planar graphs (with H. de Fraysseix and R. Pollack), 20th STOC Symposium 1988, 426- 433.
Almost identical with: How to draw a planar graph on a grid, Combinatorica 10 (1990), 41-51.
 The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis (with M. Sharir), Discrete and Computational Geom. 4. (1989), 291-309.
 Delicate symmetry, Computers and Mathematics with Applications 17 (1989), 117-124.
 Isomorphic subgraphs in a graph (with P. Erdős and L. Pyber), in: Combinatorics, Coll. Math. Soc. J. Bolyai 52 (1988), 553-556.
 On the average volume of subsets in Euclidean d-space (with N. Sauer), European J. Combinatorics 12 (1991), 417-421.
 Problem on convex polygons, James Cook Math. Notes 5 (1988), 5116-5117.
 Cell decomposition of polygons by bending (with J. E. Goodman), Israel J. Math. 64 (1988), 129-138.
 On vertical visibility in arrangements of segments and the queue size in the Bentley-Ottman line sweeping algorithm (with M. Sharir), SIAM J. Computing 20 (1991), 460-470.
 Embedding a planar triangulation with vertices at specified points (with P. Gritzmann, B. Mohar, and R. Pollack), Amer. Math. Monthly 98 (1991), 165-166.
 On the game of Misery, Studia Sci. Math. Hung. 27 (1992), 353-358.
 On the maximal number of certain subgraphs in Kr-free graphs (with E. Győri and M. Simonovits), Graphs and Combinatorics 7 (1991), 31-37.
 Large discs in convex unions (with C. A. Rogers), American Math. Monthly 95 (1988), 765-767.
 Variations on the theme of repeated distances (with P. Erdős), Combinatorica 10 (1990), 261-269.
 On the structure of a system of stars in graphs (Russian, with Armenian summary), Mat. Voprosy Kibernet. Vychisl. Tekhn. 15 (1988), 165-173 (MR 90j:05079).
 An upper bound on the number of planar k-sets (with W. Steiger and E. Szemerédi), Proc. 30th FOCS Symposium, l989, 72-81.
Also in: Discrete Comput. Geom. 7 (1992), 109-123.
 Towards a new geometry, Magyar Tudomány 1990/8, 895-903 (in Hungarian).
 Weaving patterns of lines and line segments in space (with R. Pollack and E. Welzl), Proc. SIGAL Internat. Symposium on Algorithms, Tokyo Lecture Notes in Comp. Sci. 450 (1990), 439-446, Springer. Also in: Algorithmica 9 (1993), 561-571.
 Graph distance and Euclidean distance on the grid (with R. Pollack and J. Spencer), Topics in Graph Theory and Combinatorics, The Ringel-Festzeitschrift (R. Bodendiek, R. Henn, eds), Physica-Verlag, Heidelberg, 1990, 553-559.
 Some new bounds for epsilon-nets (with G. Woeginger), Proc. 6th ACM Symposium on Comput. Geom., 1990, 10-15.
See also: Almost tight bounds on epsilon-nets (with J. Komlós and G. Woeginger), Discr. Comput. Geom. 7 (1992), 163-173.