Zobrazeno 1 - 10
of 48
pro vyhledávání: '"Radoslav Fulek"'
Autor:
Radoslav Fulek, Balázs Keszegh
Publikováno v:
SIAM Journal on Discrete Mathematics. 35:1964-1977
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::92d7182601d7be09d74067132543017f
https://doi.org/10.1137/20m1376327
https://doi.org/10.1137/20m1376327
Autor:
Radoslav Fulek, Jan Kynčl
Publikováno v:
Combinatorica. 39:1267-1279
We find a graph of genus $5$ and its drawing on the orientable surface of genus $4$ with every pair of independent edges crossing an even number of times. This shows that the strong Hanani-Tutte theorem cannot be extended to the orientable surface of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b233795de6c5d4adcb12084f3e9291c4
https://doi.org/10.1007/s00493-019-3905-7
https://doi.org/10.1007/s00493-019-3905-7
Autor:
Radoslav Fulek, János Pach
Publikováno v:
Discrete Applied Mathematics. 259:226-231
A {\em thrackle} is a graph drawn in the plane so that every pair of its edges meet exactly once: either at a common end vertex or in a proper crossing. We prove that any thrackle of $n$ vertices has at most $1.3984n$ edges. {\em Quasi-thrackles} are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9a9e6f248aac1f129895e683ec49a61f
https://doi.org/10.1016/j.dam.2018.12.025
https://doi.org/10.1016/j.dam.2018.12.025
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030687656
Graph Drawing
Graph Drawing
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 realizin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::32d049a50300d9e030af729f16abc7b5
https://doi.org/10.1007/978-3-030-68766-3_11
https://doi.org/10.1007/978-3-030-68766-3_11
Autor:
Csaba D. Tóth, Radoslav Fulek
Publikováno v:
SODA
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:
https://explore.openaire.eu/search/publication?articleId=doi_________::8abfdc101662f0d017649cca524f9897
https://doi.org/10.1137/1.9781611975994.175
https://doi.org/10.1137/1.9781611975994.175
Autor:
Radoslav Fulek, Csaba D. Tóth
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 polyn
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f1ca193f94b9b52c482915cd8ed84d1
http://arxiv.org/abs/1907.13086
http://arxiv.org/abs/1907.13086
Autor:
Radoslav Fulek, Csaba D. Tóth
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030044138
Graph Drawing
Graph Drawing
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 pe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6e3e4de7ef96bf36cd5073e9247052fa
https://doi.org/10.1007/978-3-030-04414-5_16
https://doi.org/10.1007/978-3-030-04414-5_16
Autor:
Radoslav Fulek, Jan Kynčl
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e43bd786da269bc3011f3d3951c2b87d
Autor:
Radoslav Fulek, János Pach
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319739144
Graph Drawing
Graph Drawing
A thrackle is a graph drawn in the plane so that every pair of its edges meet exactly once: either at a common end vertex or in a proper crossing. We prove that any thrackle of n vertices has at most 1.3984n edges. Quasi-thrackles are defined similar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::698c78d8794f08a61b6a6c2c076bf523
https://doi.org/10.1007/978-3-319-73915-1_14
https://doi.org/10.1007/978-3-319-73915-1_14