%0 Conference Paper %1 conf/mfcs/Lokshtanov07 %A Lokshtanov, Daniel %B MFCS %D 2007 %E Kucera, Ludek %E Kucera, Antonín %I Springer %K dblp %P 276-287 %T On the Complexity of Computing Treelength. %U http://dblp.uni-trier.de/db/conf/mfcs/mfcs2007.html#Lokshtanov07 %V 4708 %@ 978-3-540-74455-9

@inproceedings{conf/mfcs/Lokshtanov07, added-at = {2017-05-25T00:00:00.000+0200}, author = {Lokshtanov, Daniel}, biburl = {https://www.bibsonomy.org/bibtex/2bad24a7720b7d96affe5ee65409ab370/dblp}, booktitle = {MFCS}, crossref = {conf/mfcs/2007}, editor = {Kucera, Ludek and Kucera, Antonín}, ee = {https://doi.org/10.1007/978-3-540-74456-6_26}, interhash = {54d00df7a7d73859f13db22c8514b98e}, intrahash = {bad24a7720b7d96affe5ee65409ab370}, isbn = {978-3-540-74455-9}, keywords = {dblp}, pages = {276-287}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-08-31T11:41:19.000+0200}, title = {On the Complexity of Computing Treelength.}, url = {http://dblp.uni-trier.de/db/conf/mfcs/mfcs2007.html#Lokshtanov07}, volume = 4708, year = 2007 }