|
[101] Some geometric applications of Dilworth's theorem (with J. Törőcsik), Proc. 9th ACM Symposium on Computional Geometry 1993, 264-269. Also in: Discrete and Computational Geometry 12 (1994), 1-7. [102] A left-first search algorithm for planar graphs (with H. de Fraysseix, P. O. de Mendez), Discrete and Computational Geometry 13 (1995), 459-468. [103] Nearly equal distances in the plane (with P. Erdős, E. Makai), Combinatorics, Probability and Computing 2 (1993), 401-408. See also: Solution to Problem 1 of the 1993 Schweitzer Mathematical Competition, Matematikai Lapok 3 (1993), 31-33 (in Hungarian). [104] Rich cells in an arrangement of hyperplanes (with I. Bárány, H. Bunting, D. Larman), Linear Algebra and its Applications 226-228 (1995), 567-576. [105] Applications of the crossing number (with F. Shahrokhi, M. Szegedy), Proc. 10th ACM Symposium on Computational Geometry, 1994, 198-202. Also in: Algorithmica 16 (1996), 111-117. [106] A remark on transversal numbers, in: The Mathematics of Paul Erdős, Vol. II, (R. L. Graham and J. Nešetřil, eds.), Algorithms and Combinatorics 14, Springer-Verlag, Heidelberg, 1997, 310-317. [107] Extremal problems for geometric hypergraphs (with T.K. Dey), in: Algorithms and Computation (Proc. ISAAC '96, Osaka; T. Asano et al., eds.), Lecture Notes in Computer Science 1178, Springer-Verlag, 1996, 105-114. Also in: Discrete and Computational Geometry 19 (1998), 473-484. [108] On circumscribing polygons for line segments (with E. Rivera-Campo), Computational Geometry: Theory and Applications 10 (1998), 121-124. [109] On Conway's thrackle conjecture (with L. Lovász, M. Szegedy), Proc. 11th ACM Symposium on Computational Geometry, 1995, 147-151. Also in: Discrete and Computational Geometry 18 (1997), 369-376. [110] Quasi-planar graphs have a linear number of edges (with P.K. Agarwal, B. Aronov, R. Pollack, M. Sharir), Proc. Graph Drawing '95, Passau (Franz J. Brandenburg, ed.), Lecture Notes in Computer Science 1027, Springer-Verlag, Berlin, 1996, 1-7. Also in: Combinatorica 17 (1997), 1-9. [111] Finite point configurations, Chapter 1 in: Handbook of Discrete and Computational Geometry (J.E. Goodman and J. O'Rourke, eds.), CRC Press, Boca Raton, 1997, 3-18. [112] Ramsey-type results for geometric graphs. I (With G. Károlyi, G. Tóth), 12th ACM Symposium on Computational Geometry, 1996, 359-365. Also in: Discrete and Computational Geometry 18 (1997), 247-255. [113] On a metric generalization of Ramsey's theorem (with P. Erdős, A. Hajnal), Israel Journal of Mathematics 102 (1997), 283-295. [114] The hippocampus as a cognitive graph (with R.U. Muller, M. Stead), Journal of General Physiology 107 (1996), 663-694. [115] A Tverberg-type result on multicolored simplices, Computational Geometry: Theory and Applications 10 (1998), 71-76. [116] An algorithm for finding many disjoint monochromatic edges in a complete 2-colored geometric graph (with G. Károlyi, G. Tardos, and G. Tóth), in: Intuitive Geometry (I. Bárány, K. Böröczky, eds.) Bolyai Society Mathematical Studies 6, Budapest, 1997, 367-372. [117] On the number of incidences between points and curves (with M. Sharir), Combinatorics, Probability and Computing 7 (1998), 121-127. [118] On the independence number of coin graphs (with G. Tóth), Geombinatorics 6 (1996), 30-33. [119] Graphs drawn with few crossings per edge (with G. Tóth), in: Graph Drawing '96, Berkeley (S. North, ed.), Lecture Notes in Computer Science 1190, Springer-Verlag, Berlin, 1997, 345-354. Also in: Combinatorica 17 (1997), 427-439. [120] Geometric graphs and geometric hypergraphs, Graph Theory Notes of New York XXXI (1996), 39-43. [121] Combinatorial geometry, in: Handbook of Discrete and Combinatorial Mathematics (K. H. Rosen, ed.), CRC Press, Boca Raton, 2000, 830-839. [122] Two places at once (A remembrance of Paul Erdős), Mathematical Intelligencer 19(1997), Number 2, 38-48. See also: Két helyen egyszerre (Emlékek Erdős Pálról), Világosság, December 1996, 70-79. [123] Ramsey-type results for geometric graphs. II (with G. Károlyi, G. Tóth and P. Valtr), 13th ACM Symposium on Computational Geometry, Nice, ACM Press, 1997, 94-103. Also in: Discrete and Computational Geometry 20 (1998), 375-388. [124] Three-dimensional grid drawings of graphs (with T. Thiele and G. Tóth), in: Graph Drawing (Giuseppe DiBattista, ed.), Lecture Notes in Computer Science 1353, Springer-Verlag, Berlin, 1998, 47-51. Also in: Advances in Discrete and Computational Geometry (B. Chazelle, J.E. Goodman and R. Pollack, eds.), Contemporary Mathematics 223, AMS, Providence, 1999, 251-255. [125] Are there many distances that occur few times? (with P. Erdős), Geombinatorics 6 (1997), 77-78. |
|