Parameterised partially-predrawn crossing number

DOI10.4230/LIPICS.SOCG.2022.46MaRDI QIDQ6539550zbMATH OpenFDO

Authors Thekla Hamm, Petr Hliněný

Publication date 14 May 2024

Full work available at URL https://doi.org/10.4230/LIPICS.SOCG.2022.46

zbMATH Keywords

crossing numberdrawing extensionparameterised complexitypartial planarity

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Crossing Numbers and Parameterized Complexity
• Which crossing number is it anyway?
• On graph crossing number and edge planarization
• An algorithm for the graph crossing number problem
• Parameterized analysis and crossing minimization problems

Cited in

(7)

• On k-plane insertion into plane drawings
• Parameterized algorithms for beyond-planar crossing numbers
• A unified FPT framework for crossing number problems
• Heuristics for exact 1-planarity testing
• Structural parameterizations of \(k\)-planarity
• Heuristics for exact 1-planarity testing
• A dichotomy for 1-planarity with restricted crossing types parameterized by treewidth

This page was built for publication: Parameterised partially-predrawn crossing number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6539550)