| 2020 | GD | Polygons with Prescribed Angles in 2D and 3D. | Alon Efrat, Radoslav Fulek, Stephen G. Kobourov, Csaba D. Tth |
| 2020 | SODA | Atomic Embeddability, Clustered Planarity, and Thickenability. | Radoslav Fulek, Csaba D. Tth |
| 2018 | GD | Crossing Minimization in Perturbed Drawings. | Radoslav Fulek, Csaba D. Tth |
| 2018 | SODA | Recognizing Weak Embeddings of Graphs. | Hugo A. Akitaya, Radoslav Fulek, Csaba D. Tth |
| 2017 | GD | Thrackles: An Improved Upper Bound. | Radoslav Fulek, Jnos Pach |
| 2017 | ISAAC | Embedding Graphs into Embedded Graphs. | Radoslav Fulek |
| 2016 | GD | C-Planarity of Embedded Cyclic c-Graphs. | Radoslav Fulek |
| 2016 | GD | Hanani-Tutte for Radial Planarity II. | Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer |
| 2016 | IWOCA | Bounded Embeddings of Graphs in the Plane. | Radoslav Fulek |
| 2015 | GD | Hanani-Tutte for Radial Planarity. | Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer |
| 2015 | GD | Vertical Visibility Among Parallel Polygons in Three Dimensions. | Radoslav Fulek, Rados Radoicic |
| 2014 | GD | Clustered Planarity Testing Revisited. | Radoslav Fulek, Jan Kyncl, Igor Malinovic, Dmtr Plvlgyi |
| 2014 | WG | Towards the Hanani-Tutte Theorem for Clustered Graphs. | Radoslav Fulek |
| 2013 | GD | Extending Partial Representations of Circle Graphs. | Steven Chaplick, Radoslav Fulek, Pavel Klavk |
| 2013 | WADS | Universal Point Sets for Planar Three-Trees. | Radoslav Fulek, Csaba D. Tth |
| 2011 | GD | On the Page Number of Upward Planar Directed Acyclic Graphs. | Fabrizio Frati, Radoslav Fulek, Andres J. Ruiz-Vargas |
| 2011 | GD | Adjacent Crossings Do Matter. | Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic |
| 2011 | GD | Orthogeodesic Point-Set Embedding of Trees. | Emilio Di Giacomo, Fabrizio Frati, Radoslav Fulek, Luca Grilli, Marcus Krug |
| 2011 | WG | Hanani-Tutte and Monotone Drawings. | Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic |
| 2010 | GD | On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles. | Eyal Ackerman, Radoslav Fulek, Csaba D. Tth |
| 2010 | GD | A Computational Approach to Conway's Thrackle Conjecture. | Radoslav Fulek, Jnos Pach |
| 2010 | WG | Graphs that Admit Right Angle Crossing Drawings. | Karin Arikushi, Radoslav Fulek, Balzs Keszegh, Filip Moric, Csaba D. Tth |
| 2005 | SOFSEM | Outerplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete p-Partite Graphs. | Radoslav Fulek, Hongmei He, Ondrej Skora, Imrich Vrto |