%0 Conference Paper %1 conf/gd/SchreiberS98 %A Schreiber, Falk %A Skodinis, Konstantin %B Graph Drawing %D 1998 %E Whitesides, Sue %I Springer %K dblp %P 288-301 %T NP-Completeness of Some Tree-Clustering Problems. %U http://dblp.uni-trier.de/db/conf/gd/gd98.html#SchreiberS98 %V 1547 %@ 3-540-65473-9

@inproceedings{conf/gd/SchreiberS98, added-at = {2017-05-23T00:00:00.000+0200}, author = {Schreiber, Falk and Skodinis, Konstantin}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/25f436aebc34bc484d26851ab08d613f0/dblp}, booktitle = {Graph Drawing}, crossref = {conf/gd/1998}, editor = {Whitesides, Sue}, ee = {https://doi.org/10.1007/3-540-37623-2_22}, interhash = {d1249137c44a2e3d3f1137f6dddd0a7e}, intrahash = {5f436aebc34bc484d26851ab08d613f0}, isbn = {3-540-65473-9}, keywords = {dblp}, pages = {288-301}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-09-27T16:17:04.000+0200}, title = {NP-Completeness of Some Tree-Clustering Problems.}, url = {http://dblp.uni-trier.de/db/conf/gd/gd98.html#SchreiberS98}, volume = 1547, year = 1998 }