Fulek, Radoslav, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, and Uli Wagner. “The Crossing Tverberg Theorem.”https://doi.org/10.1007/s00454-023-00532-x__Discrete and Computational Geometry. Springer Nature, 2023.https://doi.org/10.1007/s00454-023-00532-x .

Fulek, Radoslav, and Jan Kyndl. “The Z2-Genus of Kuratowski Minors.”https://doi.org/10.1007/s00454-022-00412-w__Discrete and Computational Geometry. Springer Nature, 2022.https://doi.org/10.1007/s00454-022-00412-w .

Fulek, Radoslav, and Jan Kyncl. “Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices.”https://doi.org/10.4230/LIPICS.SOCG.2019.39__In 35th International Symposium on Computational Geometry (SoCG 2019), Vol. 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.SOCG.2019.39 .

Chaplick, Steven, Radoslav Fulek, and Pavel Klavík. “Extending Partial Representations of Circle Graphs.”https://doi.org/10.1002/jgt.22436__Journal of Graph Theory. Wiley, 2019.https://doi.org/10.1002/jgt.22436 .

Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound.”https://doi.org/10.1016/j.dam.2018.12.025__Discrete Applied Mathematics. Elsevier, 2019.https://doi.org/10.1016/j.dam.2018.12.025 .

Fulek, Radoslav, and Jan Kyndl. “Counterexample to an Extension of the Hanani-Tutte Theorem on the Surface of Genus 4.”https://doi.org/10.1007/s00493-019-3905-7__Combinatorica. Springer Nature, 2019.https://doi.org/10.1007/s00493-019-3905-7 .

Akitaya, Hugo, Radoslav Fulek, and Csaba Tóth. “Recognizing Weak Embeddings of Graphs.”https://doi.org/10.1145/3344549__ACM Transactions on Algorithms. ACM, 2019.https://doi.org/10.1145/3344549 .

Fulek, Radoslav, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, and Uli Wagner. “The Crossing Tverberg Theorem.”https://doi.org/10.4230/LIPICS.SOCG.2019.38__In 35th International Symposium on Computational Geometry, 129:38:1-38:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.SOCG.2019.38 .

Fulek, Radoslav, and Jan Kyndl. “Hanani-Tutte for Approximating Maps of Graphs,”https://doi.org/10.4230/LIPIcs.SoCG.2018.39__Vol. 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.https://doi.org/10.4230/LIPIcs.SoCG.2018.39 .

Fulek, Radoslav, and Jan Kyndl. “The 2-Genus of Kuratowski Minors,”https://doi.org/10.4230/LIPIcs.SoCG.2018.40__99:40.1-40.14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.https://doi.org/10.4230/LIPIcs.SoCG.2018.40 .

Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound,”https://doi.org/10.1007/978-3-319-73915-1_14__10692:160–66. Springer, 2018.https://doi.org/10.1007/978-3-319-73915-1_14 .

Fulek, Radoslav, and Csaba D. Tóth. “Crossing Minimization in Perturbed Drawings,”https://doi.org/10.1007/978-3-030-04414-5_16__11282:229–41. Springer, 2018.https://doi.org/10.1007/978-3-030-04414-5_16 .

Akitaya, Hugo, Radoslav Fulek, and Csaba Tóth. “Recognizing Weak Embeddings of Graphs,”https://doi.org/10.1137/1.9781611975031.20__274–92. ACM, 2018.https://doi.org/10.1137/1.9781611975031.20 .

Fulek, Radoslav, Michael Pelsmajer, and Marcus Schaefer. “Hanani-Tutte for Radial Planarity.”https://doi.org/10.7155/jgaa.00408__Journal of Graph Algorithms and Applications. Brown University, 2017.https://doi.org/10.7155/jgaa.00408 .

Fulek, Radoslav. “Embedding Graphs into Embedded Graphs,”https://doi.org/10.4230/LIPICS.ISAAC.2017.34__Vol. 92. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPICS.ISAAC.2017.34 .

Fulek, Radoslav, Jan Kyndl, and Dömötör Pálvölgyi. “Unified Hanani Tutte Theorem.”https://doi.org/10.37236/6663__Electronic Journal of Combinatorics. International Press, 2017.https://doi.org/10.37236/6663 .

Fulek, Radoslav, Hossein Mojarrad, Márton Naszódi, József Solymosi, Sebastian Stich, and May Szedlák. “On the Existence of Ordinary Triangles.”https://doi.org/10.1016/j.comgeo.2017.07.002__Computational Geometry: Theory and Applications. Elsevier, 2017.https://doi.org/10.1016/j.comgeo.2017.07.002 .

Fulek, Radoslav. “C-Planarity of Embedded Cyclic c-Graphs.”https://doi.org/10.1016/j.comgeo.2017.06.016__Computational Geometry: Theory and Applications. Elsevier, 2017.https://doi.org/10.1016/j.comgeo.2017.06.016 .

Fulek, Radoslav. “Bounded Embeddings of Graphs in the Plane,”https://doi.org/10.1007/978-3-319-44543-4_3__9843:31–42. Springer, 2016.https://doi.org/10.1007/978-3-319-44543-4_3 .

Fulek, Radoslav, Michael Pelsmajer, and Marcus Schaefer. “Hanani-Tutte for Radial Planarity II,”https://doi.org/10.1007/978-3-319-50106-2_36__9801:468–81. Springer, 2016.https://doi.org/10.1007/978-3-319-50106-2_36 .

Fulek, Radoslav. “C-Planarity of Embedded Cyclic c-Graphs,”https://doi.org/10.1007/978-3-319-50106-2_8__9801:94–106. Springer, 2016.https://doi.org/10.1007/978-3-319-50106-2_8 .

Fulek, Radoslav, Michael Pelsmajer, and Marcus Schaefer. “Hanani-Tutte for Radial Planarity,”https://doi.org/10.1007/978-3-319-27261-0_9__9411:99–110. Springer, 2015.https://doi.org/10.1007/978-3-319-27261-0_9 .

Fulek, Radoslav, and Rados Radoidi. “Vertical Visibility among Parallel Polygons in Three Dimensions.”https://doi.org/10.1007/978-3-319-27261-0_31__In Graph Drawing and Network Visualization, 9411:373–79. Springer Nature, 2015.https://doi.org/10.1007/978-3-319-27261-0_31 .

Fulek, Radoslav, Jan Kyndl, Igor Malinovid, and Dömötör Pálvölgyi. “Clustered Planarity Testing Revisited.”https://doi.org/10.37236/5002__Electronic Journal of Combinatorics. Electronic Journal of Combinatorics, 2015.https://doi.org/10.37236/5002 .

Fulek, Radoslav, Jan Kyndl, Igor Malinovi, and Dömötör Pálvölgyi. “Clustered Planarity Testing Revisited.”https://doi.org/10.1007/978-3-662-45803-7_36__In International Symposium on Graph Drawing, 8871:428–36. Cham: Springer Nature, 2014.https://doi.org/10.1007/978-3-662-45803-7_36 .