Pages that link to "Item:Q2775900"
From MaRDI portal
The following pages link to Efficient approximation algorithms for tiling and packing problems with rectangles (Q2775900):
Displaying 19 items.
- Aspects of a multivariate complexity analysis for rectangle tiling (Q408398) (← links)
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane (Q412277) (← links)
- Approximation algorithms for maximum independent set of pseudo-disks (Q452004) (← links)
- Minimum vertex cover in rectangle graphs (Q551504) (← links)
- Geometric representation of graphs in low dimension using axis parallel boxes (Q848956) (← links)
- An upper bound for cubicity in terms of boxicity (Q1025528) (← links)
- A note on maximum independent sets in rectangle intersection graphs (Q1029038) (← links)
- Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking (Q1742371) (← links)
- Cubicity and bandwidth (Q1938886) (← links)
- On the speed of algebraically defined graph classes (Q2227284) (← links)
- Approximating points by a piecewise linear function (Q2375945) (← links)
- Admission control with advance reservations in simple networks (Q2466012) (← links)
- Independent set of intersection graphs of convex objects in 2D (Q2489017) (← links)
- Approximation algorithms on consistent dynamic map labeling (Q2629235) (← links)
- Improved approximation algorithms for rectangle tiling and packing. (Q2768328) (← links)
- RELATIONS BETWEEN TWO COMMON TYPES OF RECTANGULAR TILINGS (Q3636314) (← links)
- On the Cubicity of AT-Free Graphs and Circular-Arc Graphs (Q3655149) (← links)
- Tiling with Squares and Packing Dominos in Polynomial Time (Q6051995) (← links)
- 4/3 rectangle tiling lower bound (Q6663514) (← links)
