Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring
type: Item
instance of: scholarly article
title: Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring
zbMATH Open document ID: 1228.05154
author: Christian Komusiewicz
author: Rolf Niedermeier
author: Johannes Uhlmann
published in: Journal of Discrete Algorithms
publication date: 2011-05-03T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 5883239
zbMATH Keywords: interval constraint coloring
zbMATH Keywords: parametrized complexity
zbMATH Keywords: multivariate algorithmics
zbMATH Keywords: NP-hard problem
zbMATH Keywords: experiments
MaRDI profile type: Publication
full work available at URL: j.jda.2010.07.003
OpenAlex ID: W2147091866
cites work: Approximating the Interval Constrained Coloring Problem
cites work: 3-coloring in time
cites work: Kernelization: New Upper and Lower Bound Techniques
cites work: The Interval Constrained 3-Coloring Problem
cites work: A Polynomial Delay Algorithm for Enumerating Approximate Solutions to the Interval Constrained Coloring Problem
cites work: Q3579403
cites work: Q4393480
cites work: Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology
cites work: Graph Layout Problems Parameterized by Vertex Cover
cites work: Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover
cites work: Parametrized complexity theory.
cites work: An application of simultaneous diophantine approximation in combinatorial optimization
cites work: Fixed-parameter algorithms for CLOSEST STRING and related problems
cites work: Integer Programming with a Fixed Number of Variables
cites work: Q5710169
cites work: Reflections on Multivariate Algorithmics and Problem Parameterization
DOI: 10.1016/J.JDA.2010.07.003
description: scientific article; zbMATH DE number 5883239