|
[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. Also in Journal of Graph Algorithms and Applications 19 (2015), 299-312. [255] Homogeneous selections from hyperplanes (with I. Bárány), Journal of Combinatorial Theory Ser. B 104 (2014), 81-87. [256] Large simplices determined by finite point sets (with F. Morić), Beiträge für Algebra und Geometrie 54 (2013), 45-57. [257] The number of edges of k-quasi-planar graphs (with J. Fox, A. Suk), SIAM J. Discrete Mathematics 27 (2013), 550-561. [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, Vol. 24, Springer-Verlag, Berlin, 2013, 219--257. [261] The visible perimeter of an arrangement of disks (with G. Nivasch, G. Tardos), in: Graph Drawing 2012, Lecture Notes in Computer Science 7704, Springer-Verlag, Berlin, 2013, 364-375. Also in: Computational Geometry: Theory and Appls. 47 (2014), 42-51. [262] The number of distinct distances from a vertex of a convex polygon (with G. Nivasch, R. Pinchasi, Sh. Zerbib), J. Computational Geometry 4 (2013), 1-12. [263] A note on coloring line arrangements (with E. Ackerman, R.Pinchasi, R. Radoičić, G. Tóth), Electronic J. Combinatorics 21 (2014), no. 2, Paper 2.23. [264] On Schur's conjecture (with F. Morić), in: Thailand-Japan Joint Conference on Computational Geometry and Graphs (TJJCCGG12), Lecture Notes in Computer Science 8296, Springer-Verlag, Berlin, 120-131, 2013. Also in: Comput. Geom.: Theory and Appls 48 (2015), no. 7, 520-527. [265] The range of a random walk on a comb (with G. Tardos), Electronic J. Combinatorics 20 (2013), p. 59. [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), ACM Press, New York, 2013, 309-318. Also in: Trans. Amer. Math. Soc. 366 (2014), no. 9, 5043-5065. [267] The Erdős-Hajnal conjecture for rainbow triangles (with J. Fox, A. Grinshpun), Journal of Combinatorial Theory, Ser B 111 (2015), 75-125. [268] The beginnings of geometric graph theory, in: Erdős Centennial (L. Lovász et al., eds.), Bolyai Society Mathematical Studies 25, Springer-Verlag, Berlin, 2013, 465-484. [269] Applications of a new separator theorem (with J. Fox), Combinatorics, Probability and Computing 23 (2014), 66-74. [270] Two and a half billion years of distance research (with F. Morić), Geombinatorics XXII (2013), Issue 4, 182-191. [271] On the upward planarity of mixed plane graphs (with F. Frati, M. Kaufmann, C. D. Tóth, D. R. Wood), in: Graph Drawing 2013, Lecture Notes in Computer Science 8242, Springer-Verlag, Berlin, 2013, 1–12. Also in: Journal of Graph Algorithms and Applications 18, no. 2 (2014), 253-279. [272] Saturated simple topological graphs (with R. Radoičić and G. Tóth), Computational Geometry: Theory and Appls. 48 (2015), 295-310. [273] Distinct distances on algebraic curves in the plane (with F. de Zeeuw), Proc. 30th Annual Symposium on Computational Geometry (SoCG 2014), ACM Press, New York, 2014, 549-557. [274] Cross-intersecting sets of vectors (with G. Tardos), Discrete and Computational Geometry and Graphs, Lecture Notes in Computer Science, Springer-Verlag 8845 (J. Akiyama. H. Ito, T. Sakai, eds.), Springer, 2014, 122-137. Also in: Graphs Combin. 31 (2015), no. 2, 477-495. [275] Weight balancing on boundaries and skeletons (with L. Barba, J. De Carufel, O. Cheong, M. Dobbins, R. Fleischer, A. Kawamura, M. Korman, Y. Okamoto, Y. Tang, T. Tokuyama, S. Verdonschot, T. Wang), Proc. 30th Annual Symposium on Computational Geometry (SoCG 2014), ACM Press, New York, 2014, 436-443. |
|