Eliminating intersections in drawings of graphs

Project Period: 2017-07-01 – 2019-06-30
Externally Funded
Principal Investigator
Radoslav Fulek
Department(s)
Wagner Group
Grant Number
M02281
Funding Organisation
FWF

11 Publications

2018 | Conference Paper | IST-REx-ID: 185 | OA
Hanani-Tutte for approximating maps of graphs
R. Fulek, J. Kynčl, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
[Published Version] View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 6517 | OA
Embedding graphs into embedded graphs
R. Fulek, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
[Published Version] View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 7401 | OA
Z_2-Genus of graphs and minimum rank of partial symmetric matrices
R. Fulek, J. Kyncl, in:, 35th International Symposium on Computational Geometry (SoCG 2019), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
[Published Version] View | Files available | DOI | arXiv
 
2022 | Journal Article | IST-REx-ID: 11593 | OA
The Z2-Genus of Kuratowski minors
R. Fulek, J. Kynčl, Discrete and Computational Geometry 68 (2022) 425–447.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2018 | Conference Paper | IST-REx-ID: 186 | OA
The ℤ2-Genus of Kuratowski minors
R. Fulek, J. Kynčl, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 40.1-40.14.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
2019 | Journal Article | IST-REx-ID: 5857 | OA
Thrackles: An improved upper bound
R. Fulek, J. Pach, Discrete Applied Mathematics 259 (2019) 266–231.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2019 | Journal Article | IST-REx-ID: 7034 | OA
Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4
R. Fulek, J. Kynčl, Combinatorica 39 (2019) 1267–1279.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2018 | Conference Paper | IST-REx-ID: 309 | OA
Recognizing weak embeddings of graphs
H. Akitaya, R. Fulek, C. Tóth, in:, ACM, 2018, pp. 274–292.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2019 | Journal Article | IST-REx-ID: 6982 | OA
Recognizing weak embeddings of graphs
H. Akitaya, R. Fulek, C. Tóth, ACM Transactions on Algorithms 15 (2019).
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6647 | OA
The crossing Tverberg theorem
R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, U. Wagner, in:, 35th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 38:1-38:13.
[Published Version] View | Files available | DOI | arXiv
 
2023 | Journal Article | IST-REx-ID: 13974 | OA
The crossing Tverberg theorem
R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, U. Wagner, Discrete and Computational Geometry (2023).
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv