Josef Cibulka

According to our database, Josef Cibulka authored at least 22 papers between 2008 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2017

Better upper bounds on the Füredi-Hajnal limits of permutations.

Josef Cibulka, Jan Kyncl

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Covering Lattice Points by Subspaces and Counting Point-Hyperplane Incidences.

Martin Balko, Josef Cibulka, Pavel Valtr

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016

Füredi-Hajnal limits are typically subexponential.

Josef Cibulka, Jan Kyncl

CoRR, 2016

2015

Ramsey numbers of ordered graphs.

Martin Balko, Josef Cibulka, Karel Král, Jan Kyncl

Electron. Notes Discret. Math., 2015

Three-Monotone Interpolation.

Josef Cibulka, Jirí Matousek, Pavel Paták

Discret. Comput. Geom., 2015

On the Geometric Ramsey Number of Outerplanar Graphs.

Josef Cibulka, Pu Gao, Marek Krcál, Tomás Valla, Pavel Valtr

Discret. Comput. Geom., 2015

Drawing Graphs Using a Small Number of Obstacles.

Martin Balko, Josef Cibulka, Pavel Valtr

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

2014

A Combinatorial Proof Of Rayleigh Monotonicity For Graphs.

Josef Cibulka, Jan Hladký, Michael A. La Croix, David G. Wagner

Ars Comb., 2014

Peeling Potatoes Near-Optimally in Near-Linear Time.

Sergio Cabello, Josef Cibulka, Jan Kyncl, Maria Saumell, Pavel Valtr

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013

Maximum Size of Reverse-Free Sets of Permutations.

Josef Cibulka

SIAM J. Discret. Math., 2013

On planar point sets with the pentagon property.

Josef Cibulka, Jan Kyncl, Pavel Valtr

Proceedings of the Symposium on Computational Geometry 2013, 2013

2012

Tight bounds on the maximum size of a set of permutations with bounded VC-dimension.

Josef Cibulka, Jan Kyncl

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011

Polynomial-time sortable stacks of burnt pancakes.

Anthony Labarre, Josef Cibulka

Theor. Comput. Sci., 2011

On average and highest number of flips in pancake sorting.

Josef Cibulka

Theor. Comput. Sci., 2011

Universal Sets for Straight-Line Embeddings of Bicolored Graphs

Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr

CoRR, 2011

2010

Graph Sharing Games: Complexity and Connectivity.

Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

On Three Parameters of Invisibility Graphs.

Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr

Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2009

On constants in the Füredi-Hajnal and the Stanley-Wilf conjecture.

Josef Cibulka

J. Comb. Theory A, 2009

Average number of flips in pancake sorting

Josef Cibulka

CoRR, 2009

Solution of Peter Winkler's Pizza Problem.

Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008

Untangling polygons and graphs.

Josef Cibulka

Electron. Notes Discret. Math., 2008

Hamiltonian Alternating Paths on Bicolored Double-Chains.

Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr

Proceedings of the Graph Drawing, 16th International Symposium, 2008