Martin Balko


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

I am currently a postdoctoral researcher at Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, Budapest. I obtained my PhD degree at the Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic, under the supervision of Pavel Valtr.

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


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. 2/25, 118 00 Praha 1
Czech Republic

e-mail: balko (AT) kam.mff.cuni.cz

Publications:
up
  • A superlinear lower bound on the number of 5-holes (with O. Aichholzer, T. Hackl, J. Kynčl, I. Parada, M. Scheucher, P. Valtr, and B. Vogtenhuber), submitted. [supplementary data]
  • Covering lattice points by subspaces and counting point-hyperplane incidences (with J. Cibulka and P. Valtr), submitted.
  • Holes in 2-convex sets (with O. Aichholzer, T. Hackl, A. Pilz, P. Ramos, B. Vogtenhuber, and P. Valtr), in preparation. [presentation]
    • Extended abstract in 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. Jelínek and P. Valtr), submitted. [preliminary version | presentation]
  • Drawing graphs using a small number of obstacles (with J. Cibulka and P. Valtr), submitted. [preliminary version | presentation]
    • Extended abstract 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 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), submitted. [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), accepted to Discrete and Computational Geometry, 2016. [DOI | preliminary version | presentation]
    • Extended abstract 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 number and combinatorial characterization of monotone drawings of Kn (with R. Fulek and J. Kynčl), Discrete and Computational Geometry 53(1), pages 107-143, 2015. [DOI | presentation]
    • 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 46(8), pages 990-1002, 2013. [DOI]
    • Extended abstract in 28th European Workshop on Computational Geometry (EuroCG 2012), pages 45-48, 2012. [booklet of abstracts]
    • Extended abstract in the Proceedings of the 12th International Symposium on Graph Drawing (Graph Drawing 2012), Lecture Notes in Computer Science 7704, pages 315-323, 2012. [DOI]

Valid XHTML 1.0 Transitional