I am a mathematician and

theoretical computer scientist.

Currently I work as a Lecturer at UC San Diego.

I did my PhD at EPFL in Discrete and Combinatorial Geometry under the supervision of Janos Pach.

My general research interests are mostly in the area of discrete and combinatorial geometry. In particular, I am interested in topological graphs and combinatorial properties of arrangements of basic geometric objects such as points, lines, polygons, polyhedra, discs, convex sets etc.

July 2020 - Present

I joined UCSD as a lecturer at the department of mathematics.

September 2019 - September 2020

I joined University of Arizona as a postdoctoral researcher hosted by Stephen Kobourov.

I was working in the group of Uli Wagner on eliminating intersections in drawings of graphs.

March 2015 - June 2017

I joined IST Austria as an IST Fellow affiliated with the group of Uli Wagner.

September 2013 - February 2015

During my research stay at Columbia I was hosted by Maria Chudnovsky. The stay was funded by Early Postdoc.Mobility Grant of Swiss National Science Foundation with the project on Arrangements of Geometric Objects and Topological Graphs.

February 2013 - August 2013

During this research stay I was hosted by Jan Kratochvil.

May 2012 - January 2013

During this research stay I was hosted by Janos Pach.

rfulek ucsd edu

**Atomic Embeddability, Clustered Planarity, and Thickenability**
(with C. Toth)

**Counterexample to an Extension of the Hanani–Tutte Theorem on the Surface of Genus 4** (with J. Kyncl)

**Recognizing Weak Embeddings of Graphs** (with H. Akitaya and C. Toth)

**Crossing Numbers and Combinatorial Characterization of Monotone Drawings of K_n ** (with M. Balko and J. Kyncl)

**Intersecting Convex Sets by Rays** (with A. Holmsen and J. Pach)

Joint work with Csaba Toth

Journal of Combinatorial Optimization 2020Joint work with Hugo Akitaya and Csaba Toth

ACM Transactions on Algorithms 2019Joint work with Jan Kyncl

Combinatorica 2019
Extending Partial Representations of Circle Graphs
###

Joint work with Steven Chaplick and Pavel Klavik

Journal of Graph Theory 2019Joint work with Marcus Schaefer and Michael Pelsmajer

J. Graph Algorithms Appl. 2017Joint work with Jan Kyncl, Igor Malinovic and Domotor Palvolgyi

Electr. J. Comb. 2015Joint work with many people

Discrete and Computational Geometry 2015Joint work with Martin Balko and Jan Kyncl

Discrete and Computational Geometry 2015Joint work with Balazs Keszegh, Filip Moric and Igor Uljarevic

Graphs and Combinatorics 2013Joint work with Fabrizio Frati and Andres Ruiz-Vargas

J. Graph Algorithms Appl. 2013Joint work with Emilio Di Giacomo, Fabrizio Frati, Luca Grilli and Marcus Krug

Computational Geometry 2013Joint work with Eyal Ackerman and Csaba Toth

SIAM J. Discrete Math. 2012Joint work with Karin Arikushi, Balazs Keszegh, Filip Moric, and Csaba Toth

Computational Geometry 2012Joint work with Andrew Suk

Thirty Essays on Geometric Graph Theory, J. Pach ed., 2012Joint work with Marcus Schaefer, Michael Pelsmajer and Daniel Stefankovic

Thirty Essays on Geometric Graph Theory, J. Pach ed., 2012Joint work with Noushin Saeedi and Deniz Sarioz

Thirty Essays on Geometric Graph Theory, J. Pach ed., 2012Joint work with Michael Pelsmajer, Marcus Schaefer and Daniel Stefankovic

J. Graph Algorithms Appl. 2012Joint work with Janos Pach

Computational Geometry 2011Joint work with many people

Electr. J. Comb. 2010Joint work with Filip Moric and David Pritchard

Discrete Mathematics 2010Joint work with Andreas Holmsen and Janos Pach

Discrete and Computational Geometry 2009Joint work with Alon Efrat, Stephen Kobourov and Csaba Toth

GD 2020Joint work with Bernd Gaertner, Andrey Kupavskii, Pavel Valtr and Uli Wagner

SOCG 2019Joint work with Jan Kyncl

SOCG 2019Joint work with Rados Radoicic

GD 2015Joint work with Andres Ruiz-Vargas

SoCG 2013Joint work with Hongmei He, Ondrej Sykora and Imrich Vrto

SOFSEM 2005The purpose of the proposed project is two-fold. On the one hand, we aim to develop mathematical tools helpful in the design of fast graph drawing algorithms that minimize the number of edge crossings, under additional constraints. Our approach is based crucially on the Hanani-Tutte paradigm which reduces the detection of the existence of the desired crossing-free drawing of a graph to the algebraic problem of solving a system of linear equations. For this problem provably fast algorithms exist. On the other hand, along the way we intend to address several fundamental open problems about higher dimensional analogs of graphs, and graphs drawn in the plane and on more complicated surfaces, whose resolution would likely have a large impact on the area of graph/network visualization, as well as on the area of combinatorial and computational geometry.

Rate of convergence:

Rate of divergence: