Grid Drawings and the Chromatic Number. - Martin Balko (GD, 2012)

Bounded Representations of Interval and Proper Interval Graphs. - Martin Balko; Pavel Klavík; Yota Otachi (ISAAC, 2013)

Grid representations and the chromatic number. - Martin Balko (Comput. Geom., 2013)

Crossing numbers and combinatorial characterization of monotone drawings of $K_n$. - Martin Balko; Radoslav Fulek; Jan Kyncl (CoRR, 2013)

Reprint of: Grid representations and the chromatic number. - Martin Balko (Comput. Geom., 2014)

Crossing Numbers and Combinatorial Characterization of Monotone Drawings of $$K_n$$ K n. - Martin Balko; Radoslav Fulek; Jan Kyncl (Discret. Comput. Geom., 2015)

Ramsey numbers of ordered graphs. - Martin Balko; Josef Cibulka; Karel Král 002; Jan Kyncl (Electron. Notes Discret. Math., 2015)

A SAT attack on the Erdős-Szekeres conjecture. - Martin Balko; Pavel Valtr 001 (Electron. Notes Discret. Math., 2015)

On the Beer Index of Convexity and Its Variants. - Martin Balko; Vít Jelínek; Pavel Valtr 001; Bartosz Walczak (Discret. Comput. Geom., 2017)

Induced Ramsey-type results and binary predicates for point sets. - Martin Balko; Jan Kyncl; Stefan Langerman; Alexander Pilz (Electron. Notes Discret. Math., 2017)

Holes in 2-convex point sets. - Oswin Aichholzer; Martin Balko; Thomas Hackl; Alexander Pilz; Pedro Ramos 001; Pavel Valtr 001; Birgit Vogtenhuber (Comput. Geom., 2018)

Drawing Graphs Using a Small Number of Obstacles. - Martin Balko; Josef Cibulka; Pavel Valtr 001 (Discret. Comput. Geom., 2018)

Big Ramsey degrees of 3-uniform hypergraphs. - Martin Balko; David Chodounský; Jan Hubicka; Matej Konecný; Lluís Vena (CoRR, 2019)

Covering Lattice Points by Subspaces and Counting Point-Hyperplane Incidences. - Martin Balko; Josef Cibulka; Pavel Valtr 001 (Discret. Comput. Geom., 2019)

Ramsey numbers and monotone colorings. - Martin Balko (J. Comb. Theory A, 2019)

On ordered Ramsey numbers of bounded-degree graphs. - Martin Balko; Vít Jelínek; Pavel Valtr 001 (J. Comb. Theory B, 2019)

On Erdős-Szekeres-type problems for k-convex point sets. - Martin Balko; Sujoy Bhore; Leonardo Martínez-Sandoval; Pavel Valtr 001 (Eur. J. Comb., 2020)

Edge-ordered Ramsey numbers. - Martin Balko; Máté Vizer (Eur. J. Comb., 2020)

Almost-Equidistant Sets. - Martin Balko; Attila Pór; Manfred Scheucher; Konrad J. Swanepoel; Pavel Valtr 001 (Graphs Comb., 2020)

A superlinear lower bound on the number of 5-holes. - Oswin Aichholzer; Martin Balko; Thomas Hackl; Jan Kyncl; Irene Parada; Manfred Scheucher; Pavel Valtr 001; Birgit Vogtenhuber (J. Comb. Theory A, 2020)

Minimal Representations of Order Types by Geometric Graphs. - Oswin Aichholzer; Martin Balko; Michael Hoffmann 001; Jan Kyncl; Wolfgang Mulzer; Irene Parada; Alexander Pilz; Manfred Scheucher; Pavel Valtr 001; Birgit Vogtenhuber; Emo Welzl (J. Graph Algorithms Appl., 2020)

Implementation of Sprouts: A Graph Drawing Game. - Tomás Cízek; Martin Balko (GD, 2021)

Big Ramsey degrees of the generic partial order. - Martin Balko; David Chodounský; Natasha Dobrinen; Jan Hubicka; Matej Konecný; Lluís Vena; Andy Zucker (CoRR, 2021)

Big Ramsey degrees and forbidden cycles. - Martin Balko; David Chodounský; Jan Hubicka; Matej Konecný; Jaroslav Nesetril; Lluís Vena (CoRR, 2021)

Big Ramsey Degrees of 3-Uniform Hypergraphs Are Finite. - Martin Balko; David Chodounský; Jan Hubicka; Matej Konecný; Lluís Vena (Comb., 2022)

Hypergraph Based Berge Hypergraphs. - Martin Balko; Dániel Gerbner; Dong Yeap Kang; Younjin Kim; Cory Palmer (Graphs Comb., 2022)

Holes and islands in random point sets. - Martin Balko; Manfred Scheucher; Pavel Valtr 001 (Random Struct. Algorithms, 2022)

On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs. - Martin Balko; Máté Vizer (SIAM J. Discret. Math., 2022)

Characterisation of the big Ramsey degrees of the generic partial order. - Martin Balko; David Chodounský; Natasha Dobrinen; Jan Hubicka; Matej Konecný; Lluís Vena; Andy Zucker (CoRR, 2023)

Ramsey theorem for trees with successor operation. - Martin Balko; David Chodounský; Natasha Dobrinen; Jan Hubicka; Matej Konecný; Jaroslav Nesetril; Andy Zucker (CoRR, 2023)

On off-diagonal ordered Ramsey numbers of nested matchings. - Martin Balko; Marian Poljak (Discret. Math., 2023)

Tight bounds on the expected number of holes in random point sets. - Martin Balko; Manfred Scheucher; Pavel Valtr 001 (Random Struct. Algorithms, 2023)

The constant of point-line incidence constructions. - Martin Balko; Adam Sheffer; Ruiwen Tang (Comput. Geom., 2023)

On the Uncrossed Number of Graphs. - Martin Balko; Petr Hlinený; Tomás Masarík; Joachim Orthaber; Birgit Vogtenhuber; Mirko H. Wagner (GD, 2024)

On Ordered Ramsey Numbers of Matchings Versus Triangles. - Martin Balko; Marian Poljak (Electron. J. Comb., 2024)

Bounding and Computing Obstacle Numbers of Graphs. - Martin Balko; Steven Chaplick; Robert Ganian; Siddharth Gupta 002; Michael Hoffmann 001; Pavel Valtr 001; Alexander Wolff 001 (SIAM J. Discret. Math., 2024)

On Helly numbers of exponential lattices. - Gergely Ambrus; Martin Balko; Nóra Frankl; Attila Jung; Márton Naszódi (Eur. J. Comb., 2024)

Erdős-Szekeres-Type Problems in the Real Projective Plane. - Martin Balko; Manfred Scheucher; Pavel Valtr 001 (Discret. Comput. Geom., 2024)

The Erdős-Szekeres Conjecture Revisited. - Jineon Baek; Martin Balko (SoCG, 2025)

Faces in rectilinear drawings of complete graphs. - Martin Balko; Anna Brötzner; Fabian Klute; Josef Tkadlec (Eur. J. Comb., 2025)

A Survey on Ordered Ramsey Numbers. - Martin Balko (CoRR, 2025)