E-LIB Suche - Ergebnisse für: Fulek, Radoslav

1

The Crossing Tverberg Theorem:

Fulek, Radoslav ; Gärtner, Bernd ; Kupavskii, Andrey..
Discrete & Computational Geometry. , 2023

Link: https://doi.org/10.1007/..

2

The $$\mathbb {Z}_2$$-Genus of Kuratowski Minors:

Fulek, Radoslav ; Kynčl, Jan
Discrete & Computational Geometry. 68 (2022) 2 - p. 425-447 , 2022

Link: https://doi.org/10.1007/..

3

Atomic Embeddability, Clustered Planarity, and Thickenabili..:

Fulek, Radoslav ; Tóth, Csaba D.
Journal of the ACM. 69 (2022) 2 - p. 1-34 , 2022

Link: https://doi.org/10.1145/..

4

Polygons with Prescribed Angles in 2D and 3D:

Efrat, Alon ; Fulek, Radoslav ; Kobourov, Stephen.
Journal of Graph Algorithms and Applications. 26 (2022) 3 - p. 363-380 , 2022

Link: https://doi.org/10.7155/..

5

Saturation Problems about Forbidden 0-1 Submatrices:

Fulek, Radoslav ; Keszegh, Balázs
SIAM Journal on Discrete Mathematics. 35 (2021) 3 - p. 1964-1977 , 2021

Link: https://doi.org/10.1137/..

6

Embedding Graphs into Embedded Graphs:

Fulek, Radoslav
Algorithmica. 82 (2020) 11 - p. 3282-3305 , 2020

Link: https://doi.org/10.1007/..

7

Polygons with Prescribed Angles in 2D and 3D:

, In: Lecture Notes in Computer Science; Graph Drawing and Network Visualization,

Efrat, Alon ; Fulek, Radoslav ; Kobourov, Stephen. - p. 135-147 , 2020

Link: https://doi.org/10.1007/..

8

Crossing minimization in perturbed drawings:

Fulek, Radoslav ; Tóth, Csaba D.
Journal of Combinatorial Optimization. 40 (2020) 2 - p. 279-302 , 2020

Link: https://doi.org/10.1007/..

9

Atomic embeddability, clustered planarity, and thickenabili..:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,

Fulek, Radoslav ; Tóth, Csaba D. - p. 2876-2895 , 2020

Link: https://dl.acm.org/doi/1..

10

Thrackles: An improved upper bound:

Fulek, Radoslav ; Pach, János
Discrete Applied Mathematics. 259 (2019) - p. 226-231 , 2019

Link: https://doi.org/10.1016/..

11

Recognizing Weak Embeddings of Graphs:

Akitaya, Hugo A. ; Fulek, Radoslav ; Tóth, Csaba D.
ACM Transactions on Algorithms. 15 (2019) 4 - p. 1-27 , 2019

Link: https://doi.org/10.1145/..

12

Counterexample to an Extension of the Hanani-Tutte Theorem ..:

Fulek, Radoslav ; Kynčl, Jan
Combinatorica. 39 (2019) 6 - p. 1267-1279 , 2019

Link: https://doi.org/10.1007/..

13

Recognizing Weak Embeddings of Graphs:

Akitaya, Hugo A. ; Fulek, Radoslav ; Tóth, Csaba D.
ACM Transactions on Algorithms (TALG). 15 (2019) 4 - p. 1-27 , 2019

Link: https://dl.acm.org/doi/1..

14

Recognizing weak embeddings of graphs:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,

Akitaya, Hugo A. ; Fulek, Radoslav ; Tóth, Csaba D. - p. 274-292 , 2018

Link: https://dl.acm.org/doi/1..

15

Crossing Minimization in Perturbed Drawings:

, In: Lecture Notes in Computer Science; Graph Drawing and Network Visualization,

Fulek, Radoslav ; Tóth, Csaba D. - p. 229-241 , 2018

Link: https://doi.org/10.1007/..