33 citations · 160 across the 17 of their papers we have counts for
18 papers
Covering lattice points by subspaces and counting point-hyperplane incidences
Martin Balko, Josef Cibulka, Pavel Valtr
Let and be integers with . Let be a -dimensional lattice and let be a -dimensional compact convex body symmetric about the origin. We provi…
Drawing graphs using a small number of obstacles
Martin Balko, Josef Cibulka, Pavel Valtr
An obstacle representation of a graph is a set of points in the plane representing the vertices of , together with a set of polygonal obstacles such that two vertices of …
Better upper bounds on the Füredi-Hajnal limits of permutations
Josef Cibulka, Jan Kynčl
A binary matrix is a matrix with entries from the set . We say that a binary matrix contains a binary matrix if can be obtained from by removal of some row…
On three measures of non-convexity
Josef Cibulka, Miroslav Korbelář, Jan Kynčl +3
The invisibility graph of a set is a (possibly infinite) graph whose vertices are the points of and two vertices are connected by an edge if a…
Peeling potatoes near-optimally in near-linear time
Sergio Cabello, Josef Cibulka, Jan Kynčl +2
We consider the following geometric optimization problem: find a convex polygon of maximum area contained in a given simple polygon with vertices. We give a randomized near…
Three-monotone interpolation
Josef Cibulka, Jiří Matoušek, Pavel Paták
A function is called \emph{-monotone} if it is -times differentiable and its nd derivative is convex. A point set $P\subset\mathbb R…