%0 Journal Article %1 journals/tcs/DessmarkLP00 %A Dessmark, Anders %A Lingas, Andrzej %A Proskurowski, Andrzej %D 2000 %J Theor. Comput. Sci. %K dblp %N 1-2 %P 179-191 %T Maximum packing for k-connected partial k-trees in polynomial time. %U http://dblp.uni-trier.de/db/journals/tcs/tcs236.html#DessmarkLP00 %V 236

@article{journals/tcs/DessmarkLP00, added-at = {2021-02-17T00:00:00.000+0100}, author = {Dessmark, Anders and Lingas, Andrzej and Proskurowski, Andrzej}, biburl = {https://www.bibsonomy.org/bibtex/27866749c92dd2e9be7b6b977bb71110d/dblp}, ee = {https://doi.org/10.1016/S0304-3975(99)00208-X}, interhash = {b72cb9074a205dbf3b63038dbf275393}, intrahash = {7866749c92dd2e9be7b6b977bb71110d}, journal = {Theor. Comput. Sci.}, keywords = {dblp}, number = {1-2}, pages = {179-191}, timestamp = {2024-04-08T18:39:14.000+0200}, title = {Maximum packing for k-connected partial k-trees in polynomial time.}, url = {http://dblp.uni-trier.de/db/journals/tcs/tcs236.html#DessmarkLP00}, volume = 236, year = 2000 }