Fulek, Radoslav, et al. “The Crossing Tverberg Theorem.”10.1007/s00454-023-00532-x__Discrete and Computational Geometry, Springer Nature, 2023, doi:10.1007/s00454-023-00532-x.

Fulek, Radoslav, and Jan Kyndl. “The Z2-Genus of Kuratowski Minors.”10.1007/s00454-022-00412-w__Discrete and Computational Geometry, vol. 68, Springer Nature, 2022, pp. 425–47, doi:10.1007/s00454-022-00412-w.

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

Chaplick, Steven, et al. “Extending Partial Representations of Circle Graphs.”10.1002/jgt.22436__Journal of Graph Theory, vol. 91, no. 4, Wiley, 2019, pp. 365–94, doi:10.1002/jgt.22436.

Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound.”10.1016/j.dam.2018.12.025__Discrete Applied Mathematics, vol. 259, no. 4, Elsevier, 2019, pp. 266–231, doi: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.”10.1007/s00493-019-3905-7__Combinatorica, vol. 39, no. 6, Springer Nature, 2019, pp. 1267–79, doi:10.1007/s00493-019-3905-7.

Akitaya, Hugo, et al. “Recognizing Weak Embeddings of Graphs.”10.1145/3344549__ACM Transactions on Algorithms, vol. 15, no. 4, 50, ACM, 2019, doi:10.1145/3344549.

Fulek, Radoslav, et al. “The Crossing Tverberg Theorem.”10.4230/LIPICS.SOCG.2019.38__35th International Symposium on Computational Geometry, vol. 129, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 38:1-38:13, doi:10.4230/LIPICS.SOCG.2019.38.

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

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

Fulek, Radoslav, and János Pach. Thrackles: An Improved Upper Bound. Vol. 10692, Springer, 2018, pp. 160–66, doi:10.1007/978-3-319-73915-1_14.

Fulek, Radoslav, and Csaba D. Tóth. Crossing Minimization in Perturbed Drawings. Vol. 11282, Springer, 2018, pp. 229–41, doi:10.1007/978-3-030-04414-5_16.

Akitaya, Hugo, et al. Recognizing Weak Embeddings of Graphs. ACM, 2018, pp. 274–92, doi:10.1137/1.9781611975031.20.

Fulek, Radoslav, et al. “Hanani-Tutte for Radial Planarity.”10.7155/jgaa.00408__Journal of Graph Algorithms and Applications, vol. 21, no. 1, Brown University, 2017, pp. 135–54, doi:10.7155/jgaa.00408.

Fulek, Radoslav. Embedding Graphs into Embedded Graphs. Vol. 92, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPICS.ISAAC.2017.34.

Fulek, Radoslav, et al. “Unified Hanani Tutte Theorem.”10.37236/6663__Electronic Journal of Combinatorics, vol. 24, no. 3, .18, International Press, 2017, doi:10.37236/6663.

Fulek, Radoslav, et al. “On the Existence of Ordinary Triangles.”10.1016/j.comgeo.2017.07.002__Computational Geometry: Theory and Applications, vol. 66, Elsevier, 2017, pp. 28–31, doi:10.1016/j.comgeo.2017.07.002.

Fulek, Radoslav. “C-Planarity of Embedded Cyclic c-Graphs.”10.1016/j.comgeo.2017.06.016__Computational Geometry: Theory and Applications, vol. 66, Elsevier, 2017, pp. 1–13, doi:10.1016/j.comgeo.2017.06.016.

Fulek, Radoslav. Bounded Embeddings of Graphs in the Plane. Vol. 9843, Springer, 2016, pp. 31–42, doi:10.1007/978-3-319-44543-4_3.

Fulek, Radoslav, et al. Hanani-Tutte for Radial Planarity II. Vol. 9801, Springer, 2016, pp. 468–81, doi:10.1007/978-3-319-50106-2_36.

Fulek, Radoslav. C-Planarity of Embedded Cyclic c-Graphs. Vol. 9801, Springer, 2016, pp. 94–106, doi:10.1007/978-3-319-50106-2_8.

Fulek, Radoslav, et al. Hanani-Tutte for Radial Planarity. Vol. 9411, Springer, 2015, pp. 99–110, doi:10.1007/978-3-319-27261-0_9.

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

Fulek, Radoslav, et al. “Clustered Planarity Testing Revisited.”10.37236/5002__Electronic Journal of Combinatorics, vol. 22, no. 4, .24, Electronic Journal of Combinatorics, 2015, doi:10.37236/5002.

Fulek, Radoslav, et al. “Clustered Planarity Testing Revisited.”10.1007/978-3-662-45803-7_36__International Symposium on Graph Drawing, vol. 8871, Springer Nature, 2014, pp. 428–36, doi:10.1007/978-3-662-45803-7_36.