30 citations · 65 across the 19 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
math.CO2018★ 1 cited
A Note on a Picture-Hanging Puzzle
Radoslav Fulek, Sergey Avvakumov
In the picture-hanging puzzle we are to hang a picture so that the string loops around nails and the removal of any nail results in a fall of the picture. We show that the leng…
cs.CG2018
The Crossing Tverberg Theorem
Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii +2
Tverberg's theorem is one of the cornerstones of discrete geometry. It states that, given a set of at least points in , one can find a partition $X=…
cs.CG2018
Crossing Minimization in Perturbed Drawings
Radoslav Fulek, Csaba D. Tóth
Due to data compression or low resolution, nearby vertices and edges of a graph drawing may be bundled to a common node or arc. We model such a `compromised' drawing by a piecewise…