Radoslav Fulek
Wagner Group
25 Publications
2024 | Published | Journal Article | IST-REx-ID: 13974 |

R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, and U. Wagner, “The crossing Tverberg theorem,” Discrete and Computational Geometry, vol. 72. Springer Nature, pp. 831–848, 2024.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Published | Journal Article | IST-REx-ID: 11593 |

R. Fulek and J. Kynčl, “The Z2-Genus of Kuratowski minors,” Discrete and Computational Geometry, vol. 68. Springer Nature, pp. 425–447, 2022.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Published | Conference Paper | IST-REx-ID: 7401 |

R. Fulek and J. Kyncl, “Z_2-Genus of graphs and minimum rank of partial symmetric matrices,” in 35th International Symposium on Computational Geometry (SoCG 2019), Portland, OR, United States, 2019, vol. 129.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 | Published | Conference Paper | IST-REx-ID: 6647 |

R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, and U. Wagner, “The crossing Tverberg theorem,” in 35th International Symposium on Computational Geometry, Portland, OR, United States, 2019, vol. 129, p. 38:1-38:13.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 | Published | Journal Article | IST-REx-ID: 6982 |

H. Akitaya, R. Fulek, and C. Tóth, “Recognizing weak embeddings of graphs,” ACM Transactions on Algorithms, vol. 15, no. 4. ACM, 2019.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2019 | Published | Journal Article | IST-REx-ID: 5857 |

R. Fulek and J. Pach, “Thrackles: An improved upper bound,” Discrete Applied Mathematics, vol. 259, no. 4. Elsevier, pp. 266–231, 2019.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Published | Journal Article | IST-REx-ID: 7034 |

R. Fulek and J. Kynčl, “Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4,” Combinatorica, vol. 39, no. 6. Springer Nature, pp. 1267–1279, 2019.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Published | Journal Article | IST-REx-ID: 5790 |

S. Chaplick, R. Fulek, and P. Klavík, “Extending partial representations of circle graphs,” Journal of Graph Theory, vol. 91, no. 4. Wiley, pp. 365–394, 2019.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Published | Conference Paper | IST-REx-ID: 5791 |

Fulek, Radoslav, Crossing minimization in perturbed drawings. 11282 . 2018
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Published | Conference Paper | IST-REx-ID: 185 |

R. Fulek and J. Kynčl, “Hanani-Tutte for approximating maps of graphs,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99.
[Published Version]
View
| Files available
| DOI
2018 | Published | Conference Paper | IST-REx-ID: 309 |

H. Akitaya, R. Fulek, and C. Tóth, “Recognizing weak embeddings of graphs,” presented at the SODA: Symposium on Discrete Algorithms, New Orleans, LA, USA, 2018, pp. 274–292.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Published | Conference Paper | IST-REx-ID: 186 |

R. Fulek and J. Kynčl, “The ℤ2-Genus of Kuratowski minors,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99, p. 40.1-40.14.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| arXiv
2018 | Published | Conference Paper | IST-REx-ID: 433 |

Fulek, Radoslav, Thrackles: An improved upper bound. 10692. 2018
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 1113 |

R. Fulek, M. Pelsmajer, and M. Schaefer, “Hanani-Tutte for radial planarity,” Journal of Graph Algorithms and Applications, vol. 21, no. 1. Brown University, pp. 135–154, 2017.
[Published Version]
View
| Files available
| DOI
| arXiv
2017 | Published | Conference Paper | IST-REx-ID: 6517 |

R. Fulek, “Embedding graphs into embedded graphs,” presented at the ISAAC: International Symposium on Algorithms and Computation, Phuket, Thailand, 2017, vol. 92.
[Published Version]
View
| Files available
| DOI
2017 | Published | Journal Article | IST-REx-ID: 794 |

R. Fulek, “C-planarity of embedded cyclic c-graphs,” Computational Geometry: Theory and Applications, vol. 66. Elsevier, pp. 1–13, 2017.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
2017 | Published | Journal Article | IST-REx-ID: 793 |

R. Fulek, H. Mojarrad, M. Naszódi, J. Solymosi, S. Stich, and M. Szedlák, “On the existence of ordinary triangles,” Computational Geometry: Theory and Applications, vol. 66. Elsevier, pp. 28–31, 2017.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2017 | Published | Journal Article | IST-REx-ID: 795 |

Fulek, Radoslav, Unified Hanani Tutte theorem. Electronic Journal of Combinatorics 24 (3). 2017
[Published Version]
View
| Files available
| DOI
2016 | Published | Conference Paper | IST-REx-ID: 1164 |

