Given a graph
and a subset
) of its edges, is there a drawing of
in which all edges of
are free of crossings? We show that this question can be solved in polynomial time using a Hanani-Tutte style approach. If we require the drawing of
to be straight-line, but allow up to one crossing along each edge in
, the problem turns out to be as hard as the existential theory of the real numbers.