

Author: Pelsmajer Michael Schaefer Marcus Štefankovič Daniel
Publisher: Springer Publishing Company
ISSN: 0178-4617
Source: Algorithmica, Vol.60, Iss.3, 2011-07, pp. : 679-702
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content


Crossing Number and Weighted Crossing Number of Near-Planar Graphs
Algorithmica, Vol. 60, Iss. 3, 2011-07 ,pp. :





