Bienstock, D.. "Some Provably Hard Crossing Number Problems.." Discrete & computational geometry 6.5 (1991): 443-460. <http://eudml.org/doc/131170>.
@article{Bienstock1991, author = {Bienstock, D.}, journal = {Discrete & computational geometry}, keywords = {crossing number problems; drawing a graph; pseudolines; arrangement; crossing drawing; polynomial-time algorithm; NP; tight bound}, number = {5}, pages = {443-460}, title = {Some Provably Hard Crossing Number Problems.}, url = {http://eudml.org/doc/131170}, volume = {6}, year = {1991}, }
TY - JOUR AU - Bienstock, D. TI - Some Provably Hard Crossing Number Problems. JO - Discrete & computational geometry PY - 1991 VL - 6 IS - 5 SP - 443 EP - 460 KW - crossing number problems; drawing a graph; pseudolines; arrangement; crossing drawing; polynomial-time algorithm; NP; tight bound UR - http://eudml.org/doc/131170 ER -
