Fixed parameter algorithms for one-sided crossing minimization revisited
type: Item
instance of: scholarly article
title: Fixed parameter algorithms for one-sided crossing minimization revisited
zbMATH Open document ID: 1155.68054
author: Vida Dujmović
author: Henning Fernau
author: Michael Kaufmann
published in: Journal of Discrete Algorithms
publication date: 2008-08-08T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C62
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5309342
zbMATH Keywords: graph drawing
zbMATH Keywords: crossing minimization
zbMATH Keywords: 2-layer drawings
zbMATH Keywords: \(\mathcal {FPT}\)
zbMATH Keywords: parameterized algorithms
MaRDI profile type: Publication
full work available at URL: j.jda.2006.12.008
OpenAlex ID: W1966697435
cites work: Kernels: Annotated, Proper and Induced
cites work: Q3154375
cites work: Q4393480
cites work: A fixed-parameter approach to 2-layer planarization
cites work: Q4796197
cites work: Graph Drawing
cites work: A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation
cites work: Edge crossings in drawings of bipartite graphs
cites work: Q3043710
cites work: An improved bound on the one-sided minimum crossing number in two-layered drawings
cites work: A general method to speed up fixed-parameter-tractable algorithms
DOI: 10.1016/J.JDA.2006.12.008
description: scientific article; zbMATH DE number 5309342