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-10-09},
urls = {https://pdfs.semanticscholar.org/9413/3f598974f93b089ca7d2875d59d0dab1e1eb.pdf},
collections = {Animals,Attention-grabbing titles,Basically computer science,Games to play with friends,About proof,Computational complexity of games},
url = {https://pdfs.semanticscholar.org/9413/3f598974f93b089ca7d2875d59d0dab1e1eb.pdf},
urldate = {2012-01-27},
year = 2004,
booktitle = {Proceedings of the 3rd International Conference on FUN with Algorithms},
pages = {65--76}
}