Packing 2 × 2 unit squares into grid polygons is NP-complete

Dania El-Khechen, Muriel Dulieu, John Iacono, Nikolaj Van Omme

    Research output: Contribution to conferencePaper

    Original languageEnglish (US)
    Pages33-36
    Number of pages4
    StatePublished - 2009
    Event21st Annual Canadian Conference on Computational Geometry, CCCG 2009 - Vancouver, BC, Canada
    Duration: Aug 17 2009Aug 19 2009

    Other

    Other21st Annual Canadian Conference on Computational Geometry, CCCG 2009
    CountryCanada
    CityVancouver, BC
    Period8/17/098/19/09

    ASJC Scopus subject areas

    • Computational Mathematics
    • Geometry and Topology

    Cite this

    El-Khechen, D., Dulieu, M., Iacono, J., & Van Omme, N. (2009). Packing 2 × 2 unit squares into grid polygons is NP-complete. 33-36. Paper presented at 21st Annual Canadian Conference on Computational Geometry, CCCG 2009, Vancouver, BC, Canada.