|
[126] On the boundary of the union of planar convex sets (with M. Sharir), Discrete and Computational Geometry 21 (1999), 321-328. [127] Problem 75; Bemerkung zu Problem 75; Mathematische Semesterberichte 41 (1994), 208; 43 (1996). [128] Problem 86: Covering with circles; Problem 88: Convex positions, Mathematische Semesterberichte 44 (1997), 93-94. [129] A generalization of the Erdős-Szekeres theorem to disjoint convex sets (with G. Tóth), Discrete and Computational Geometry 19 (1998), 437-445. [130] Canonical theorems for convex sets (with J. Solymosi), Discrete and Computational Geometry 19 (1998), 427-435. [131] Folding and turning along geodesics in a convex surface, Geombinatorics 7 (1997), 61-65. [132] Erdős-Szekeres-type theorems for segments and non-crossing convex sets (with G. Tóth), Geometriae Dedicata 81 (2000), 1-12. [133] Halving lines and perfect cross-matchings (with J. Solymosi), in: Advances in Discrete and Computational Geometry (B. Chazelle, J.E. Goodman and R. Pollack, eds.), Contemporary Mathematics 223, AMS, Providence, 1999, 245-249. [134] Which crossing number is it, anyway? (with G. Tóth), Proceedings of 39th Annual Symposium on Foundations of Computer Science, Palo Alto, 1998, 617-626. Also in: Journal of Combinatorial Theory, Ser. B 80 (2000), 225-246. [135] Popular distances in 3-space (with P. Erdős and G. Harcos), Discrete Mathematics 200 (1999), 95-99. [136] New bounds on crossing numbers (with J. Spencer and G. Tóth), 15th ACM Symposium on Computational Geometry, 1999, 124-133. Also in: Discrete and Computational Geometry 24 (2000), 623-644. [137] Embedding planar graphs with fixed vertex locations (with R. Wenger), in: Graph Drawing '98 (Sue Whitesides, ed.), Lecture Notes in Computer Science 1547, Springer-Verlag, Berlin, 1998, 263-274. Also in: Graphs and Combinatorics 17 (2001), 717-728. [138] Crossroads in flatland, in:Combinatorics, Computation and Logic (C. S. Calude and M. J. Dinneen, eds.), Australian Computer Science Communications, Volume 21, Number 3, Springer Verlag, Singapore, 1999, 73-80. Also in: MTA Közgyülési Előadások (J. Potó, ed.), Hungarian Academy of Sciences, Budapest, 1999, 131-138. (Title: Sík mezőben hármas út, in Hungarian.)
[139] Crossing numbers, in: Discrete and Computational Geometry (J. Akiyama et al, eds.), Lecture Notes in Computer Science 1763, Springer-Verlag, Berlin, 2000, 267-273. [140] Geometric graph theory, in: Surveys in Combinatorics, 1999 (J. D. Lamb and D. A. Preece, eds.), London Mathemetical Society Lecture Notes 267, Cambridge University Press, Cambridge, 1999, 167-200. [141] Cellular telephone networks and random maps in hypergraphs (with A. Halpert and F. Lengyel), Discrete Applied Mathematics 103 (2000), 111-126. [142] Cutting glass (with G. Tardos), 16th ACM Symposium on Computational Geometry, 2000, 360-369. Also in: Discrete and Computational Geometry 24 (2000), 481-495. [143] Ramsey type theorems for tournaments and and for H-free graphs (with N. Alon and J. Solymosi), Combinatorica 21 (2001), 155-170. [144] Radial points in the plane (with M. Sharir), European Journal of Combinatorics 22 (2001), 855-863. [145] Bichromatic lines with few points (with R. Pinchasi), Journal of Combinatorial Theory, Ser. A 90 (2000), 326-335. [146] Separating convex sets by straight lines (with G. Tardos), Discrete Mathematics 241 (2001), 427-433, special issue dedicated to the 65th birthday of Helge Tverberg. [147] Thirteen problems on crossing numbers (with G. Tóth), Geombinatorics 9 (2000), 194-207. [148] New results on the distribution of distances determined by a point set (with E. Makai and J. Spencer), Bolyai Society Mathematical Studies 11, Paul Erdős and his Mathematics, II, (G. Halász et al., eds.), Springer, Berlin etc., J. Bolyai Mathematical Society, Budapest, 2002, 499-511. [149] Covering lattice points by subspaces (with I. Bárány, G. Harcos, and G. Tardos), Periodica Mathematica Hungarica 43 (2001), 93-103. [150] On the boundary complexity of the union of fat triangles (with G. Tardos), Proceedings of 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, CA, 2000, 423-431. Also in: SIAM Journal of Computing 31 (2002), 1745-1760. |
|