%0 Conference Paper %1 conf/icci/HaralambidesM91 %A Haralambides, James %A Makedon, Fillia %B ICCI %D 1991 %E Dehne, Frank K. H. A. %E Fiala, Frantisek %E Koczkodaj, Waldemar W. %I Springer %K dblp %P 66-77 %T Approximation Algorithms for the Bandwidth Minimization Problem for a Large Class of Trees. %U http://dblp.uni-trier.de/db/conf/icci/icci1991.html#HaralambidesM91 %V 497 %@ 3-540-54029-6

@inproceedings{conf/icci/HaralambidesM91, added-at = {2017-05-19T00:00:00.000+0200}, author = {Haralambides, James and Makedon, Fillia}, biburl = {https://www.bibsonomy.org/bibtex/2236253c13923e2781c8d55c8b7c974c7/dblp}, booktitle = {ICCI}, crossref = {conf/icci/1991}, editor = {Dehne, Frank K. H. A. and Fiala, Frantisek and Koczkodaj, Waldemar W.}, ee = {https://doi.org/10.1007/3-540-54029-6_155}, interhash = {9e9f36f5b91015a304a811d9f7ff94f3}, intrahash = {236253c13923e2781c8d55c8b7c974c7}, isbn = {3-540-54029-6}, keywords = {dblp}, pages = {66-77}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T13:22:30.000+0200}, title = {Approximation Algorithms for the Bandwidth Minimization Problem for a Large Class of Trees.}, url = {http://dblp.uni-trier.de/db/conf/icci/icci1991.html#HaralambidesM91}, volume = 497, year = 1991 }