On the number of anchored rectangle packings for a planar point set
From MaRDI portal
(Redirected from Publication:344784)
Recommendations
Cites work
- scientific article; zbMATH DE number 5764825 (Why is no real title available?)
- scientific article; zbMATH DE number 3305794 (Why is no real title available?)
- A \((5/3+\varepsilon)\)-approximation for strip packing
- A census of plane graphs with polyline edges
- A quasi-PTAS for the two-dimensional geometric knapsack problem
- Asymptotic enumeration and limit laws of planar graphs
- Bounds on the maximum multiplicity of some common geometric graphs
- Counting plane graphs: cross-graph charging schemes
- Crossing-Free Subgraphs
- Improved approximation algorithm for two-dimensional bin packing
- Labeling points with given rectangles
- Mathematical mind-benders
- New combinatorial descriptions of the triangulations of cyclic polytopes and the second higher Stasheff--Tamari posets
- On the number of rectangulations of a planar point set
- Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
- Point labeling with sliding labels
- Reverse search for enumeration
Cited in
(6)- Combinatorial properties of triangle-free rectangle arrangements and the squarability problem
- On the number of anchored rectangle packings for a planar point set
- Conflict-free coloring of string graphs
- Anchored rectangle and square packings
- Maximum area axis-aligned square packings
- Packing boundary-anchored rectangles and squares
This page was built for publication: On the number of anchored rectangle packings for a planar point set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344784)