List of publications
If you are interested in some of the papers and don't have access to it,
just send me an email and I will send you a copy.
The list of (most of the) publications in bibtex.
Submitted / In preparation:
 Better upper bounds on the FürediHajnal limits of permutations
(with J. Kynčl),
Extended abstract:
Proceedings of the TwentyEighth Annual ACMSIAM Symposium on Discrete Algorithms (SODA 2017), 22802293.
arXiv preprint
Presentation.
 Ramsey numbers of ordered graphs.
(with M. Balko, K. Král, and J. Kynčl), submitted.
Extended abstract:
Proceedings of The Eight European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2015), Electronic Notes in Discrete Mathematics 49 (2015), 419424
arXiv preprint
supplementary data,
 On planar point sets with the pentagon property
(with J. Kynčl and P. Valtr), in preparation.
extended abstract published in: SoCG '13 Proceedings of the twentyninth annual symposium on Computational geometry, 2013.
Presentation.
Published:

Covering lattice points by subspaces and counting pointhyperplane incidences
(with M. Balko, and P. Valtr),
to appear in Discrete and Computational Geometry.
Extended abstract (SoCG 2017),
DOI,
arXiv preprint.

Drawing graphs using a small number of obstacles.
(with M. Balko and P. Valtr).
Discrete and Computational Geometry 59 (1): 143164 (2018).
DOI,
Extended abstract (GD 2014, best paper award),
arXiv preprint.

Peeling Potatoes NearOptimally in NearLinear Time.
(with S. Cabello, J. Kynčl, M. Saumell, P. Valtr),
SIAM Journal on Computing, 46(5), 1574–1602.
Extended abstract (SOCG'14),
arXiv preprint

On three measures of nonconvexity
(with M. Korbelář, J. Kynčl, V. Mészáros, R. Stolař and P. Valtr),
Israel Journal of Mathematics 218(1), 331369 (2017).
DOI.
arXiv preprint.
Preliminary version (On Three Parameters of Invisibility Graphs, COCOON 2010),
Presentation.

Threemonotone interpolation
(with J. Matoušek and P. Paták),
Discrete and Computational Geometry 54 (1): 321 (2015).
arXiv preprint.

On the Geometric Ramsey Number of Outerplanar Graphs
(with P. Gao, M. Krčál, T. Valla and P. Valtr),
Discrete and Computational Geometry 53 (1): 6479 (2015).
arXiv preprint,
extended abstract (EuroComb 2013).
 A Combinatorial Proof of Rayleigh Monotonicity for Graphs
(with J. Hladký, M.A. LaCroix, D.G. Wagner),
Ars Combinatoria 117 (2014), 333348.
arXiv preprint

Graph sharing games: complexity and connectivity
(with J. Kynčl, V. Mészáros, R. Stolař and P. Valtr),
Theor. Comput. Sci. 494 (2013), 4962.
arXiv preprint,
extended abstract (TAMC 2010).

Maximum size of reversefree sets of permutations,
SIAM J. Discrete Math., 27 (1), 232239 (2013).
arXiv preprint.

Universal Sets for StraightLine Embeddings of Bicolored Graphs
(with J. Kynčl, V. Mészáros, R. Stolař and P. Valtr),
J. Pach (Ed.), Thirty Essays on Geometric Graph Theory,
pp. 101119, Springer, 2013, ISBN 9781461401094.
arXiv preprint.
Preliminary version:
Hamiltonian alternating paths on bicolored doublechains
in: Graph Drawing 2008,
Lecture Notes in Computer Science 5417, 181192, Springer, Berlin, 2009.

Tight bounds on the maximum size of a set of permutations with bounded VCdimension
(with J. Kynčl),
Journal of Combinatorial Theory, Series A 119 (7), 14611478 (2012).
arXiv preprint, Presentation.

Polynomialtime sortable stacks of burnt pancakes
(with A. Labarre),
Theor. Comput. Sci. 412, Issues 810, Pages 695702 (2011).
arXiv preprint

On Average and Highest Number of Flips in Pancake Sorting ,
Theor. Comput. Sci. 412, Issues 810, Pages 822834 (2011).
arXiv preprint,
source codes and data mentioned in the paper
 Solution of Peter Winkler's pizza problem
(with J. Kynčl, V. Mészáros, R. Stolař and P. Valtr),
in: Fete of Combinatorics and Computer Science,
pp. 6393, Springer, 2010, ISBN 9783642135798.
arXiv preprint,
source codes mentioned in
the paper ,
Extended abstract (IWOCA 2009).

Untangling polygons and graphs,
Discrete and Computational Geometry 43 (2): 402411 (2010).
arXiv preprint,
Extended abstract (TGGT 2008).

On constants in the FürediHajnal and the StanleyWilf Conjecture,
Journal of Combinatorial Theory, Series A 116 (2), 290302 (2009).
 On the chromatic number of real and rational spaces,
Geombinatorics 18, 5366 (2008).
The results of the paper except for the lower bound for Q^5 appeared in
my diploma thesis.
Computer program used for deriving lower bounds on Q^5 and Q^7.
Thesis:
 Extremal combinatorics of matrices,
sequences and sets of permutations. Ph.D. thesis, 2013.
Programs and data mentioned in the thesis.
Other:
 Editor of DIMACSDIMATIA International REU Research Experience for Undergraduates 2012, IUUK–ITI series 2012569.