List of my publications

1. Tight bounds on the maximum size of a set of permutations with bounded VC-dimension (with J. Kynčl), Journal of Combinatorial Theory, Series A 119 (7), 1461-1478 (2012). DOI, preprint at arXiv, Presentation.
2. Polynomial-time sortable stacks of burnt pancakes (with A. Labarre), Theor. Comput. Sci. 412, Issues 8-10, Pages 695-702 (2011). DOI , preprint at arXiv
3. On Average and Highest Number of Flips in Pancake Sorting , Theor. Comput. Sci. 412, Issues 8-10, Pages 822-834 (2011). DOI, preprint at arXiv, source codes and data mentioned in the paper
4. On three parameters of invisibility graphs (with J. Kyncl, V. Meszaros, R. Stolar and P. Valtr), extended abstract in: Computing and Combinatorics (proceedings of COCOON 2010), Lecture Notes in Computer Science 6196, 192-198, Springer, Berlin, 2010. DOI
5. Graph sharing games: complexity and connectivity (with J. Kyncl, V. Meszaros, R. Stolar and P. Valtr), extended abstract in: TAMC 2010, Springer LNCS 6108, 340-349, 2010. DOI
6. Solution of Peter Winkler's pizza problem (with J. Kyncl, V. Meszaros, R. Stolar and P. Valtr), in: Fete of Combinatorics and Computer Science, pp. 63-93, Springer, 2010, ISBN 978-3-642-13579-8. Extended abstract in: Combinatorial Algorithms (proceedings of IWOCA 2009), Lecture Notes in Computer Science 5874, 356-367, Springer, Berlin, 2009. DOI , preprint at arXiv, source codes mentioned in the paper
7. Elementary proof of Rayleigh formula for graphs (with J. Hladky, M.A. LaCroix, D.G. Wagner), preprint at arXiv
8. Universal Sets for Straight-Line Embeddings of Bicolored Graphs (with J. Kyncl, V. Meszaros, R. Stolar and P. Valtr), submitted, preliminary version: Hamiltonian alternating paths on bicolored double-chains (with J. Kyncl, V. Meszaros, R. Stolar and P. Valtr), in: Graph Drawing 2008, Lecture Notes in Computer Science 5417, 181-192, Springer, Berlin, 2009. DOI
9. Untangling polygons and graphs, Discrete and Computational Geometry 43 (2): 402-411 (2010). DOI , preprint at arXiv
10. On constants in the Furedi-Hajnal and the Stanley-Wilf Conjecture, Journal of Combinatorial Theory, Series A 116 (2), 290-302 (2009). DOI
11. On the chromatic number of real and rational spaces, Geombinatorics 18, 53-66 (2008). The results of the paper except for a lower bound for Q^5 appeared in my diploma thesis. The proof of the lower bound 8 for Q^5 is similar to the proof for Q^7, the set of points used can be deduced from this computer program.