Hamiltonian Alternating Paths on Bicolored Double-Chains. - Josef Cibulka; Jan Kyncl; Viola Mészáros; Rudolf Stolar; Pavel Valtr 001 (GD, 2008)

Untangling polygons and graphs. - Josef Cibulka (Electron. Notes Discret. Math., 2008)

Solution of Peter Winkler's Pizza Problem. - Josef Cibulka; Jan Kyncl; Viola Mészáros; Rudolf Stolar; Pavel Valtr 001 (IWOCA, 2009)

Average number of flips in pancake sorting - Josef Cibulka (CoRR, 2009)

On constants in the Füredi-Hajnal and the Stanley-Wilf conjecture. - Josef Cibulka (J. Comb. Theory A, 2009)

On Three Parameters of Invisibility Graphs. - Josef Cibulka; Jan Kyncl; Viola Mészáros; Rudolf Stolar; Pavel Valtr 001 (COCOON, 2010)

Universal Sets for Straight-Line Embeddings of Bicolored Graphs - Josef Cibulka; Jan Kyncl; Viola Mészáros; Rudolf Stolar; Pavel Valtr 001 (CoRR, 2011)

On average and highest number of flips in pancake sorting. - Josef Cibulka (Theor. Comput. Sci., 2011)

Polynomial-time sortable stacks of burnt pancakes. - Anthony Labarre; Josef Cibulka (Theor. Comput. Sci., 2011)

Tight bounds on the maximum size of a set of permutations with bounded VC-dimension. - Josef Cibulka; Jan Kyncl (J. Comb. Theory A, 2012)

On planar point sets with the pentagon property. - Josef Cibulka; Jan Kyncl; Pavel Valtr 001 (SoCG, 2013)

Maximum Size of Reverse-Free Sets of Permutations. - Josef Cibulka (SIAM J. Discret. Math., 2013)

Graph sharing games: Complexity and connectivity. - Josef Cibulka; Jan Kyncl; Viola Mészáros; Rudolf Stolar; Pavel Valtr 001 (Theor. Comput. Sci., 2013)

A Combinatorial Proof Of Rayleigh Monotonicity For Graphs. - Josef Cibulka; Jan Hladký; Michael A. La Croix; David G. Wagner (Ars Comb., 2014)

On the Geometric Ramsey Number of Outerplanar Graphs. - Josef Cibulka; Pu Gao; Marek Krcál; Tomás Valla; Pavel Valtr 001 (Discret. Comput. Geom., 2015)

Three-Monotone Interpolation. - Josef Cibulka; Jirí Matousek 001; Pavel Paták (Discret. Comput. Geom., 2015)

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

Füredi-Hajnal limits are typically subexponential. - Josef Cibulka; Jan Kyncl (CoRR, 2016)

Better upper bounds on the Füredi-Hajnal limits of permutations. - Josef Cibulka; Jan Kyncl (SODA, 2017)

Peeling Potatoes Near-Optimally in Near-Linear Time. - Sergio Cabello; Josef Cibulka; Jan Kyncl; Maria Saumell; Pavel Valtr 001 (SIAM J. Comput., 2017)

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

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