Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

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

Dania El-Khechen et al. (2009)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2020-03-12

- view
  - electronic edition @ cccg.ca (open access)
- export record
  dblp key:
  - conf/cccg/El-KhechenDIO09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cccg/El-KhechenDIO09
Dania El-Khechen, Muriel Dulieu, John Iacono, Nikolaj van Omme:
Packing 2×2 unit squares into grid polygons is NP-complete. CCCG 2009: 33-36

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.