|
[151] Unavoidable
configurations in complete topological graphs (with G. Tóth),
in: Graph Drawing 2000, Lecture Notes in Computer Science 1984, Springer-Verlag,
2001, 328-337.
Also in: Discrete and Computational Geometry 30 (2003), 311-320. [152] A Ramsey-type theorem for bipartite graphs (with P. Erdős and A. Hajnal), Geombinatorics 10 (2000), 64-68. [153] The maximum number of times the same distance can occur among the vertices of a convex n-gon is O(nlogn) (with P. Braß), Journal of Combinatorial Theory, Ser. A 94 (2001), 178-179. [154] A modular version of the Erdős-Szekeres theorem (with G. Károlyi and G. Tóth), Studia Sci. Math. Hung. 38 (2001), 245-259. [155] On the number of balanced lines (with R. Pinchasi), Discrete and Computational Geometry 25 (2001), 611-628. [156] Common tangents to four unit balls in R³ (with I. G. Macdonald and T. Theobald), Discrete and Computational Geometry 26 (2001), 1-17. [157] Crossing patterns of segments (with J. Solymosi), Journal of Combinatorial Theory, Ser. A, 96 (2001), 316-325. [158] The Happy End Problem - The beginning of combinatorial geometry (in Hungarian), in: New Mathematical Mosaic (A. Hraskó, ed.), Typotex, Budapest, 2002, 223-242. [159] Structure theorems for systems of segments (with J. Solymosi), Discrete and Computational Geometry (J. Akiyama et al., eds), Lecture Notes in Computer Science 2098, Springer-Verlag, Berlin, 2001, 308-317. [160]On the complexity of the union of geometric objects, Discrete and Computational Geometry (J. Akiyama et al., eds), Lecture Notes in Computer Science 2098, Springer-Verlag, Berlin, 2001, 292-307. [161] The union of congruent cubes in three dimensions (with I. Safruti and M. Sharir), 17th ACM Symposium on Computational Geometry, ACM Press, 2001, 19-28. Also in: Discrete and Computational Geometry 30 (2003), 133-160. [162] Partitioning colored point sets into monochromatic parts (with A. Dumitrescu), in: WADS 2001, Workshop Algor. Data Struct., Lecture Notes in Computer Science 2125, Springer-Verlag, 2001, 264-275. Also in: International J. Computational Geometry and Appl. 12 (2002), 401-412. [163] Untangling a polygon (with G. Tardos), in: Graph Drawing 2001, Lecture Notes in Computer Science, Springer-Verlag, accepted. Also in: Discrete and Computational Geometry 28 (2002), 585-592. [164] Recognizing string graphs is decidable (with G. Tóth), in: Graph Drawing 2001, Lecture Notes in Computer Science 2265, Springer-Verlag, 247-260. Also in: Discrete and Computational Geometry 28 (2002), 593-606. [165] Lenses in arrangements of pseudo-circles and their applications (with P. K. Agarwal, E. Nevo, R. Pinchasi, M. Sharir, Sh. Smorodinsky), 18th ACM Symposium on Computational Geometry, ACM Press, New York, 2002, 123-132. Also in: Journal of ACM 51 (2004), 139-186. [166] How many unit equilateral triangles can be generated by n points in convex position? (with R. Pinchasi), American Mathematical Monthly 110 (2003), 400-406. [167] The number of simplices embracing the origin (with M. Szegedy), in: Discrete Geometry: In honor of W. Kuperberg's 60th Birthday (A. Bezdek, ed.), Pure and Applied Mathematics, Marcel Dekker Inc., New York, 2003, 381-386. [168] Isosceles triangles determined by a planar point set (with G. Tardos), Graphs and Combinatorics 18 (2002), 769-779. [169] Geometric graphs with no self-intersecting path of length three (with R. Pinchasi, G. Tardos, and G. Tóth), in: Graph Drawing 2002, Lecture Notes in Computer Science 2528, Springer-Verlag, Berlin, 2002, 295-311. Also in: European J. Combinatorics, 25 (2004), 793-811. [170] Topological graphs with no large grids (with R. Pinchasi, M. Sharir, and G. Tóth), Graphs and Combinatorics 21 (2005), 355-364. [171] Monotone drawings of planar graphs (with G. Tóth), in: Algorithms and Computation ( P. Bose, P. Morin, eds.) Lecture Notes in Computer Science 2518, Springer-Verlag, Berlin, 2002, 647-653. Also in: Journal of Graph Theory, 46 (2004), 39-47. [172] Geometric graph theory, in: Handbook of Discrete and Computational Geometry, 2nd edition, (J.E. Goodman and J. O'Rourke, eds.), CRC Press, Boca Raton, 2004, 219-238. [173] Distinct distances in three and higher dimensions (with B. Aronov, M. Sharir, and G. Tardos), Thirty-Fifth Annual ACM Symposium on Theory of Computing (STOC 03), 541-546. Also in: Combinatorics, Probability and Computing 13 (2004), 283-293. [174] Conflict free colorings (with G. Tóth), in: Discrete and Computational Geometry - The Goodman-Pollack Festschrift (S. Basu et al, eds.), Springer Verlag, Berlin, 2003, 665-671. [175] Relaxing planarity for topological graphs (with R. Radoičić and G. Tóth), in: Discrete and Computational Geometry (J. Akiyama, M. Kano, eds.), Lecture Notes in Computer Science 2866, Springer-Verlag, Berlin, 2003, 221-232. Also in: Finite and Infinite Combinatorics (E. Győri and G. O. H. Katona, eds.), Bolyai Society Mathematical Studies 15, J. Bolyai Mathematical Society, Budapest, 2006, 285-300. |
|