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

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

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Original languageEnglish (US)
    Title of host publicationProceedings of the 21st Annual Canadian Conference on Computational Geometry, CCCG 2009
    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

    Fingerprint

    Polygon
    Packing
    NP-complete problem
    Grid
    Unit

    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. In Proceedings of the 21st Annual Canadian Conference on Computational Geometry, CCCG 2009 (pp. 33-36)

    Packing 2 × 2 unit squares into grid polygons is NP-complete. / El-Khechen, Dania; Dulieu, Muriel; Iacono, John; Van Omme, Nikolaj.

    Proceedings of the 21st Annual Canadian Conference on Computational Geometry, CCCG 2009. 2009. p. 33-36.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    El-Khechen, D, Dulieu, M, Iacono, J & Van Omme, N 2009, Packing 2 × 2 unit squares into grid polygons is NP-complete. in Proceedings of the 21st Annual Canadian Conference on Computational Geometry, CCCG 2009. pp. 33-36, 21st Annual Canadian Conference on Computational Geometry, CCCG 2009, Vancouver, BC, Canada, 8/17/09.
    El-Khechen D, Dulieu M, Iacono J, Van Omme N. Packing 2 × 2 unit squares into grid polygons is NP-complete. In Proceedings of the 21st Annual Canadian Conference on Computational Geometry, CCCG 2009. 2009. p. 33-36
    El-Khechen, Dania ; Dulieu, Muriel ; Iacono, John ; Van Omme, Nikolaj. / Packing 2 × 2 unit squares into grid polygons is NP-complete. Proceedings of the 21st Annual Canadian Conference on Computational Geometry, CCCG 2009. 2009. pp. 33-36
    @inproceedings{8621e3bdbf15417592a509262efa343f,
    title = "Packing 2 × 2 unit squares into grid polygons is NP-complete",
    author = "Dania El-Khechen and Muriel Dulieu and John Iacono and {Van Omme}, Nikolaj",
    year = "2009",
    language = "English (US)",
    pages = "33--36",
    booktitle = "Proceedings of the 21st Annual Canadian Conference on Computational Geometry, CCCG 2009",

    }

    TY - GEN

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

    AU - El-Khechen, Dania

    AU - Dulieu, Muriel

    AU - Iacono, John

    AU - Van Omme, Nikolaj

    PY - 2009

    Y1 - 2009

    UR - http://www.scopus.com/inward/record.url?scp=84882989137&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84882989137&partnerID=8YFLogxK

    M3 - Conference contribution

    AN - SCOPUS:84882989137

    SP - 33

    EP - 36

    BT - Proceedings of the 21st Annual Canadian Conference on Computational Geometry, CCCG 2009

    ER -