[301] Beyond the Magic Mountain (A Varázshegyen túl, in Hungarian), Érintő (Elektronikus Mat. Lapok), September 2016 and Élet \és Irodalom, August 12, 2016.
[302] On the size of kcrossfree families (with A. Kupavskii and I. Tomon), Combinatorica, accepted. [303] Controlling Lipschitz functions (with A. Kupavskii and G. Tardos), Mathematika 64 (2018), 898910. [304] Disjointness graphs of segments (with G. Tardos and G. Tóth), in: Proc. 33rd Annual Symposium on Computational Geometry (SoCG 2017), 59:115. [305] ErdősHajnal conjecture for graphs with bounded VCdimension (with J. Fox and A. Suk), in: Proc. 33rd Annual Symposium on Computational Geometry (SoCG 2017), 43:115. [306] Many touchings force many crossings (with G. Tóth), in: 25th Internat. Symposium on Graph Drawing (GD2017). Lecture Notes in Computer Science 10692, Springer, 2018, 153169. [307] Thrackles: An improved upper bound (with R. Fulek), in: 25th Internat. Symposium on Graph Drawing (GD2017). Lecture Notes in Computer Science 10692, Springer, 2018, 153169. [308] Two extensions of the ErdősSzekeres problem (with A. Holmsen, H. Nassajian Mojarrad, G. Tardos), submitted. [309] Tilings with noncongruent triangles (with A. Kupavskii and G. Tardos), European J. Combin. 73 (2018), 7280. [310] Tilings of the plane with unit area triangles of bounded diameter (with A. Kupavskii and G. Tardos), Acta Math. Hung. 155 (2018), no. 1, 175183. [311] A crossing lemma for multigraphs (with G. Tóth), in: Proc. 34th Annual Symposium on Computational Geometry (SoCG 2018), 65:113, 2018. [312] Almost all string graphs are intersection graphs of plane convex sets (with B. Reed, Y. Yuditsky), in: Proc. 34th Annual Symposium on Computational Geometry (SoCG 2018), 68:114, 2018. [313] A note on the clique chromatic number of geometric graphs (with J. Fox, A. Suk). Geombinatorics XXVIII (2018), Issue 2, 8392. [314] Tiling the plane with equilateral triangles (with G. Tardos), Geombinatorics, accepted. [315] RamseyTurán numbers for semialgebraic graphs (with J. Fox and A. Suk), submitted. [316] A stability theorem for cube tessellations (with P. Frankl), Computational Geometry 9 (2018), no. 1, 387390. [317] Planar point sets determine many pairwise crossing segments (with N. Rubin and G. Tardos), submitted. 
