Martin Balko


Teaching (In Czech)  |  Short CV  |  Contact  |  Publications

photo
I am an assistant professor at the Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University in Prague. Before that I was a postdoctoral researcher at the Department of Computer Science, Faculty of Natural Sciences, Ben Gurion University of the Negev, Beer Sheva, Israel. I was also a postdoctoral researcher at Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, Budapest, Hungary. I obtained my PhD degree at Charles University in Prague, Czech Republic, under the supervision of Pavel Valtr.

My research interests include graph theory, classical combinatorics, Ramsey theory, and combinatorial geometry.

Office hours: by e-mail appointment


Teaching (Výuka):
up

Short CV:
up

Contact:
up
 
Department of Applied Mathematics
Faculty of Mathematics and Physics, Charles University in Prague
Malostranské nám. 25, 118 00 Praha 1
Czech Republic


Room S 125, 1st floor, Malá Strana
e-mail: balko (AT) kam.mff.cuni.cz

Publications:
up
  • Hypergraph based Berge hypergraphs (with Dániel Gerbner, Dong Yeap Kang, Younjin Kim, and Cory Palmer), submitted. [preliminary version]
  • Big Ramsey degrees of 3-uniform hypergraphs (with David Chodounský, Jan Hubička, Matěj Konečný, and Lluís Vena), in preparation. [preliminary version]
    • Extended abstract in Acta Mathematica Universitatis Comenianae 88(3), pages 415–422, 2019. [link]
  • Edge-ordered Ramsey numbers (with Máté Vizer), submitted. [preliminary version]
    • Extended abstract in Acta Mathematica Universitatis Comenianae 88(3), pages 409–414, 2019. [link]
  • On Erdős–Szekeres-type problems for k-convex point sets (with Sujoy Bhore, Leonardo Martínez-Sandoval, and Pavel Valtr), submitted.
    • Conference version in the Proceedings of the 30th International Workshop on Combinatorial Algorithms (IWOCA 2019), Lecture Notes in Computer Science, vol 11638. Springer, Cham, pages 35–47, 2019. [DOI]
  • Minimal geometric graph representations of order types (with Oswin Aichholzer, Michael Hoffmann, Jan Kynčl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, and Emo Welzl), submitted. [preliminary version]
    • Conference version to appear in the Proceedings of 27th International Symposium on Graph Drawing & Network Visualization (Graph Drawing 2019).
    • 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, Journal of Combinatorial Theory, Series A 163, pages 34–58, 2019. [DOI | presentation]
  • Almost-equidistant sets (with Attila Pór, Manfred Scheucher, Konrad Swanepoel, and Pavel 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 Ramsey-type results and binary predicates for point sets (with Jan Kynčl, Stefan Langerman, and Alexander 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 5-holes (with Oswin Aichholzer, Thomas Hackl, Jan Kynčl, Irene Parada, Manfred Scheucher, Pavel Valtr, and Birgit Vogtenhuber), accepted to Journal of Combinatorial Theory, Series A, 2019. [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 point-hyperplane incidences (with Josef Cibulka and Pavel Valtr), Discrete and Computational Geometry 62(1), pages 325–354, 2019. [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 2-convex point sets (with Oswin Aichholzer, Thomas Hackl, Alexander Pilz, Pedro Ramos, Birgit Vogtenhuber, and Pavel Valtr), Computational Geometry: Theory and Applications 74, pages 38–49, 2018. [DOI | presentation]
    • Conference version in the Proceedings 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 bounded-degree graphs (with Vít Jelínek and Pavel Valtr), Journal of Combinatorial Theory, Series B 134, pages 179–202, 2019. [DOI | presentation]
  • Drawing graphs using a small number of obstacles (with Josef Cibulka and Pavel 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 Kn via simulated annealing (with Jan 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 Pavel 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ít Jelínek, Pavel Valtr, and Bartosz 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 Josef Cibulka, Karel Král, and Jan Kynčl), accepted to The Electronic Journal of Combinatorics, 2019. [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 Kn (with Radoslav Fulek and Jan Kynčl), Discrete and Computational Geometry 53(1), pages 107–143, 2015. [DOI | presentation]
    • Monotone crossing number of complete graphs (with Radoslav Fulek and Jan 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 Pavel Klavík and Yota Otachi), Lecture Notes in Computer Science, ISAAC, pages 8283-535–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]

Valid XHTML 1.0 Transitional