%0 Report %1 w-spnph-00 %A Wolff, Alexander %D 2000 %K labelplacement complexitytheory graphdrawing computationalgeometry %N 11/2000 %T A Simple Proof for the NP-Hardness of Edge Labeling %U http://www.math-inf.uni-greifswald.de/preprints/shadow/wolff00_11.rdf.html

@techreport{w-spnph-00, added-at = {2010-04-13T09:41:44.000+0200}, author = {Wolff, Alexander}, biburl = {https://www.bibsonomy.org/bibtex/2ba6b7b1b4e67ff58e95cc77b43a4a938/fink}, cites = {af-aesam-84, c-accgc-96, cms-esapf-95, df-esdmn-89, dkmt-elglt-98, dmmmz-mlg-97, ecms-gcla-97, fw-ppalm-91, h-aanpa-82, il-nhsml-97, kr-pcr-92, kt-alehd-97, kt-elpp-97, kt-mlpp-98, kt-ualgf-98, l-pftu-82, m-ctcc-80, ms-ccclp-91, nh-mlagl-00, sw-lpc-99, sw-lpc-01, ksw-plsl-99, ws-mlb-96, ww-pmla-97, wwks-3rsgl-01, z-sl01i-90, ZZZ}, institution = {#UG#}, interhash = {1e7befba32e4424eada65441cc2403b6}, intrahash = {ba6b7b1b4e67ff58e95cc77b43a4a938}, keywords = {labelplacement complexitytheory graphdrawing computationalgeometry}, month = {#sep#}, number = {11/2000}, pdf = {http://www.math-inf.uni-greifswald.de/pub/full/prep/2000/wolff00_11.pdf}, timestamp = {2010-04-13T09:41:44.000+0200}, title = {A Simple Proof for the {NP}-Hardness of Edge Labeling}, type = {Technical report}, url = {http://www.math-inf.uni-greifswald.de/preprints/shadow/wolff00_11.rdf.html}, year = 2000 }