Structural parameterizations for boxicity
type: Item
instance of: scholarly article
title: Structural parameterizations for boxicity
title: Structural Parameterizations for Boxicity
zbMATH Open document ID: 1339.68200
zbMATH Open document ID: 1335.68182
DOI: 10.1007/978-3-319-12340-0_10
DOI: 10.1007/S00453-015-0011-0
author: Henning Bruhn
author: Morgan Chopin
author: Felix Joos
author: Oliver Schaudt
published in: Algorithmica
published in: Graph-Theoretic Concepts in Computer Science
publication date: 2016-05-31T00:00:00Z
publication date: 2015-09-09T00:00:00Z
full work available at URL: https://arxiv.org/abs/1402.4992
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C62
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6587989
zbMATH DE Number: 6479924
zbMATH Keywords: boxicity
zbMATH Keywords: parameterized complexity
zbMATH Keywords: kernelization
zbMATH Keywords: treewidth
MaRDI profile type: Publication
OpenAlex ID: W1548626548
OpenAlex ID: W1598610800
arXiv ID: 1402.4992
cites work: Polynomial Time and Parameterized Approximation Algorithms for Boxicity
cites work: The hardness of approximating the boxicity, cubicity and threshold dimension of a graph
cites work: Boxicity and Poset Dimension
cites work: Parameterized Algorithms for Boxicity
cites work: On a Coloring Problem.
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: Fixed-parameter tractability of graph modification problems for hereditary properties
cites work: Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation
cites work: Boxicity and treewidth
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Q3577833
cites work: Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width
cites work: Fundamentals of parameterized complexity
cites work: Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications
cites work: Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
cites work: Q4657585
cites work: A special planar satisfiability problem and a consequence of its NP- completeness
cites work: Representation of a finite graph by a set of intervals on the real line
cites work: Q5588433
cites work: Efficient graph representations
cites work: Interval representations of planar graphs
cites work: The Complexity of the Partial Order Dimension Problem
description: scientific article; zbMATH DE number 6479924
alternative label: Structural Parameterizations for Boxicity