Back to Results
First PageMeta Content
Complexity classes / Discrete geometry / Packaging / Packing problem / Sphere packing / NP-hard / Polygon / Induced path / NP-complete / Theoretical computer science / Mathematics / Geometry


CCCG 2009, Vancouver, BC, August 17–19, 2009 Packing 2 × 2 unit squares into grid polygons is NP-complete Dania El-Khechen∗ 1
Add to Reading List

Document Date: 2009-09-02 14:19:26

Open Document

File Size: 179,40 KB

Share Result on Facebook

City

Vancouver / /

Country

Canada / /

Facility

Polytechnic Institute of NYU / Concordia University / Concorida University / /

IndustryTerm

polynomial algorithm / nondeterministic algorithm / /

Organization

Concorida University / Concordia University / U.S.-Israel Binational Science Foundation / NYU / National Science Foundation / Polytechnic Institute / /

Person

Robert J. Fowler / Dania El-Khechen / John Iacono / Steven L. Tanimoto / Joseph S. B. Mitchell / Boris Aronov / Mike Paterson / Nikolaj van Omme / Thomas Fevens / Erik D. Demaine / /

ProvinceOrState

British Columbia / /

Technology

4 Algorithm / polynomial algorithm / nondeterministic algorithm / /

URL

http /

SocialTag