publication venue for The complexity of computing the cylindrical and the t-circle crossing number of a graph. 25:-. 2018-01-01 The optimal drawings of K5,n. 21:-. 2014-01-01 Making a graph crossing-critical by multiplying its edges. 20:-. 2013-01-01 The crossing number of a projective graph is quadratic in the face - Width. 15:-. 2008-01-01