Exact crossing number parameterized by vertex cover
type: Item
instance of: scholarly article
title: Exact crossing number parameterized by vertex cover
DOI: 10.1007/978-3-030-35802-0_24
author: Petr Hliněný
author: Abhisekh Sankaran
publication date: 2020-10-26T00:00:00Z
full work available at URL: https://arxiv.org/abs/1906.06048
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 7266125
zbMATH Keywords: graph drawing
zbMATH Keywords: crossing number
zbMATH Keywords: parameterized complexity
zbMATH Keywords: vertex cover
MaRDI profile type: Publication
OpenAlex ID: W2990235292
cites work: A framework for solving VLSI graph layout problems
cites work: Q5136229
cites work: Hardness of approximation for crossing number
cites work: Crossing and Weighted Crossing Number of Near-Planar Graphs
cites work: Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard
cites work: Vertex insertion approximates the crossing number of apex graphs
cites work: A tighter insertion-based approximation of the crossing number
cites work: Zarankiewicz's conjecture is finite for each fixed \(m\)
cites work: An algorithm for the graph crossing number problem
cites work: Q4027320
cites work: Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas
cites work: Approximating the rectilinear crossing number
cites work: Crossing minimization in perturbed drawings
cites work: Crossing Number is NP-Complete
cites work: The crossing number of a projective graph is quadratic in the face–width
cites work: Computing crossing numbers in quadratic time
cites work: Q5417677
cites work: On the Crossing Number of Almost Planar Graphs
cites work: Q3549636
description: scientific article; zbMATH DE number 7266125