Radoslav Fulek

About me

  • Link to my new website

  • Post Doctoral Researcher
  • if you want to write me: first name . last name a epfl ch


  • 1982 – born in Čadca (Slovakia)    
  • Sept 2000 – Jun 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 – May 2012 – PhD student in mathematics at EPFL (Lausanne, Switzerland)
  • May 2012 – now – Post Doctoral Researcher at EPFL (Lausanne, Switzerland)







  • Efficient c-planarity testing algebraically (with J. Kynčl, and D. Pálvölgyi), manuscript in preparation
  • Universal point sets for 3-trees (with C. D. Tóth), submitted
  • Plane graphs with free edge lengths (with F. Morić, Y. Okamoto, T. Szabó, and C. D. Tóth), submitted
  • Homometric sets in trees (with S. Mitrović), submitted
  • On lines not supporting trees (with D. Neuwirth), submitted

Unpublished work

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


Code for thrackle write-up: