BibTeX entry
@article{Cormode2004,
key = {Cormode2004},
type = {article},
title = {The hardness of the Lemmings game, or Oh no, more NP-completeness proofs},
author = {Cormode, Graham},
abstract = {},
comment = {},
date_added = {2012-01-27},
date_published = {2004-07-13},
urls = {https://dimacs.rutgers.edu/{\~{}}graham/pubs/papers/cormodelemmings.pdf},
collections = {about-proof,animals,attention-grabbing-titles,basically-computer-science,computational-complexity-of-games,games-to-play-with-friends},
url = {https://dimacs.rutgers.edu/{\~{}}graham/pubs/papers/cormodelemmings.pdf},
urldate = {2012-01-27},
year = 2004,
booktitle = {Proceedings of the 3rd International Conference on FUN with Algorithms},
pages = {65--76}
}