Radoslav Fulek

92 papers A* 9A 14B 6C 1Journal 58Unranked 4

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