A unified FPT framework for crossing number problems
From MaRDI portal
Cites work
- A near-optimal planarization algorithm
- A subpolynomial approximation algorithm for graph crossing number in low-degree graphs
- Adding one edge to planar graphs makes crossing number and 1-planarity hard
- Algorithms for graphs embeddable with few crossings per edge
- Complexity of anchored crossing number and crossing number of almost planar graphs
- Computing crossing numbers in quadratic time
- Crossing number is hard for cubic graphs
- Crossing Number is NP-Complete
- Crossing number is NP-hard for constant path-width (and tree-width)
- Crossing Numbers and Parameterized Complexity
- Crossing Numbers of Beyond-Planar Graphs Revisited
- Crossing numbers of graph embedding pairs on closed surfaces
- Crossing numbers of graphs with rotation systems
- Gap-planar graphs
- Graph-encoded maps
- Graphs drawn with few crossings per edge
- Graphs on surfaces
- Hardness of approximation for crossing number
- scientific article; zbMATH DE number 3885928 (Why is no real title available?)
- scientific article; zbMATH DE number 5485473 (Why is no real title available?)
- scientific article; zbMATH DE number 3812514 (Why is no real title available?)
- scientific article; zbMATH DE number 3668651 (Why is no real title available?)
- scientific article; zbMATH DE number 2079390 (Why is no real title available?)
- scientific article; zbMATH DE number 7662167 (Why is no real title available?)
- Title not available (Why is no real title available?)
- Min-\(k\)-planar drawings of graphs
- Note on min-k-planar drawings of graphs
- Odd crossing number and crossing number are not the same
- On hardness of the joint crossing number
- On the uncrossed number of graphs
- Parameterised partially-predrawn crossing number
- Parameterized algorithms for beyond-planar crossing numbers
- Planarizing graphs and their drawings by vertex splitting
- Quasi-planar graphs have a linear number of edges
- SPLITTING NUMBER is NP-complete
- Testing graph isotopy on surfaces
- The density of fan-planar graphs
- The graph crossing number and its variants: a survey
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The splitting number of the complete graph
- Weakly and Strongly Fan-Planar Graphs
This page was built for publication: A unified FPT framework for crossing number problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7322409)
