  We show that for every fixed non-negative integer k there is a quadratic time
algorithm that decides whether a given graph has crossing number at most k and,
if this is the case, computes a drawing of the graph in the plane with at most
k crossings.
