About me

Bio

1982 - born in Čadca (Slovakia)
2000 - 2005 - master degree in informatics at Comenius Univeristy (Bratislava, Slovakia)
jun 2005 - aug 2006 - programmer in Isomi a.s. (Bratislava, Slovakia)
sept 2006 - jun 2008 - master degree in computing science at Simon Fraser University (Burnaby, BC, Canada)
sept 2008 - now - PhD student in mathematics at EPFL (Lausanne, Switzerland)

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
Radoslav Fulek, Andreas Holmsen, János Pach: Intersecting convex sets by rays. Symposium on Computational Geometry 2008: 385-391
Radoslav Fulek: Linear bound on extremal functions of some forbidden patterns in 0–1 matrices. Discrete Mathematics Volume 309 (6) April 2009: Pages 1736-1739
Kevin Buchin, Radoslav Fulek, Masashi Kiyomi, Yoshio Okamoto, Shin-ichi Tanigawa, and Csaba D. Tóth: A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets, in Proc. 7th Japan Conference on Computational Geometry and Graphs (Kanazawa, 2009), JAIST, to appear.

Radoslav Fulek: Intersecting convex sets by rays. Master's thesis. School of Computing Science, Simon Fraser University (2008)
Radoslav Fulek: Konvexné priesečníkové čísla vybraných tried grafov (in slovak) (Convex Crossing numbers of certain classes of graphs). Master's thesis. Department of Computing Science. Faculty of Mathematics, Physics and Informatics. Comenius University, 2005

thrackles (with János Pach), submitted
Polygonizations avoiding a set of points (with Balázs Keszegh, Filip Moriæ, and Igor Uljareviæ), submitted
Coloring geometric hypergraph defined by an arrangement of half-planes
Drawing Graphs with Orthogonal Crossings (with Balázs Keszegh and Filip Moriæ)
The code for the thrackle write-up

Lower bound on the chromatic number of discrete Borsuk graph (with Gábor Tardos)
On a planar matching in line segments endpoints visibility graph