R. Fulek, M. Pelsmajer, and M. Schaefer, “Hanani-Tutte for radial planarity II,” presented at the GD: Graph Drawing and Network Visualization, Athens, Greece, 2016, vol. 9801, pp. 468–481.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Published | Conference Paper | IST-REx-ID: 1348 |

R. Fulek, “Bounded embeddings of graphs in the plane,” presented at the IWOCA: International Workshop on Combinatorial Algorithms, Helsinki, Finland, 2016, vol. 9843, pp. 31–42.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2016 | Published | Conference Paper | IST-REx-ID: 1165 |

R. Fulek, “C-planarity of embedded cyclic c-graphs,” presented at the GD: Graph Drawing and Network Visualization, Athens, Greece, 2016, vol. 9801, pp. 94–106.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2015 | Published | Conference Paper | IST-REx-ID: 1595 |

R. Fulek, M. Pelsmajer, and M. Schaefer, “Hanani-Tutte for radial planarity,” presented at the GD: Graph Drawing and Network Visualization, Los Angeles, CA, USA, 2015, vol. 9411, pp. 99–110.
[Submitted Version]
View
| Files available
| DOI
2015 | Published | Journal Article | IST-REx-ID: 1642 |

R. Fulek, J. Kynčl, I. Malinovič, and D. Pálvölgyi, “Clustered planarity testing revisited,” Electronic Journal of Combinatorics, vol. 22, no. 4. Electronic Journal of Combinatorics, 2015.
[Published Version]
View
| Files available
| DOI
| arXiv
2015 | Published | Book Chapter | IST-REx-ID: 1596 |

R. Fulek and R. Radoičić, “Vertical visibility among parallel polygons in three dimensions,” in Graph Drawing and Network Visualization, vol. 9411, Springer Nature, 2015, pp. 373–379.
[Submitted Version]
View
| Files available
| DOI
2014 | Published | Conference Paper | IST-REx-ID: 10793
R. Fulek, J. Kynčl, I. Malinović, and D. Pálvölgyi, “Clustered planarity testing revisited,” in International Symposium on Graph Drawing, 2014, vol. 8871, pp. 428–436.
[Preprint]
View
| Files available
| DOI
| arXiv
1 Grants
Eliminating intersections in drawings of graphs
2017-07-01 – 2019-06-30
Austrian Science Fund
25 Publications
2024 | Published | Journal Article | IST-REx-ID: 13974 |

R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, and U. Wagner, “The crossing Tverberg theorem,” Discrete and Computational Geometry, vol. 72. Springer Nature, pp. 831–848, 2024.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Published | Journal Article | IST-REx-ID: 11593 |

R. Fulek and J. Kynčl, “The Z2-Genus of Kuratowski minors,” Discrete and Computational Geometry, vol. 68. Springer Nature, pp. 425–447, 2022.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Published | Conference Paper | IST-REx-ID: 7401 |

R. Fulek and J. Kyncl, “Z_2-Genus of graphs and minimum rank of partial symmetric matrices,” in 35th International Symposium on Computational Geometry (SoCG 2019), Portland, OR, United States, 2019, vol. 129.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 | Published | Conference Paper | IST-REx-ID: 6647 |

R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, and U. Wagner, “The crossing Tverberg theorem,” in 35th International Symposium on Computational Geometry, Portland, OR, United States, 2019, vol. 129, p. 38:1-38:13.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 | Published | Journal Article | IST-REx-ID: 6982 |

H. Akitaya, R. Fulek, and C. Tóth, “Recognizing weak embeddings of graphs,” ACM Transactions on Algorithms, vol. 15, no. 4. ACM, 2019.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2019 | Published | Journal Article | IST-REx-ID: 5857 |

R. Fulek and J. Pach, “Thrackles: An improved upper bound,” Discrete Applied Mathematics, vol. 259, no. 4. Elsevier, pp. 266–231, 2019.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Published | Journal Article | IST-REx-ID: 7034 |

R. Fulek and J. Kynčl, “Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4,” Combinatorica, vol. 39, no. 6. Springer Nature, pp. 1267–1279, 2019.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Published | Journal Article | IST-REx-ID: 5790 |

S. Chaplick, R. Fulek, and P. Klavík, “Extending partial representations of circle graphs,” Journal of Graph Theory, vol. 91, no. 4. Wiley, pp. 365–394, 2019.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Published | Conference Paper | IST-REx-ID: 5791 |

Fulek, Radoslav, Crossing minimization in perturbed drawings. 11282 . 2018
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Published | Conference Paper | IST-REx-ID: 185 |

