 On Erdős–Szekerestype problems for kconvex point sets (with S. Bhore, L. MartínezSandoval, and P. Valtr), submitted.
 Minimal geometric graph representations of order types (with O. Aichholzer, M. Hoffmann, J. Kynčl, W. Mulzer, I. Parada, A. Pilz, M. Scheucher, P. Valtr, B. Vogtenhuber, and E. Welzl), in preparation.
 Extended abstract in 34th European Workshop on Computational Geometry (EuroCG 2018), pages 21:1–21:6, 2018. [booklet of abstracts]
 Ramsey numbers and monotone colorings, submitted.
 Almostequidistant sets (with A. Pór, M. Scheucher, K. Swanepoel, and P. Valtr), submitted. [preliminary version  supplementary data]
 Extended abstract in 34th European Workshop on Computational Geometry (EuroCG 2018), pages 19:1–19:6, 2018. [booklet of abstracts]
 Induced Ramseytype results and binary predicates for point sets (with J. Kynčl, S. Langerman, and A. Pilz), The Electronic Journal of Combinatorics 24, Issue 4, P4.24, 22 pages, 2017. [link  presentation]
 Extended abstract in Electronic Notes in Discrete Mathematics 61, pages 77–83, 2017. [DOI]
 A superlinear lower bound on the number of 5holes (with O. Aichholzer, T. Hackl, J. Kynčl, I. Parada, M. Scheucher, P. Valtr, and B. Vogtenhuber), submitted. [preliminary version  supplementary data  presentation]
 Conference version in the Proceedings of the 33rd International Symposium on Computational Geometry (SoCG 2017), Leibniz International Proceedings in Informatics (LIPIcs) 77, pages 8:1–8:16, 2017. [DOI]
 Covering lattice points by subspaces and counting pointhyperplane incidences (with J. Cibulka and P. Valtr), to appear in Discrete and Computational Geometry. [DOI  presentation]
 Conference version in the Proceedings of the 33rd International Symposium on Computational Geometry (SoCG 2017), Leibniz International Proceedings in Informatics (LIPIcs) 77, pages 12:1–12:16, 2017. [DOI]
 Holes in 2convex point sets (with O. Aichholzer, T. Hackl, A. Pilz, P. Ramos, B. Vogtenhuber, and P. Valtr), to appear in Computational Geometry: Theory and Applications. [presentation]
 Conference version in the Proccedings of the 28th International Workshop on Combinatorial Algorithms (IWOCA 2017), Lecture Notes in Computer Science, vol 10765. Springer, Cham, pages 169–181, 2018. [DOI]
 Extended abstract in the proceedings of the 32th European Workshop on Computational Geometry (EuroCG 2016), pages 263–266, 2016. [booklet of abstracts]
 On ordered Ramsey numbers of boundeddegree graphs (with V. Jelínek and P. Valtr), to appear in Journal of Combinatorial Theory, Series B. [DOI  presentation]
 Drawing graphs using a small number of obstacles (with J. Cibulka and P. Valtr), Discrete and Computational Geometry 59(1), pages 143–164, 2018. [DOI  presentation]
 Conference version in the Proceedings of 23rd International Symposium on Graph Drawing & Network Visualization (Graph Drawing 2015), Lecture Notes in Computer Science, pages 360–372, 2015. [DOI  best paper award]
 Bounding the pseudolinear crossing number of K_{n} via simulated annealing (with J. Kynčl), in preparation. [supplementary data  presentation]
 Extended abstract in the (informal) Proceedings of the XVI Spanish Meeting on Computational Geometry, pages 37–40, 2015. [booklet of abstracts]
 A SAT attack on the Erdős–Szekeres conjecture (with P. Valtr), European Journal of Combinatorics 66, pages 13–23, 2017. [DOI  supplementary data  presentation]
 Extended abstract in Electronic Notes in Discrete Mathematics 49, pages 425–431, 2015. [DOI]
 On the Beer index of convexity and its variants (with V. Jelínek, P. Valtr, and B. Walczak), Discrete and Computational Geometry 57(1), pages 179–214, 2017. [DOI  presentation]
 Conference version in the Proceedings of the 31st International Symposium on Computational Geometry (SoCG 2015), Leibniz International Proceedings in Informatics (LIPIcs) 34, pages 406–420, 2015. [DOI]
 Ramsey numbers of ordered graphs (with J. Cibulka, K. Král, and J. Kynčl), submitted. [preliminary version  supplementary data  presentation].
 Extended abstract in Electronic Notes in Discrete Mathematics 49, pages 419–424, 2015. [DOI]
 Crossing numbers and combinatorial characterization of monotone drawings of K_{n} (with R. Fulek and J. Kynčl), Discrete and Computational Geometry 53(1), pages 107–143, 2015. [DOI  presentation]
 Monotone crossing number of complete graphs (with R. Fulek and J. Kynčl), extended abstract in the (informal) Proceedings of the XV Spanish Meeting on Computational Geometry, pages 127–130, 2013. [booklet of abstracts]
 Bounded representations of interval and proper interval graphs (with P. Klavík and Y. Otachi), Lecture Notes in Computer Science, ISAAC, pages 8283535–546, 2013. [DOI]
 Grid representations and the chromatic number, Computational Geometry: Theory and Applications 46(8), pages 990–1002, 2013. [DOI]
 Reprint in Computational Geometry: Theory and Applications 47(3), pages 480–492, 2014. [DOI]
 Extended abstract in 28th European Workshop on Computational Geometry (EuroCG 2012), pages 45–48, 2012. [booklet of abstracts]
 Conference version in the Proceedings of the 12th International Symposium on Graph Drawing (Graph Drawing 2012), Lecture Notes in Computer Science 7704, pages 315–326, 2013. [DOI]
