Structural parameterizations for boxicity (Q289935): Difference between revisions

From MaRDI portal
Merged Item from Q2945183
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Polynomial Time and Parameterized Approximation Algorithms for Boxicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of approximating the boxicity, cubicity and threshold dimension of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boxicity and Poset Dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for Boxicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Coloring Problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability of graph modification problems for hereditary properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boxicity and treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4657585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A special planar satisfiability problem and a consequence of its NP- completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation of a finite graph by a set of intervals on the real line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient graph representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval representations of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Partial Order Dimension Problem / rank
 
Normal rank

Latest revision as of 01:50, 12 July 2024

scientific article; zbMATH DE number 6479924
  • Structural Parameterizations for Boxicity
Language Label Description Also known as
English
Structural parameterizations for boxicity
scientific article; zbMATH DE number 6479924
  • Structural Parameterizations for Boxicity

Statements

Structural parameterizations for boxicity (English)
0 references
Structural Parameterizations for Boxicity (English)
0 references
0 references
0 references
0 references
0 references
31 May 2016
0 references
9 September 2015
0 references
boxicity
0 references
parameterized complexity
0 references
kernelization
0 references
treewidth
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references