[251] "Square trisection": Dissection of a square in three congruent partitions (with Ch. Blanvillain), Bull. d'Informatique Approfondie et Appls. 86 (2010), 7-17.



[252] Erdős-Szekeres-type theorems for monotone paths and convex bodies (with J. Fox, B. Sudakov, A. Suk), Proceedings of the London Mathematical Society 105 (2012), 953--982.



[253] Piercing quasi-rectangles--On a problem of Danzer and Rogers (with G. Tardos), Journal of Combinatorial Theory Ser. A 119 (2012), 1391--1397.



[254] Every graph admits an unambiguous bold drawing, in: Graph Drawing 2011 (M. van Kreveld, B. Speckmann, eds.), Lecture Notes in Computer Science 7034, Springer-Verlag, Berlin, 2011, 332--342.



[255] Homogeneous selections from hyperplanes (with I. Bárány), submitted.



[256] Large simplices determined by finite point sets (with F. Morić), Beiträge für Algebra und Geometrie, accepted.



[257] The number of edges of k-quasi-planar graphs (with J. Fox, A. Suk), SIAM J. Discrete Mathematics, accepted.



[258] Tangled thrackles (with R. Radoičić and G. Tóth), Geombinatorics 21 (2012), 157--169. Also in: Proc. XIV Spanish Meeting on Computational Geometry, EGC 2011 (Dedicated to Ferran Hurtado), Lecture Notes in Computer Science 7579, Springer-Verlag, Berlin, 2012, 45--53.



[259] How many potatoes are in a mesh? (with M. van Kreveld and M. Löffler), in: Proc. 28th European Workshop on Computational Geometry (EuroCG 2012), Assisi, Italy, 2012, 277--280. Also in: Proc. 23rd International Symposium on Algorithms and Computation (ISAAC 2012), Lecture Notes in Computer Science 7676, Springer-Verlag, Berlin, 2012, 166--176.



[260] Survey on decomposition of multiple coverings (with G. Tóth and D. Pálvölgyi), in: Geometry--Intuitive, Discrete, and Convex (I. Bárány, K. J. Böröczky et al., eds.), Bolyai Society Mathematical Studies, Springer-Verlag, accepted.



[261] The visible perimeter of an arrangement of disks (with G. Nivasch, G. Tardos), in: Graph Drawing 2012, Lecture Notes in Computer Science, Springer-Verlag, Berlin, accepted.



[262] The number of distinct distances from a vertex of a convex polygon (with G. Nivasch, R. Pinchasi, Sh. Zerbib), J. Computational Geometry, accepted.



[263] A note on coloring line arrangements (with E. Ackerman, R.Pinchasi, R. Radoičić, G. Tóth), Electronic J. Combinatorics, submitted.



[264] On Schur's conjecture (with F. Morić), submitted.



[265] The range of a random walk on a comb (with G. Tardos), submitted.



[266] Ramsey-type results for semi-algebraic relations (with D. Conlon, J. Fox, B. Sudakov, A. Suk), in: Proc. 29th Annual ACM Symposium on Computational Geometry (SoCG 2013), Rio de Janeiro, Brazil, 2013, accepted.



[267] The Erdős-Hajnal conjecture for rainbow triangles (with J. Fox, A. Grinshpun), submitted.



[268] The beginnings of geometric graph theory, in: Bolyai Society Mathematical Studies, accepted.



[269] Applications of a new separator theorem (with J. Fox), submitted.



[270] Two and a half billion years of distance research (with F. Morić), Geombinatorics, accepted.