[176] How many ways can one draw a graph? (with G. Tóth), in: Graph Drawing (G. Liotta, ed.), Lecture Notes in Computer Science 2912, Springer-Verlag, Berlin, 2004, 47-58. Also in: Combinatorica 26 (2006), 559-576.


[177] A tight bound for the number of different directions in three dimensions (with R. Pinchasi and M. Sharir), 19th ACM Symposium on Computational Geometry, ACM Press, New York, 2003, 106-113. Also in: Journal of Combinatorial Theory, Ser. A 108 (2004), 1-16.



[178] Geometric Incidences (with M. Sharir), in: Towards a Theory of Geometric Graphs (J. Pach, ed.), Contemporary Mathematics, AMS, Providence, RI, 2004, 185-223.
Also in: Graph Theory, Combinatorics and Algorithms - Interdisciplinary Applications (M. Golumbic and I. Ben-Arroyo Hartman, eds.), Springer Verlag, New York, 2005, 267-292.



[179] Problem 19 (with G. Fejes Tóth and G. Tóth), in: Discrete Geometry (K. Bezdek. ed.), Marcel Dekker, Inc., New York, 2003, 454-455. Problem 365, Intersection graphs of convex sets, Discrete Mathematics 257 (2003), 602-603. Problem 367 (with G. Tóth), What is the true crossing number, Discrete Mathematics 257 (2003), 604-605.

[180] Midpoints of segments induced by a point set, Geombinatorics 13 (2003), 98-105.



[181] A generalization of quasi-planarity (with R. Radoičić and G. Tóth), in: Towards a Theory of Geometric Graphs (J. Pach, ed.), Contemporary Mathematics, AMS, Providence, RI, 2004, 177-183.



[182] Disjoint edges in topological graphs (with G. Tóth), in: Combinatorial Geometry and Graph Theory (J. Akiyama et al., eds.), Lecture Notes in Computer Science 3330, Springer-Verlag, Berlin, 2005, 133-140.



[183] Pushing squares around (with A. Dumitrescu), 20th ACM Symposium on Computational Geometry, ACM Press, New York, 2004, 116-123.
Also in: Graphs and Combinatorics 22 (2006), 37-50.



[184] Improving the Crossing Lemma by finding more crossings in sparse graphs (with R. Radoičić, G. Tardos, and G. Tóth), 20th ACM Symposium on Computational Geometry, ACM Press, New York, 2004, 68-75.
Also in: Discrete and Computational Geometry 36 (2006), 527-552.



[185] Solution of Scott's problem on the number of directions determined by a point set in 3-space (with R. Pinchasi and M. Sharir), 20th ACM Symposium on Computational Geometry, ACM Press, New York, 2004, 76-85.
Also in: Discrete and Computational Geometry 38 (2007), 399--441.



[186] Problems and results on geometric patterns (with P. Brass), in: Graph Theory and Combinatorial Optimization (D. Avis et al., eds.), Springer, 2005, 17-36.



[187] Forbidden paths and cycles in ordered graphs and matrices (with G. Tardos), Israel J. Math. 155 (2006), 309-334.



[188] Long alternating paths in bicolored point sets (with J. Kynčl and G. Tóth), in: Graph Drawing (J. Pach, ed.), Lecture Notes in Computer Science 3383, Springer-Verlag, Berlin, 2004, 340-348. Also in: Discrete Mathematics 308 (2008), 4315--4322.



[189] Crossing patterns of semi-algebraic sets (with N. Alon, R. Pinchasi, R. Radoičić, and M. Sharir), Journal of Combinatorial Theory Ser A 111 (2005), 310-326.



[190] Online conflict-free coloring for intervals (with A. Fiat, J. Matoušek, E. Mossel, M. Sharir, S. Smorodinsky, U. Wagner, and E. Welzl), ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), SIAM, Philadelphia, 2005, 545-554.
Also in: SIAM J. Computing 36 (2006), 1342-1359.



[191] A long noncrossing path among disjoint segments in the plane (with R. Pinchasi), in: Combinatorial and Computational Geometry, MSRI publications 52 (J.E. Goodman, J. Pach, E. Welzl, eds.), Cambridge University Press, 2005, 495-500.



[192] Nearly equal distances and Szemerédi's regularity lemma (with R. Radoičić and J. Vondrák), Computational Geometry: Theory and Appls. 34 (2006), 11-19.




[193] On the diameter of separated point sets with many nearly equal distances (with R. Radoičić and J. Vondrák), European J. Combinatorics 27 (2006), 1321-1332.



[194] Sliding disks in the plane (with S. Bereg and A. Dumitrescu), in: Discrete and Computational Geometry (JCDCG 2004) (J. Akiyama et al., eds.), Lecture Notes in Computer Science 3742, Springer-Verlag, Tokyo, 2005, 37-47.
Also in: International J. on Computational Geometry and Appl. 18 (2008), 373-387.



[195] The maximum number of empty congruent triangles determined by a point set (with G. Tóth and A. Dumitrescu), Revue Roumaine de Mathématiques Pures et Appliquées 50 (2005), 613-618.



[196] Crossing numbers of toroidal graphs (with G. Tóth), in: Graph Drawing 2005 (P. Healy et al., eds.), Lecture Notes in Computer Science 3843, Springer, Berlin, 2006, 334-342.
Also in: Topics in Discrete Mathematics (M. Klazar et al., eds), Algorithms and Combinatorics 26, Springer, Berlin, 2006, 581-590.



[197] The discrete charm of geometry (In memoriam László Fejes Tóth), Középiskolai Matematikai Lapok 2005/5.



[198] Directions in combinatorial geometry, Jahresbericht der Deutschen Mathematiker-Vereinigung 107 (2005), 215-225.



[199] Reconfigurations in graphs and grids (with G. Calinescu and A. Dumitrescu), Proc. LATIN '06 (Latin American Theoretical INformatics conference), Lecture Notes in Computer Science 3887, Springer, 2006, 262-273. Also in: SIAM J. Discrete Mathematics 22 (2008), 124--138.



[200] Degenerate crossing numbers (with G. Tóth), 22nd ACM Symposium on Computational Geometry, ACM Press, New York, 2006, 255-258.
Also in: Discrete and Computational Geometry 41 (2009), 376--384.