« Back to Record
Citation APA

El-Khechen, D., Dulieu, M., Iacono, J., & Van Omme, N. (2009). Packing 2 × 2 unit squares into grid polygons is NP-complete. Proceedings of the annual ACM Symposium on Computational Geometry, 33-36.


Permalink

http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/326271

El-Khechen, D., Dulieu, M., Iacono, J., & Van Omme, N. (2009). Packing 2 × 2 unit squares into grid polygons is NP-complete. Proceedings of the annual ACM Symposium on Computational Geometry, 33-36.