R. Fulek

activity

20092020

most citedCrossing numbers and combinatorial characterization of monotone drawings of

K_{n}

30 citations · 65 across the 19 of their papers we have counts for

collaborators

Showing 2011Show all

2 papers · 1 filter

cs.DM2011

Convex obstacle numbers of outerplanar graphs and bipartite permutation graphs

Radoslav Fulek, Noushin Saeedi, Deniz Sarioz

The disjoint convex obstacle number of a graph G is the smallest number h such that there is a set of h pairwise disjoint convex polygons (obstacles) and a set of n points in the p…

cs.DM2011

On Sets of Lines Not-Supporting Trees

Radoslav Fulek, Daniel Neuwirth

We study the following problem introduced by Dujmovic et al. Given a tree $T = (V, E)$ , on $n$ vertices, a set of $n$ lines $L$ in the plane and a bijection $ι: V \rightar…