Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRadoslav Fulek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j33]Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer:
Hanani-Tutte for Radial Planarity II. Electron. J. Comb. 30(1) (2023)- 2022
- [j32]Radoslav Fulek
, Jan Kyncl:
The $\mathbb {Z}_2$-Genus of Kuratowski Minors. Discret. Comput. Geom. 68(2): 425-447 (2022) - [j31]Radoslav Fulek, Csaba D. Tóth:
Atomic Embeddability, Clustered Planarity, and Thickenability. J. ACM 69(2): 13:1-13:34 (2022) - [j30]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): 363-380 (2022) - 2021
- [j29]Radoslav Fulek, Balázs Keszegh:
Saturation Problems about Forbidden 0-1 Submatrices. SIAM J. Discret. Math. 35(3): 1964-1977 (2021) - [c34]Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer:
Strong Hanani-Tutte for the Torus. SoCG 2021: 38:1-38:15 - 2020
- [j28]Radoslav Fulek:
Embedding Graphs into Embedded Graphs. Algorithmica 82(11): 3282-3305 (2020) - [j27]Radoslav Fulek, Csaba D. Tóth:
Crossing minimization in perturbed drawings. J. Comb. Optim. 40(2): 279-302 (2020) - [c33]Alon Efrat, Radoslav Fulek, Stephen G. Kobourov, Csaba D. Tóth:
Polygons with Prescribed Angles in 2D and 3D. GD 2020: 135-147 - [c32]Radoslav Fulek, Csaba D. Tóth:
Atomic Embeddability, Clustered Planarity, and Thickenability. SODA 2020: 2876-2895 - [c31]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: 7:1-7:20 - [i24]Alon Efrat, Radoslav Fulek, Stephen G. Kobourov, Csaba D. Tóth:
Polygons with Prescribed Angles in 2D and 3D. CoRR abs/2008.10192 (2020) - [i23]Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer:
Strong Hanani-Tutte for the Torus. CoRR abs/2009.01683 (2020)
2010 – 2019
- 2019
- [j26]Radoslav Fulek, Jan Kyncl:
Counterexample to an Extension of the Hanani-Tutte Theorem on the Surface of Genus 4. Comb. 39(6): 1267-1279 (2019) - [j25]Radoslav Fulek, János Pach:
Thrackles: An improved upper bound. Discret. Appl. Math. 259: 226-231 (2019) - [j24]Steven Chaplick, Radoslav Fulek, Pavel Klavík:
Extending partial representations of circle graphs. J. Graph Theory 91(4): 365-394 (2019) - [j23]Hugo A. Akitaya, Radoslav Fulek, Csaba D. Tóth:
Recognizing Weak Embeddings of Graphs. ACM Trans. Algorithms 15(4): 50:1-50:27 (2019) - [c30]Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner:
The Crossing Tverberg Theorem. SoCG 2019: 38:1-38:13 - [c29]Radoslav Fulek, Jan Kyncl:
Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices. SoCG 2019: 39:1-39:16 - [i22]Radoslav Fulek, Jan Kyncl:
Z_2-genus of graphs and minimum rank of partial symmetric matrices. CoRR abs/1903.08637 (2019) - [i21]Radoslav Fulek, Csaba D. Tóth:
Atomic Embeddability, Clustered Planarity, and Thickenability. CoRR abs/1907.13086 (2019) - 2018
- [c28]Radoslav Fulek, Jan Kyncl:
Hanani-Tutte for Approximating Maps of Graphs. SoCG 2018: 39:1-39:15 - [c27]Radoslav Fulek, Jan Kyncl:
The Z_2-Genus of Kuratowski Minors. SoCG 2018: 40:1-40:14 - [c26]Radoslav Fulek, Csaba D. Tóth:
Crossing Minimization in Perturbed Drawings. GD 2018: 229-241 - [c25]Hugo A. Akitaya, Radoslav Fulek, Csaba D. Tóth:
Recognizing Weak Embeddings of Graphs. SODA 2018: 274-292 - [i20]Radoslav Fulek, Jan Kyncl:
The ℤ2-genus of Kuratowski minors. CoRR abs/1803.05085 (2018) - [i19]Radoslav Fulek, Csaba D. Tóth:
Crossing Minimization in Perturbed Drawings. CoRR abs/1808.07608 (2018) - [i18]Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner:
The Crossing Tverberg Theorem. CoRR abs/1812.04911 (2018) - 2017
- [j22]Radoslav Fulek, Jan Kyncl, Dömötör Pálvölgyi:
Unified Hanani-Tutte Theorem. Electron. J. Comb. 24(3): 3 (2017) - [j21]Radoslav Fulek:
C-planarity of embedded cyclic c-graphs. Comput. Geom. 66: 1-13 (2017) - [j20]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: 28-31 (2017) - [j19]Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer:
Hanani-Tutte for Radial Planarity. J. Graph Algorithms Appl. 21(1): 135-154 (2017) - [c24]Radoslav Fulek, János Pach:
Thrackles: An Improved Upper Bound. GD 2017: 160-166 - [c23]Radoslav Fulek:
Embedding Graphs into Embedded Graphs. ISAAC 2017: 34:1-34:12 - [i17]Radoslav Fulek, Jan Kyncl:
Hanani-Tutte for approximating maps of graphs. CoRR abs/1705.05243 (2017) - [i16]Radoslav Fulek, Jan Kyncl:
Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4. CoRR abs/1709.00508 (2017) - [i15]Hugo A. Akitaya, Radoslav Fulek, Csaba D. Tóth:
Recognizing Weak Embeddings of Graphs. CoRR abs/1709.09209 (2017) - 2016
- [c22]Radoslav Fulek:
C-Planarity of Embedded Cyclic c-Graphs. GD 2016: 94-106 - [c21]Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer:
Hanani-Tutte for Radial Planarity II. GD 2016: 468-481 - [c20]Radoslav Fulek:
Bounded Embeddings of Graphs in the Plane. IWOCA 2016: 31-42 - [i14]Radoslav Fulek:
C-planarity of Embedded Cyclic c-Graphs. CoRR abs/1602.01346 (2016) - [i13]Radoslav Fulek:
Embedding graphs into embedded graphs. CoRR abs/1608.02087 (2016) - [i12]Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer:
Hanani-Tutte for Radial Planarity II. CoRR abs/1608.08662 (2016) - [i11]Radoslav Fulek:
Bounded embeddings of graphs in the plane. CoRR abs/1610.07144 (2016) - [i10]Radoslav Fulek, Jan Kyncl, Dömötör Pálvölgyi:
Unified Hanani-Tutte theorem. CoRR abs/1612.00688 (2016) - 2015
- [j18]Radoslav Fulek, Jan Kyncl, Igor Malinovic, Dömötör Pálvölgyi:
Clustered Planarity Testing Revisited. Electron. J. Comb. 22(4): 4 (2015) - [j17]Martin Balko, Radoslav Fulek, Jan Kyncl:
Crossing Numbers and Combinatorial Characterization of Monotone Drawings of $$K_n$$ K n. Discret. Comput. Geom. 53(1): 107-143 (2015) - [j16]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): 259-289 (2015) - [j15]Radoslav Fulek, Csaba D. Tóth:
Universal point sets for planar three-trees. J. Discrete Algorithms 30: 101-112 (2015) - [c19]Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer:
Hanani-Tutte for Radial Planarity. GD 2015: 99-110 - [c18]Radoslav Fulek, Rados Radoicic:
Vertical Visibility Among Parallel Polygons in Three Dimensions. GD 2015: 373-379 - 2014
- [j14]Radoslav Fulek, Slobodan Mitrovic:
Homometric sets in trees. Eur. J. Comb. 35: 256-263 (2014) - [j13]Radoslav Fulek:
Estimating the Number of Disjoint Edges in Simple Topological Graphs via Cylindrical Drawings. SIAM J. Discret. Math. 28(1): 116-121 (2014) - [c17]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: 426 - [c16]Radoslav Fulek, Jan Kyncl, Igor Malinovic, Dömötör Pálvölgyi:
Clustered Planarity Testing Revisited. GD 2014: 428-439 - [c15]Radoslav Fulek:
Towards the Hanani-Tutte Theorem for Clustered Graphs. WG 2014: 176-188 - [i9]Radoslav Fulek:
Toward the Hanani-Tutte Theorem for Clustered Graphs. CoRR abs/1410.3022 (2014) - 2013
- [j12]Emilio Di Giacomo, Fabrizio Frati, Radoslav Fulek, Luca Grilli, Marcus Krug:
Orthogeodesic point-set embedding of trees. Comput. Geom. 46(8): 929-944 (2013) - [j11]Radoslav Fulek, Balázs Keszegh, Filip Moric, Igor Uljarevic:
On Polygons Excluding Point Sets. Graphs Comb. 29(6): 1741-1753 (2013) - [j10]Fabrizio Frati, Radoslav Fulek, Andres J. Ruiz-Vargas:
On the Page Number of Upward Planar Directed Acyclic Graphs. J. Graph Algorithms Appl. 17(3): 221-244 (2013) - [c14]Radoslav Fulek, Andres J. Ruiz-Vargas:
Topological graphs: empty triangles and disjoint matchings. SoCG 2013: 259-266 - [c13]Steven Chaplick, Radoslav Fulek, Pavel Klavík:
Extending Partial Representations of Circle Graphs. GD 2013: 131-142 - [c12]Radoslav Fulek, Csaba D. Tóth:
Universal Point Sets for Planar Three-Trees. WADS 2013: 341-352 - [i8]Radoslav Fulek, Jan Kyncl, Igor Malinovic, Dömötör Pálvölgyi:
Efficient c-planarity testing algebraically. CoRR abs/1305.4519 (2013) - [i7]Radoslav Fulek:
Estimating the number of disjoint edges in simple topological graphs via cylindrical drawings. CoRR abs/1307.4191 (2013) - [i6]Steven Chaplick, Radoslav Fulek, Pavel Klavík:
Extending Partial Representations of Circle Graphs. CoRR abs/1309.2399 (2013) - [i5]Martin Balko, Radoslav Fulek, Jan Kyncl:
Crossing numbers and combinatorial characterization of monotone drawings of $K_n$. CoRR abs/1312.3679 (2013) - 2012
- [j9]Karin Arikushi, Radoslav Fulek, Balázs Keszegh, Filip Moric, Csaba D. Tóth:
Graphs that admit right angle crossing drawings. Comput. Geom. 45(4): 169-177 (2012) - [j8]Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Adjacent Crossings Do Matter. J. Graph Algorithms Appl. 16(3): 759-782 (2012) - [j7]Eyal Ackerman, Radoslav Fulek, Csaba D. Tóth:
Graphs That Admit Polyline Drawings with Few Crossing Angles. SIAM J. Discret. Math. 26(1): 305-320 (2012) - [i4]Radoslav Fulek, Csaba D. Tóth:
Universal point sets for planar three-tree. CoRR abs/1212.6148 (2012) - 2011
- [j6]Radoslav Fulek, János Pach:
A computational approach to Conway's thrackle conjecture. Comput. Geom. 44(6-7): 345-355 (2011) - [j5]Radoslav Fulek, Filip Moric, David Pritchard:
Diameter bounds for planar graphs. Discret. Math. 311(5): 327-335 (2011) - [j4]Radoslav Fulek, Andrew Suk:
On disjoint crossing families in geometric graphs. Electron. Notes Discret. Math. 38: 367-375 (2011) - [c11]Emilio Di Giacomo, Fabrizio Frati, Radoslav Fulek, Luca Grilli, Marcus Krug:
Orthogeodesic Point-Set Embedding of Trees. GD 2011: 52-63 - [c10]Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Adjacent Crossings Do Matter. GD 2011: 343-354 - [c9]Fabrizio Frati, Radoslav Fulek, Andres J. Ruiz-Vargas:
On the Page Number of Upward Planar Directed Acyclic Graphs. GD 2011: 391-402 - [c8]Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Hanani-Tutte and Monotone Drawings. WG 2011: 283-294 - [i3]Radoslav Fulek, Daniel Neuwirth:
On Sets of Lines Not-Supporting Trees. CoRR abs/1104.1307 (2011) - [i2]Radoslav Fulek, Noushin Saeedi, Deniz Sariöz:
Convex obstacle numbers of outerplanar graphs and bipartite permutation graphs. CoRR abs/1104.4656 (2011) - 2010
- [j3]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) - [c7]Radoslav Fulek:
Coloring geometric hypergraph defined by an arrangement of half-planes. CCCG 2010: 71-74 - [c6]Radoslav Fulek, Balázs Keszegh, Filip Moric, Igor Uljarevic:
On polygons excluding point sets. CCCG 2010: 273-276 - [c5]Eyal Ackerman, Radoslav Fulek, Csaba D. Tóth:
On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles. GD 2010: 1-12 - [c4]Radoslav Fulek, János Pach:
A Computational Approach to Conway's Thrackle Conjecture. GD 2010: 226-237 - [c3]Karin Arikushi, Radoslav Fulek, Balázs Keszegh, Filip Moric, Csaba D. Tóth:
Graphs that Admit Right Angle Crossing Drawings. WG 2010: 135-146 - [i1]Radoslav Fulek, Andrew Suk:
On disjoint crossing families in geometric graphs. CoRR abs/1004.2850 (2010)
2000 – 2009
- 2009
- [j2]Radoslav Fulek, Andreas F. Holmsen, János Pach:
Intersecting Convex Sets by Rays. Discret. Comput. Geom. 42(3): 343-358 (2009) - [j1]Radoslav Fulek:
Linear bound on extremal functions of some forbidden patterns in 0-1 matrices. Discret. Math. 309(6): 1736-1739 (2009) - 2008
- [c2]Radoslav Fulek, Andreas F. Holmsen, János Pach:
Intersecting convex sets by rays. SCG 2008: 385-391 - 2005
- [c1]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: 376-379
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-02-18 23:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
