30 citations · 208 across the 26 of their papers we have counts for
4 papers · 1 filter
Irreversible 2-conversion set in graphs of bounded degree
Jan Kynčl, Bernard Lidický, Tomáš Vyskočil
An irreversible -threshold process (also a -neighbor bootstrap percolation) is a dynamic process on a graph where vertices change color from white to black if they have at le…
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…
Bounds for Pach's selection theorem and for the minimum solid angle in a simplex
Roman Karasev, Jan Kynčl, Pavel Paták +2
We estimate the selection constant in the following geometric selection theorem by Pach: For every positive integer there is a constant such that whenever $X_1,..., X…