Zobrazeno 1 - 10
of 152
pro vyhledávání: '"Fulek, Radoslav"'
Autor:
Fulek, Radoslav, Keszegh, Balázs
A $0$-$1$ matrix $M$ is saturating for a $0$-$1$ matrix $P$ if $M$ does not contain a submatrix that can be turned into $P$ by changing some $1$ entries to $0$ entries, and changing an arbitrary $0$ to $1$ in $M$ introduces such a submatrix in $M$. I
Externí odkaz:
http://arxiv.org/abs/2010.08256
If a graph can be drawn on the torus so that every two independent edges cross an even number of times, then the graph can be embedded on the torus.
Comment: minor corrections
Comment: minor corrections
Externí odkaz:
http://arxiv.org/abs/2009.01683
We consider the construction of a polygon $P$ with $n$ vertices whose turning angles at the vertices are given by a sequence $A=(\alpha_0,\ldots, \alpha_{n-1})$, $\alpha_i\in (-\pi,\pi)$, for $i\in\{0,\ldots, n-1\}$. The problem of realizing $A$ by a
Externí odkaz:
http://arxiv.org/abs/2008.10192
Autor:
Fulek, Radoslav, Tóth, Csaba D.
We study the atomic embeddability testing problem, which is a common generalization of clustered planarity (c-planarity, for short) and thickenability testing, and present a polynomial-time algorithm for this problem, thereby giving the first polynom
Externí odkaz:
http://arxiv.org/abs/1907.13086
Autor:
Fulek, Radoslav, Kynčl, Jan
The \emph{genus} $\mathrm{g}(G)$ of a graph $G$ is the minimum $g$ such that $G$ has an embedding on the orientable surface $M_g$ of genus $g$. A drawing of a graph on a surface is \emph{independently even} if every pair of nonadjacent edges in the d
Externí odkaz:
http://arxiv.org/abs/1903.08637
Autor:
FULEK, RADOSLAV1, TÓTH, CSABA D.2
Publikováno v:
Journal of the ACM. Mar2022, Vol. 69 Issue 2, p1-34. 34p.
Autor:
Fulek, Radoslav, Avvakumov, Sergey
In the picture-hanging puzzle we are to hang a picture so that the string loops around $n$ nails and the removal of any nail results in a fall of the picture. We show that the length of a sequence representing an element in the free group with $n$ ge
Externí odkaz:
http://arxiv.org/abs/1812.06335
Tverberg's theorem is one of the cornerstones of discrete geometry. It states that, given a set $X$ of at least $(d+1)(r-1)+1$ points in $\mathbb R^d$, one can find a partition $X=X_1\cup \ldots \cup X_r$ of $X$, such that the convex hulls of the $X_
Externí odkaz:
http://arxiv.org/abs/1812.04911
Autor:
Fulek, Radoslav, Tóth, Csaba D.
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 linear map $\varphi:G\rightarrow \mathbb{R}^2$. We wish to perturb $\
Externí odkaz:
http://arxiv.org/abs/1808.07608
Autor:
Fulek, Radoslav, Kynčl, Jan
Publikováno v:
Discrete and Computational Geometry 68 (2022), Issue 2, 425-447
A drawing of a graph on a surface is independently even if every pair of nonadjacent edges in the drawing crosses an even number of times. The $\mathbb{Z}_2$-genus of a graph $G$ is the minimum $g$ such that $G$ has an independently even drawing on t
Externí odkaz:
http://arxiv.org/abs/1803.05085