A unified FPT framework reduces many crossing-number variants on surfaces to simplicial-complex embeddability, parameterized by genus and crossing bound, with linear or quadratic dependence.
14 Heather Hulett, Todd G
2 Pith papers cite this work, alongside 1 external citations. Polarity classification is still indexing.
2
Pith papers citing it
1
external citations · Crossref
fields
cs.CG 2representative citing papers
Proves NP-hardness of recognizing min-1-planar graphs.
citing papers explorer
-
A Unified FPT Framework for Crossing Number Problems
A unified FPT framework reduces many crossing-number variants on surfaces to simplicial-complex embeddability, parameterized by genus and crossing bound, with linear or quadratic dependence.
-
Min-1-Planarity is NP-Hard
Proves NP-hardness of recognizing min-1-planar graphs.