R. Fulek and J. Kynčl, “Hanani-Tutte for approximating maps of graphs,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99.
[Published Version]
View
| Files available
| DOI
2018 | Published | Conference Paper | IST-REx-ID: 309 |

H. Akitaya, R. Fulek, and C. Tóth, “Recognizing weak embeddings of graphs,” presented at the SODA: Symposium on Discrete Algorithms, New Orleans, LA, USA, 2018, pp. 274–292.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Published | Conference Paper | IST-REx-ID: 186 |

R. Fulek and J. Kynčl, “The ℤ2-Genus of Kuratowski minors,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99, p. 40.1-40.14.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| arXiv
2018 | Published | Conference Paper | IST-REx-ID: 433 |

Fulek, Radoslav, Thrackles: An improved upper bound. 10692. 2018
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 1113 |

R. Fulek, M. Pelsmajer, and M. Schaefer, “Hanani-Tutte for radial planarity,” Journal of Graph Algorithms and Applications, vol. 21, no. 1. Brown University, pp. 135–154, 2017.
[Published Version]
View
| Files available
| DOI
| arXiv
2017 | Published | Conference Paper | IST-REx-ID: 6517 |

R. Fulek, “Embedding graphs into embedded graphs,” presented at the ISAAC: International Symposium on Algorithms and Computation, Phuket, Thailand, 2017, vol. 92.
[Published Version]
View
| Files available
| DOI
2017 | Published | Journal Article | IST-REx-ID: 794 |

R. Fulek, “C-planarity of embedded cyclic c-graphs,” Computational Geometry: Theory and Applications, vol. 66. Elsevier, pp. 1–13, 2017.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
2017 | Published | Journal Article | IST-REx-ID: 793 |

R. Fulek, H. Mojarrad, M. Naszódi, J. Solymosi, S. Stich, and M. Szedlák, “On the existence of ordinary triangles,” Computational Geometry: Theory and Applications, vol. 66. Elsevier, pp. 28–31, 2017.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2017 | Published | Journal Article | IST-REx-ID: 795 |

Fulek, Radoslav, Unified Hanani Tutte theorem. Electronic Journal of Combinatorics 24 (3). 2017
[Published Version]
View
| Files available
| DOI
2016 | Published | Conference Paper | IST-REx-ID: 1164 |

R. Fulek, M. Pelsmajer, and M. Schaefer, “Hanani-Tutte for radial planarity II,” presented at the GD: Graph Drawing and Network Visualization, Athens, Greece, 2016, vol. 9801, pp. 468–481.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Published | Conference Paper | IST-REx-ID: 1348 |

R. Fulek, “Bounded embeddings of graphs in the plane,” presented at the IWOCA: International Workshop on Combinatorial Algorithms, Helsinki, Finland, 2016, vol. 9843, pp. 31–42.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2016 | Published | Conference Paper | IST-REx-ID: 1165 |

R. Fulek, “C-planarity of embedded cyclic c-graphs,” presented at the GD: Graph Drawing and Network Visualization, Athens, Greece, 2016, vol. 9801, pp. 94–106.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2015 | Published | Conference Paper | IST-REx-ID: 1595 |

R. Fulek, M. Pelsmajer, and M. Schaefer, “Hanani-Tutte for radial planarity,” presented at the GD: Graph Drawing and Network Visualization, Los Angeles, CA, USA, 2015, vol. 9411, pp. 99–110.
[Submitted Version]
View
| Files available
| DOI
2015 | Published | Journal Article | IST-REx-ID: 1642 |

R. Fulek, J. Kynčl, I. Malinovič, and D. Pálvölgyi, “Clustered planarity testing revisited,” Electronic Journal of Combinatorics, vol. 22, no. 4. Electronic Journal of Combinatorics, 2015.
[Published Version]
View
| Files available
| DOI
| arXiv
2015 | Published | Book Chapter | IST-REx-ID: 1596 |

R. Fulek and R. Radoičić, “Vertical visibility among parallel polygons in three dimensions,” in Graph Drawing and Network Visualization, vol. 9411, Springer Nature, 2015, pp. 373–379.
[Submitted Version]
View
| Files available
| DOI
2014 | Published | Conference Paper | IST-REx-ID: 10793
R. Fulek, J. Kynčl, I. Malinović, and D. Pálvölgyi, “Clustered planarity testing revisited,” in International Symposium on Graph Drawing, 2014, vol. 8871, pp. 428–436.
[Preprint]
View
| Files available
| DOI
| arXiv