Complexity results for the horizontal bar packing problem
References (8)
- et al.
Reconstructing convex polyominoes from their horizontal and vertical projections
Theoretical Computer Science
(1996) - et al.
Tiling with bars under tomographic constraints
Theoretical Computer Science
(2003) Reconstruction of domino tiling from its two orthogonal projections
Theoretical Computer Science
(2001)- et al.
An acyclic days-off scheduling problem
4OR
(2006)
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 2008 Elsevier B.V. All rights reserved.