Outerplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete p-Partite Graphs. - Radoslav Fulek; Hongmei He; Ondrej Sýkora; Imrich Vrto (SOFSEM, 2005)

Intersecting Convex Sets by Rays. - Radoslav Fulek; Andreas F. Holmsen; János Pach (Discret. Comput. Geom., 2009)

Linear bound on extremal functions of some forbidden patterns in 0-1 matrices. - Radoslav Fulek (Discret. Math., 2009)

Coloring geometric hypergraph defined by an arrangement of half-planes. - Radoslav Fulek (CCCG, 2010)

On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles. - Eyal Ackerman; Radoslav Fulek; Csaba D. Tóth (GD, 2010)

A Tight Lower Bound for Convexly Independent Subsets of the Minkowski Sums of Planar Point Sets. - Ondrej Bílka; Kevin Buchin; Radoslav Fulek; Masashi Kiyomi; Yoshio Okamoto; Shin-ichi Tanigawa; Csaba D. Tóth (Electron. J. Comb., 2010)

Hanani-Tutte and Monotone Drawings. - Radoslav Fulek; Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (WG, 2011)

A computational approach to Conway's thrackle conjecture. - Radoslav Fulek; János Pach (Comput. Geom., 2011)

On Sets of Lines Not-Supporting Trees - Radoslav Fulek; Daniel Neuwirth (CoRR, 2011)

Convex obstacle numbers of outerplanar graphs and bipartite permutation graphs - Radoslav Fulek; Noushin Saeedi; Deniz Sariöz (CoRR, 2011)

Diameter bounds for planar graphs. - Radoslav Fulek; Filip Moric; David Pritchard 001 (Discret. Math., 2011)

On disjoint crossing families in geometric graphs. - Radoslav Fulek; Andrew Suk (Electron. Notes Discret. Math., 2011)

Graphs that admit right angle crossing drawings. - Karin Arikushi; Radoslav Fulek; Balázs Keszegh; Filip Moric; Csaba D. Tóth (Comput. Geom., 2012)

Universal point sets for planar three-tree - Radoslav Fulek; Csaba D. Tóth (CoRR, 2012)

Adjacent Crossings Do Matter. - Radoslav Fulek; Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (J. Graph Algorithms Appl., 2012)

Graphs That Admit Polyline Drawings with Few Crossing Angles. - Eyal Ackerman; Radoslav Fulek; Csaba D. Tóth (SIAM J. Discret. Math., 2012)

Topological graphs: empty triangles and disjoint matchings. - Radoslav Fulek; Andres J. Ruiz-Vargas (SoCG, 2013)

Orthogeodesic point-set embedding of trees. - Emilio Di Giacomo; Fabrizio Frati; Radoslav Fulek; Luca Grilli 001; Marcus Krug (Comput. Geom., 2013)

Crossing numbers and combinatorial characterization of monotone drawings of $K_n$. - Martin Balko; Radoslav Fulek; Jan Kyncl (CoRR, 2013)

Efficient c-planarity testing algebraically - Radoslav Fulek; Jan Kyncl; Igor Malinovic; Dömötör Pálvölgyi (CoRR, 2013)

On Polygons Excluding Point Sets. - Radoslav Fulek; Balázs Keszegh; Filip Moric; Igor Uljarevic (Graphs Comb., 2013)

On the Page Number of Upward Planar Directed Acyclic Graphs. - Fabrizio Frati; Radoslav Fulek; Andres J. Ruiz-Vargas (J. Graph Algorithms Appl., 2013)

Towards the Hanani-Tutte Theorem for Clustered Graphs. - Radoslav Fulek (WG, 2014)

Toward the Hanani-Tutte Theorem for Clustered Graphs. - Radoslav Fulek (CoRR, 2014)

Homometric sets in trees. - Radoslav Fulek; Slobodan Mitrovic (Eur. J. Comb., 2014)

Estimating the Number of Disjoint Edges in Simple Topological Graphs via Cylindrical Drawings. - Radoslav Fulek (SIAM J. Discret. Math., 2014)

Vertical Visibility Among Parallel Polygons in Three Dimensions. - Radoslav Fulek; Rados Radoicic (GD, 2015)

Clustered Planarity Testing Revisited. - Radoslav Fulek; Jan Kyncl; Igor Malinovic; Dömötör Pálvölgyi (Electron. J. Comb., 2015)

