Radoslav Fulek

Publication Activity (10 Years)

Years Active: 2005-2023
Publications (10 Years): 45

Top Topics

Directed Acyclic Graph

Graph Theoretic

Symmetric Matrices

Top Venues

Discret. Comput. Geom.

Publications

Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer
Hanani-Tutte for Radial Planarity II. Electron. J. Comb. 30 (1) (2023)
Radoslav Fulek, Jan Kyncl
The $\mathbb {Z}_2$-Genus of Kuratowski Minors. Discret. Comput. Geom. 68 (2) (2022)
Alon Efrat, Radoslav Fulek, Stephen G. Kobourov, Csaba D. Tóth
Polygons with Prescribed Angles in 2D and 3D. J. Graph Algorithms Appl. 26 (3) (2022)
Radoslav Fulek, Csaba D. Tóth
Atomic Embeddability, Clustered Planarity, and Thickenability. J. ACM 69 (2) (2022)
Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer
Strong Hanani-Tutte for the Torus. SoCG (2021)
Radoslav Fulek, Balázs Keszegh
Saturation Problems about Forbidden 0-1 Submatrices. SIAM J. Discret. Math. 35 (3) (2021)
Esther M. Arkin, Faryad Darabi Sahneh, Alon Efrat, Fabian Frank, Radoslav Fulek, Stephen G. Kobourov, Joseph S. B. Mitchell
Computing β-Stretch Paths in Drawings of Graphs. SWAT (2020)
Alon Efrat, Radoslav Fulek, Stephen G. Kobourov, Csaba D. Tóth
Polygons with Prescribed Angles in 2D and 3D. CoRR (2020)
Radoslav Fulek
Embedding Graphs into Embedded Graphs. Algorithmica 82 (11) (2020)
Radoslav Fulek, Csaba D. Tóth
Atomic Embeddability, Clustered Planarity, and Thickenability. SODA (2020)
Radoslav Fulek, Csaba D. Tóth
Crossing minimization in perturbed drawings. J. Comb. Optim. 40 (2) (2020)
Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer
Strong Hanani-Tutte for the Torus. CoRR (2020)
Alon Efrat, Radoslav Fulek, Stephen G. Kobourov, Csaba D. Tóth
Polygons with Prescribed Angles in 2D and 3D. Graph Drawing (2020)
Steven Chaplick, Radoslav Fulek, Pavel Klavík
Extending partial representations of circle graphs. J. Graph Theory 91 (4) (2019)
Radoslav Fulek, Jan Kyncl
Counterexample to an Extension of the Hanani-Tutte Theorem on the Surface of Genus 4. Comb. 39 (6) (2019)
Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner
The Crossing Tverberg Theorem. SoCG (2019)
Radoslav Fulek, Jan Kyncl
Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices. SoCG (2019)
Radoslav Fulek, Csaba D. Tóth
Atomic Embeddability, Clustered Planarity, and Thickenability. CoRR (2019)
Radoslav Fulek, János Pach
Thrackles: An improved upper bound. Discret. Appl. Math. 259 (2019)
Radoslav Fulek, Jan Kyncl
Z_2-genus of graphs and minimum rank of partial symmetric matrices. CoRR (2019)
Hugo A. Akitaya, Radoslav Fulek, Csaba D. Tóth
Recognizing Weak Embeddings of Graphs. ACM Trans. Algorithms 15 (4) (2019)
Radoslav Fulek, Jan Kyncl
Hanani-Tutte for Approximating Maps of Graphs. SoCG (2018)
Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner
The Crossing Tverberg Theorem. CoRR (2018)
Hugo A. Akitaya, Radoslav Fulek, Csaba D. Tóth
Recognizing Weak Embeddings of Graphs. SODA (2018)
Radoslav Fulek, Jan Kyncl
The Z_2-Genus of Kuratowski Minors. SoCG (2018)
Radoslav Fulek, Jan Kyncl
-genus of Kuratowski minors. CoRR (2018)
Radoslav Fulek, Csaba D. Tóth
Crossing Minimization in Perturbed Drawings. CoRR (2018)
Radoslav Fulek, Csaba D. Tóth
Crossing Minimization in Perturbed Drawings. Graph Drawing (2018)
Radoslav Fulek, Hossein Nassajian Mojarrad, Márton Naszódi, József Solymosi, Sebastian U. Stich, May Szedlák
On the existence of ordinary triangles. Comput. Geom. 66 (2017)
Hugo A. Akitaya, Radoslav Fulek, Csaba D. Tóth
Recognizing Weak Embeddings of Graphs. CoRR (2017)
Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer
Hanani-Tutte for Radial Planarity. J. Graph Algorithms Appl. 21 (1) (2017)
Radoslav Fulek, János Pach
Thrackles: An Improved Upper Bound. Graph Drawing (2017)
Radoslav Fulek
Embedding Graphs into Embedded Graphs. ISAAC (2017)
Radoslav Fulek, Jan Kyncl, Dömötör Pálvölgyi
Unified Hanani-Tutte Theorem. Electron. J. Comb. 24 (3) (2017)
Radoslav Fulek, Jan Kyncl
Hanani-Tutte for approximating maps of graphs. CoRR (2017)
Radoslav Fulek, Jan Kyncl
Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4. CoRR (2017)
Radoslav Fulek
C-planarity of embedded cyclic c-graphs. Comput. Geom. 66 (2017)
Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer
Hanani-Tutte for Radial Planarity II. Graph Drawing (2016)
Radoslav Fulek
Embedding graphs into embedded graphs. CoRR (2016)
Radoslav Fulek, Jan Kyncl, Dömötör Pálvölgyi
Unified Hanani-Tutte theorem. CoRR (2016)
Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer
Hanani-Tutte for Radial Planarity II. CoRR (2016)
Radoslav Fulek
C-planarity of Embedded Cyclic c-Graphs. CoRR (2016)
Radoslav Fulek
Bounded Embeddings of Graphs in the Plane. IWOCA (2016)
Radoslav Fulek
Bounded embeddings of graphs in the plane. CoRR (2016)
Radoslav Fulek
C-Planarity of Embedded Cyclic c-Graphs. Graph Drawing (2016)
Martin Balko, Radoslav Fulek, Jan Kyncl
Crossing Numbers and Combinatorial Characterization of Monotone Drawings of $$K_n$$ K n. Discret. Comput. Geom. 53 (1) (2015)
Radoslav Fulek, Csaba D. Tóth
Universal point sets for planar three-trees. J. Discrete Algorithms 30 (2015)
Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer
Hanani-Tutte for Radial Planarity. Graph Drawing (2015)
Zachary Abel, Robert Connelly, Sarah Eisenstat, Radoslav Fulek, Filip Moric, Yoshio Okamoto, Tibor Szabó, Csaba D. Tóth
Free Edge Lengths in Plane Graphs. Discret. Comput. Geom. 54 (1) (2015)
Radoslav Fulek, Jan Kyncl, Igor Malinovic, Dömötör Pálvölgyi
Clustered Planarity Testing Revisited. Electron. J. Comb. 22 (4) (2015)
Radoslav Fulek, Rados Radoicic
Vertical Visibility Among Parallel Polygons in Three Dimensions. Graph Drawing (2015)
Radoslav Fulek
Toward the Hanani-Tutte Theorem for Clustered Graphs. CoRR (2014)
Zachary Abel, Robert Connelly, Sarah Eisenstat, Radoslav Fulek, Filip Moric, Yoshio Okamoto, Tibor Szabó, Csaba D. Tóth
Free Edge Lengths in Plane Graphs. SoCG (2014)
Radoslav Fulek, Slobodan Mitrovic
Homometric sets in trees. Eur. J. Comb. 35 (2014)
Radoslav Fulek, Jan Kyncl, Igor Malinovic, Dömötör Pálvölgyi
Clustered Planarity Testing Revisited. Graph Drawing (2014)
Radoslav Fulek
Estimating the Number of Disjoint Edges in Simple Topological Graphs via Cylindrical Drawings. SIAM J. Discret. Math. 28 (1) (2014)
Radoslav Fulek
Towards the Hanani-Tutte Theorem for Clustered Graphs. WG (2014)
Radoslav Fulek, Jan Kyncl, Igor Malinovic, Dömötör Pálvölgyi
Efficient c-planarity testing algebraically CoRR (2013)
Radoslav Fulek, Andres J. Ruiz-Vargas
Topological graphs: empty triangles and disjoint matchings. SoCG (2013)
Radoslav Fulek
Estimating the number of disjoint edges in simple topological graphs via cylindrical drawings. CoRR (2013)
Steven Chaplick, Radoslav Fulek, Pavel Klavík
Extending Partial Representations of Circle Graphs. CoRR (2013)
Fabrizio Frati, Radoslav Fulek, Andres J. Ruiz-Vargas
On the Page Number of Upward Planar Directed Acyclic Graphs. J. Graph Algorithms Appl. 17 (3) (2013)
Martin Balko, Radoslav Fulek, Jan Kyncl
Crossing numbers and combinatorial characterization of monotone drawings of $K_n$. CoRR (2013)
Steven Chaplick, Radoslav Fulek, Pavel Klavík
Extending Partial Representations of Circle Graphs. Graph Drawing (2013)
Emilio Di Giacomo, Fabrizio Frati, Radoslav Fulek, Luca Grilli, Marcus Krug
Orthogeodesic point-set embedding of trees. Comput. Geom. 46 (8) (2013)
Radoslav Fulek, Csaba D. Tóth
Universal Point Sets for Planar Three-Trees. WADS (2013)
Radoslav Fulek, Balázs Keszegh, Filip Moric, Igor Uljarevic
On Polygons Excluding Point Sets. Graphs Comb. 29 (6) (2013)
Eyal Ackerman, Radoslav Fulek, Csaba D. Tóth
Graphs That Admit Polyline Drawings with Few Crossing Angles. SIAM J. Discret. Math. 26 (1) (2012)
Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
Adjacent Crossings Do Matter. J. Graph Algorithms Appl. 16 (3) (2012)
Karin Arikushi, Radoslav Fulek, Balázs Keszegh, Filip Moric, Csaba D. Tóth
Graphs that admit right angle crossing drawings. Comput. Geom. 45 (4) (2012)
Radoslav Fulek, Csaba D. Tóth
Universal point sets for planar three-tree CoRR (2012)
Radoslav Fulek, János Pach
A computational approach to Conway's thrackle conjecture. Comput. Geom. 44 (6-7) (2011)
Radoslav Fulek, Filip Moric, David Pritchard
Diameter bounds for planar graphs. Discret. Math. 311 (5) (2011)
Radoslav Fulek, Daniel Neuwirth
On Sets of Lines Not-Supporting Trees CoRR (2011)
Radoslav Fulek, Noushin Saeedi, Deniz Sariöz
Convex obstacle numbers of outerplanar graphs and bipartite permutation graphs CoRR (2011)
Radoslav Fulek, Andrew Suk
On disjoint crossing families in geometric graphs. Electron. Notes Discret. Math. 38 (2011)
Fabrizio Frati, Radoslav Fulek, Andres J. Ruiz-Vargas
On the Page Number of Upward Planar Directed Acyclic Graphs. Graph Drawing (2011)
Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
Adjacent Crossings Do Matter. Graph Drawing (2011)
Emilio Di Giacomo, Fabrizio Frati, Radoslav Fulek, Luca Grilli, Marcus Krug
Orthogeodesic Point-Set Embedding of Trees. Graph Drawing (2011)
Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
Hanani-Tutte and Monotone Drawings. WG (2011)
Ondrej Bílka, Kevin Buchin, Radoslav Fulek, Masashi Kiyomi, Yoshio Okamoto, Shin-ichi Tanigawa, Csaba D. Tóth
A Tight Lower Bound for Convexly Independent Subsets of the Minkowski Sums of Planar Point Sets. Electron. J. Comb. 17 (1) (2010)
Eyal Ackerman, Radoslav Fulek, Csaba D. Tóth
On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles. Graph Drawing (2010)
Radoslav Fulek, Andrew Suk
On disjoint crossing families in geometric graphs. CoRR (2010)
Radoslav Fulek, Balázs Keszegh, Filip Moric, Igor Uljarevic
On polygons excluding point sets. CCCG (2010)
Radoslav Fulek, János Pach
A Computational Approach to Conway's Thrackle Conjecture. Graph Drawing (2010)
Radoslav Fulek
Coloring geometric hypergraph defined by an arrangement of half-planes. CCCG (2010)
Karin Arikushi, Radoslav Fulek, Balázs Keszegh, Filip Moric, Csaba D. Tóth
Graphs that Admit Right Angle Crossing Drawings. WG (2010)
Radoslav Fulek
Linear bound on extremal functions of some forbidden patterns in 0-1 matrices. Discret. Math. 309 (6) (2009)
Radoslav Fulek, Andreas F. Holmsen, János Pach
Intersecting Convex Sets by Rays. Discret. Comput. Geom. 42 (3) (2009)
Radoslav Fulek, Andreas F. Holmsen, János Pach
Intersecting convex sets by rays. SCG (2008)
Radoslav Fulek, Hongmei He, Ondrej Sýkora, Imrich Vrto
Outerplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete p-Partite Graphs. SOFSEM (2005)