Crossing Numbers and Parameterized Complexity

DOI10.1007/978-3-540-77537-9_6zbMath1137.68502OpenAlexW1708570965MaRDI QIDQ5452207

Daniel Štefanković, Michael J. Pelsmajer, Marcus Schaefer

Publication date: 25 March 2008

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77537-9_6

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

Recognizing and drawing IC-planar graphs ⋮ Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth ⋮ Parameterized analysis and crossing minimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Note on the pair-crossing number and the odd-crossing number
• String graphs requiring exponential representations
• Which crossing number is it anyway?
• Computing crossing numbers in quadratic time
• Decidability of string graphs
• Graph Drawing

This page was built for publication: Crossing Numbers and Parameterized Complexity