Free Edge Lengths in Plane Graphs. - Zachary Abel; Robert Connelly; Sarah Eisenstat; Radoslav Fulek; Filip Moric; Yoshio Okamoto; Tibor Szabó; Csaba D. Tóth (Discret. Comput. Geom., 2015)

Crossing Numbers and Combinatorial Characterization of Monotone Drawings of $$K_n$$ K n. - Martin Balko; Radoslav Fulek; Jan Kyncl (Discret. Comput. Geom., 2015)

Universal point sets for planar three-trees. - Radoslav Fulek; Csaba D. Tóth (J. Discrete Algorithms, 2015)

Bounded Embeddings of Graphs in the Plane. - Radoslav Fulek (IWOCA, 2016)

Unified Hanani-Tutte Theorem. - Radoslav Fulek; Jan Kyncl; Dömötör Pálvölgyi (Electron. J. Comb., 2017)

C-planarity of embedded cyclic c-graphs. - Radoslav Fulek (Comput. Geom., 2017)

On the existence of ordinary triangles. - Radoslav Fulek; Hossein Nassajian Mojarrad; Márton Naszódi; József Solymosi; Sebastian U. Stich; May Szedlák (Comput. Geom., 2017)

Hanani-Tutte for Radial Planarity. - Radoslav Fulek; Michael J. Pelsmajer; Marcus Schaefer 001 (J. Graph Algorithms Appl., 2017)

Hanani-Tutte for Approximating Maps of Graphs. - Radoslav Fulek; Jan Kyncl (SoCG, 2018)

The Z_2-Genus of Kuratowski Minors. - Radoslav Fulek; Jan Kyncl (SoCG, 2018)

The ℤ2-genus of Kuratowski minors. - Radoslav Fulek; Jan Kyncl (CoRR, 2018)

Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices. - Radoslav Fulek; Jan Kyncl (SoCG, 2019)

Counterexample to an Extension of the Hanani-Tutte Theorem on the Surface of Genus 4. - Radoslav Fulek; Jan Kyncl (Comb., 2019)

Thrackles: An improved upper bound. - Radoslav Fulek; János Pach (Discret. Appl. Math., 2019)

Extending partial representations of circle graphs. - Steven Chaplick; Radoslav Fulek; Pavel Klavík (J. Graph Theory, 2019)

Recognizing Weak Embeddings of Graphs. - Hugo A. Akitaya; Radoslav Fulek; Csaba D. Tóth (ACM Trans. Algorithms, 2019)

Computing β-Stretch Paths in Drawings of Graphs. - Esther M. Arkin; Faryad Darabi Sahneh; Alon Efrat; Fabian Frank; Radoslav Fulek; Stephen G. Kobourov; Joseph S. B. Mitchell (SWAT, 2020)

Embedding Graphs into Embedded Graphs. - Radoslav Fulek (Algorithmica, 2020)

Crossing minimization in perturbed drawings. - Radoslav Fulek; Csaba D. Tóth (J. Comb. Optim., 2020)

Strong Hanani-Tutte for the Torus. - Radoslav Fulek; Michael J. Pelsmajer; Marcus Schaefer 001 (SoCG, 2021)

Saturation Problems about Forbidden 0-1 Submatrices. - Radoslav Fulek; Balázs Keszegh (SIAM J. Discret. Math., 2021)

The $ mathbb {Z}_2$-Genus of Kuratowski Minors. - Radoslav Fulek; Jan Kyncl (Discret. Comput. Geom., 2022)

Atomic Embeddability, Clustered Planarity, and Thickenability. - Radoslav Fulek; Csaba D. Tóth (J. ACM, 2022)

Polygons with Prescribed Angles in 2D and 3D. - Alon Efrat; Radoslav Fulek; Stephen G. Kobourov; Csaba D. Tóth (J. Graph Algorithms Appl., 2022)

Hanani-Tutte for Radial Planarity II. - Radoslav Fulek; Michael J. Pelsmajer; Marcus Schaefer 001 (Electron. J. Comb., 2023)

The Crossing Tverberg Theorem. - Radoslav Fulek; Bernd Gärtner; Andrey Kupavskii; Pavel Valtr 001; Uli Wagner 001 (Discret. Comput. Geom., 2024)