Parameterized algorithmics for linear arrangement problems
type: Item
instance of: scholarly article
title: Parameterized algorithmics for linear arrangement problems
zbMATH Open document ID: 1178.68376
author: Henning Fernau
published in: Discrete Applied Mathematics
publication date: 2009-03-04T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 5522958
zbMATH Keywords: parameterized algorithms
zbMATH Keywords: linear arrangement problems
describes a project that uses: LOLIB
MaRDI profile type: Publication
full work available at URL: j.dam.2008.05.008
OpenAlex ID: W1988217358
cites work: Optimal Linear Ordering
cites work: SOFSEM 2006: Theory and Practice of Computer Science
cites work: Parameterized complexity: exponential speed-up for planar graph problems
cites work: Q3780902
cites work: Q4495674
cites work: Mathematical Foundations of Computer Science 2004
cites work: Q4393480
cites work: Q3043700
cites work: Graph Drawing
cites work: Two-Layer Planarization: Improving on Parameterized Algorithmics
cites work: Q4198056
cites work: Some simplified NP-complete graph problems
cites work: Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT.
cites work: The Linear Arrangement Problem Parameterized Above Guaranteed Value
cites work: Parameterizing above Guaranteed Values: MaxSat and MaxCut
cites work: Optimal Numberings of an $N \times N$ Array
cites work: Applications of the crossing number
cites work: Experiments on the minimum linear arrangement problem
cites work: Q4036610
cites work: Q3680289
cites work: Q3396557
cites work: Q4414647
DOI: 10.1016/J.DAM.2008.05.008
Recommended article: Q2721982
Recommended article: Approximation algorithms for maximum linear arrangement
Recommended article: Q4414506
Recommended article: Tractable Parameterizations for the Minimum Linear Arrangement Problem
Recommended article: The linear arrangement problem parameterized above guaranteed value
Recommended article: The Linear Arrangement Problem Parameterized Above Guaranteed Value
Recommended article: Linear arrangement problems on recursively partitioned graphs
Recommended article: Parameterized Algorithms for Inclusion of Linear Matchings
Recommended article: Q4526868
description: scientific article; zbMATH DE number 5522958