Radoslav Fulek
Wagner Group
25 Publications
2023 | Journal Article | IST-REx-ID: 13974 |
Fulek R, Gärtner B, Kupavskii A, Valtr P, Wagner U. 2023. The crossing Tverberg theorem. Discrete and Computational Geometry.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Journal Article | IST-REx-ID: 11593 |
Fulek R, Kynčl J. 2022. The Z2-Genus of Kuratowski minors. Discrete and Computational Geometry. 68, 425–447.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Conference Paper | IST-REx-ID: 7401 |
Fulek R, Kyncl J. 2019. Z_2-Genus of graphs and minimum rank of partial symmetric matrices. 35th International Symposium on Computational Geometry (SoCG 2019). SoCG: Symposium on Computational Geometry, LIPIcs, vol. 129, 39.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 | Journal Article | IST-REx-ID: 5790 |
Chaplick S, Fulek R, Klavík P. 2019. Extending partial representations of circle graphs. Journal of Graph Theory. 91(4), 365–394.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Journal Article | IST-REx-ID: 5857 |
Fulek R, Pach J. 2019. Thrackles: An improved upper bound. Discrete Applied Mathematics. 259(4), 266–231.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Journal Article | IST-REx-ID: 7034 |
Fulek R, Kynčl J. 2019. Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4. Combinatorica. 39(6), 1267–1279.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Journal Article | IST-REx-ID: 6982 |
Akitaya H, Fulek R, Tóth C. 2019. Recognizing weak embeddings of graphs. ACM Transactions on Algorithms. 15(4), 50.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2019 | Conference Paper | IST-REx-ID: 6647 |
Fulek R, Gärtner B, Kupavskii A, Valtr P, Wagner U. 2019. The crossing Tverberg theorem. 35th International Symposium on Computational Geometry. SoCG 2019: Symposium on Computational Geometry, LIPIcs, vol. 129, 38:1-38:13.
[Published Version]
View
| Files available
| DOI
| arXiv
2018 | Conference Paper | IST-REx-ID: 185 |
Fulek R, Kynčl J. 2018. Hanani-Tutte for approximating maps of graphs. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99, 39.
[Published Version]
View
| Files available
| DOI
2018 | Conference Paper | IST-REx-ID: 186 |
Fulek R, Kynčl J. 2018. The ℤ2-Genus of Kuratowski minors. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 99, 40.1-40.14.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| arXiv
2018 | Conference Paper | IST-REx-ID: 433 |
Fulek R, Pach J. 2018. Thrackles: An improved upper bound. GD 2017: Graph Drawing and Network Visualization, LNCS, vol. 10692, 160–166.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| arXiv
2018 | Conference Paper | IST-REx-ID: 5791 |
Fulek R, Tóth CD. 2018. Crossing minimization in perturbed drawings. Graph Drawing and Network Visualization, LNCS, vol. 11282, 229–241.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Conference Paper | IST-REx-ID: 309 |
Akitaya H, Fulek R, Tóth C. 2018. Recognizing weak embeddings of graphs. SODA: Symposium on Discrete Algorithms, 274–292.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2017 | Journal Article | IST-REx-ID: 1113 |
Fulek R, Pelsmajer M, Schaefer M. 2017. Hanani-Tutte for radial planarity. Journal of Graph Algorithms and Applications. 21(1), 135–154.
[Published Version]
View
| Files available
| DOI
| arXiv
2017 | Conference Paper | IST-REx-ID: 6517 |
Fulek R. 2017. Embedding graphs into embedded graphs. ISAAC: International Symposium on Algorithms and Computation vol. 92, 34.
[Published Version]
View
| Files available
| DOI
2017 | Journal Article | IST-REx-ID: 795 |
Fulek R, Kynčl J, Pálvölgyi D. 2017. Unified Hanani Tutte theorem. Electronic Journal of Combinatorics. 24(3), P3.18.
[Published Version]
View
| Files available
| DOI
2017 | Journal Article | IST-REx-ID: 793 |
Fulek R, Mojarrad H, Naszódi M, Solymosi J, Stich S, Szedlák M. 2017. On the existence of ordinary triangles. Computational Geometry: Theory and Applications. 66, 28–31.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2017 | Journal Article | IST-REx-ID: 794 |
Fulek R. 2017. C-planarity of embedded cyclic c-graphs. Computational Geometry: Theory and Applications. 66, 1–13.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
2016 | Conference Paper | IST-REx-ID: 1348 |
Fulek R. 2016. Bounded embeddings of graphs in the plane. IWOCA: International Workshop on Combinatorial Algorithms, LNCS, vol. 9843, 31–42.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2016 | Conference Paper | IST-REx-ID: 1164 |
Fulek R, Pelsmajer M, Schaefer M. 2016. Hanani-Tutte for radial planarity II. GD: Graph Drawing and Network Visualization, LNCS, vol. 9801, 468–481.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Conference Paper | IST-REx-ID: 1165 |
Fulek R. 2016. C-planarity of embedded cyclic c-graphs. GD: Graph Drawing and Network Visualization, LNCS, vol. 9801, 94–106.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2015 | Conference Paper | IST-REx-ID: 1595 |
Fulek R, Pelsmajer M, Schaefer M. 2015. Hanani-Tutte for radial planarity. GD: Graph Drawing and Network Visualization, LNCS, vol. 9411, 99–110.
[Submitted Version]
View
| Files available
| DOI
2015 | Book Chapter | IST-REx-ID: 1596 |
Fulek R, Radoičić R. 2015.Vertical visibility among parallel polygons in three dimensions. In: Graph Drawing and Network Visualization. LNCS, vol. 9411, 373–379.
[Submitted Version]
View
| Files available
| DOI
2015 | Journal Article | IST-REx-ID: 1642 |
Fulek R, Kynčl J, Malinovič I, Pálvölgyi D. 2015. Clustered planarity testing revisited. Electronic Journal of Combinatorics. 22(4), P4.24.
[Published Version]
View
| Files available
| DOI
| arXiv
2014 | Conference Paper | IST-REx-ID: 10793
Fulek R, Kynčl J, Malinović I, Pálvölgyi D. 2014. Clustered planarity testing revisited. International Symposium on Graph Drawing. , LNCS, vol. 8871, 428–436.
[Preprint]
View
| Files available
| DOI
| arXiv
25 Publications
2023 | Journal Article | IST-REx-ID: 13974 |
Fulek R, Gärtner B, Kupavskii A, Valtr P, Wagner U. 2023. The crossing Tverberg theorem. Discrete and Computational Geometry.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Journal Article | IST-REx-ID: 11593 |
Fulek R, Kynčl J. 2022. The Z2-Genus of Kuratowski minors. Discrete and Computational Geometry. 68, 425–447.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Conference Paper | IST-REx-ID: 7401 |
Fulek R, Kyncl J. 2019. Z_2-Genus of graphs and minimum rank of partial symmetric matrices. 35th International Symposium on Computational Geometry (SoCG 2019). SoCG: Symposium on Computational Geometry, LIPIcs, vol. 129, 39.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 | Journal Article | IST-REx-ID: 5790 |
Chaplick S, Fulek R, Klavík P. 2019. Extending partial representations of circle graphs. Journal of Graph Theory. 91(4), 365–394.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Journal Article | IST-REx-ID: 5857 |
Fulek R, Pach J. 2019. Thrackles: An improved upper bound. Discrete Applied Mathematics. 259(4), 266–231.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Journal Article | IST-REx-ID: 7034 |
Fulek R, Kynčl J. 2019. Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4. Combinatorica. 39(6), 1267–1279.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Journal Article | IST-REx-ID: 6982 |
Akitaya H, Fulek R, Tóth C. 2019. Recognizing weak embeddings of graphs. ACM Transactions on Algorithms. 15(4), 50.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2019 | Conference Paper | IST-REx-ID: 6647 |
Fulek R, Gärtner B, Kupavskii A, Valtr P, Wagner U. 2019. The crossing Tverberg theorem. 35th International Symposium on Computational Geometry. SoCG 2019: Symposium on Computational Geometry, LIPIcs, vol. 129, 38:1-38:13.
[Published Version]
View
| Files available
| DOI
| arXiv
2018 | Conference Paper | IST-REx-ID: 185 |
Fulek R, Kynčl J. 2018. Hanani-Tutte for approximating maps of graphs. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99, 39.
[Published Version]
View
| Files available
| DOI
2018 | Conference Paper | IST-REx-ID: 186 |
Fulek R, Kynčl J. 2018. The ℤ2-Genus of Kuratowski minors. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 99, 40.1-40.14.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| arXiv
2018 | Conference Paper | IST-REx-ID: 433 |
Fulek R, Pach J. 2018. Thrackles: An improved upper bound. GD 2017: Graph Drawing and Network Visualization, LNCS, vol. 10692, 160–166.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| arXiv
2018 | Conference Paper | IST-REx-ID: 5791 |
Fulek R, Tóth CD. 2018. Crossing minimization in perturbed drawings. Graph Drawing and Network Visualization, LNCS, vol. 11282, 229–241.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Conference Paper | IST-REx-ID: 309 |
Akitaya H, Fulek R, Tóth C. 2018. Recognizing weak embeddings of graphs. SODA: Symposium on Discrete Algorithms, 274–292.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2017 | Journal Article | IST-REx-ID: 1113 |
Fulek R, Pelsmajer M, Schaefer M. 2017. Hanani-Tutte for radial planarity. Journal of Graph Algorithms and Applications. 21(1), 135–154.
[Published Version]
View
| Files available
| DOI
| arXiv
2017 | Conference Paper | IST-REx-ID: 6517 |
Fulek R. 2017. Embedding graphs into embedded graphs. ISAAC: International Symposium on Algorithms and Computation vol. 92, 34.
[Published Version]
View
| Files available
| DOI
2017 | Journal Article | IST-REx-ID: 795 |
Fulek R, Kynčl J, Pálvölgyi D. 2017. Unified Hanani Tutte theorem. Electronic Journal of Combinatorics. 24(3), P3.18.
[Published Version]
View
| Files available
| DOI
2017 | Journal Article | IST-REx-ID: 793 |
Fulek R, Mojarrad H, Naszódi M, Solymosi J, Stich S, Szedlák M. 2017. On the existence of ordinary triangles. Computational Geometry: Theory and Applications. 66, 28–31.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2017 | Journal Article | IST-REx-ID: 794 |
Fulek R. 2017. C-planarity of embedded cyclic c-graphs. Computational Geometry: Theory and Applications. 66, 1–13.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
2016 | Conference Paper | IST-REx-ID: 1348 |
Fulek R. 2016. Bounded embeddings of graphs in the plane. IWOCA: International Workshop on Combinatorial Algorithms, LNCS, vol. 9843, 31–42.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2016 | Conference Paper | IST-REx-ID: 1164 |
Fulek R, Pelsmajer M, Schaefer M. 2016. Hanani-Tutte for radial planarity II. GD: Graph Drawing and Network Visualization, LNCS, vol. 9801, 468–481.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Conference Paper | IST-REx-ID: 1165 |
Fulek R. 2016. C-planarity of embedded cyclic c-graphs. GD: Graph Drawing and Network Visualization, LNCS, vol. 9801, 94–106.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2015 | Conference Paper | IST-REx-ID: 1595 |
Fulek R, Pelsmajer M, Schaefer M. 2015. Hanani-Tutte for radial planarity. GD: Graph Drawing and Network Visualization, LNCS, vol. 9411, 99–110.
[Submitted Version]
View
| Files available
| DOI
2015 | Book Chapter | IST-REx-ID: 1596 |
Fulek R, Radoičić R. 2015.Vertical visibility among parallel polygons in three dimensions. In: Graph Drawing and Network Visualization. LNCS, vol. 9411, 373–379.
[Submitted Version]
View
| Files available
| DOI
2015 | Journal Article | IST-REx-ID: 1642 |
Fulek R, Kynčl J, Malinovič I, Pálvölgyi D. 2015. Clustered planarity testing revisited. Electronic Journal of Combinatorics. 22(4), P4.24.
[Published Version]
View
| Files available
| DOI
| arXiv
2014 | Conference Paper | IST-REx-ID: 10793
Fulek R, Kynčl J, Malinović I, Pálvölgyi D. 2014. Clustered planarity testing revisited. International Symposium on Graph Drawing. , LNCS, vol. 8871, 428–436.
[Preprint]
View
| Files available
| DOI
| arXiv