Pages that link to "Item:Q602742"
From MaRDI portal
The following pages link to The hardness of approximating the boxicity, cubicity and threshold dimension of a graph (Q602742):
Displaying 8 items.
- Structural parameterizations for boxicity (Q289935) (← links)
- A constant factor approximation algorithm for boxicity of circular arc graphs (Q741528) (← links)
- On the stab number of rectangle intersection graphs (Q778517) (← links)
- The relationship between the threshold dimension of split graphs and various dimensional parameters (Q803177) (← links)
- Sublinear approximation algorithms for boxicity and related problems (Q1693125) (← links)
- On the complexity of the approximation of nonplanarity parameters for cubic graphs (Q2741456) (← links)
- Approximation hardness of optimization problems in intersection graphs of \(d\)-dimensional boxes (Q2921679) (← links)
- Contact graphs of boxes with unidirectional contacts (Q6599818) (← links)