%0 Conference Paper %1 conf/cocoon/DemaineHL03 %A Demaine, Erik D. %A Hohenberger, Susan %A Liben-Nowell, David %B COCOON %D 2003 %E Warnow, Tandy J. %E Zhu, Binhai %I Springer %K dblp %P 351-363 %T Tetris is Hard, Even to Approximate. %U http://dblp.uni-trier.de/db/conf/cocoon/cocoon2003.html#DemaineHL03 %V 2697 %@ 3-540-40534-8

@inproceedings{conf/cocoon/DemaineHL03, added-at = {2017-05-23T00:00:00.000+0200}, author = {Demaine, Erik D. and Hohenberger, Susan and Liben-Nowell, David}, biburl = {https://www.bibsonomy.org/bibtex/295ca23344868a596077a6ac16594a028/dblp}, booktitle = {COCOON}, crossref = {conf/cocoon/2003}, editor = {Warnow, Tandy J. and Zhu, Binhai}, ee = {https://doi.org/10.1007/3-540-45071-8_36}, interhash = {1189f3436b904e5abeb34152a759dc65}, intrahash = {95ca23344868a596077a6ac16594a028}, isbn = {3-540-40534-8}, keywords = {dblp}, pages = {351-363}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T19:37:42.000+0200}, title = {Tetris is Hard, Even to Approximate.}, url = {http://dblp.uni-trier.de/db/conf/cocoon/cocoon2003.html#DemaineHL03}, volume = 2697, year = 2003 }