Computing Tree-Depth Faster Than 2<sup>n</sup>. Fomin, F. V., Giannopoulou, A. C., & Pilipczuk, M. Algorithmica, 73(1):202-216, 2015. ![Computing Tree-Depth Faster Than 2<sup>n</sup> [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper bibtex @article{ dblp1710564,
title = {Computing Tree-Depth Faster Than 2<sup>n</sup>},
author = {Fedor V. Fomin and Archontia C. Giannopoulou and Michal Pilipczuk},
author_short = {Fomin, F. V. and Giannopoulou, A. C. and Pilipczuk, M.},
bibtype = {article},
type = {article},
year = {2015},
key = {dblp1710564},
id = {dblp1710564},
biburl = {http://www.dblp.org/rec/bibtex/journals/algorithmica/FominGP15},
url = {http://dx.doi.org/10.1007/s00453-014-9914-4},
journal = {Algorithmica},
pages = {202-216},
number = {1},
volume = {73},
text = {Algorithmica 73(1):202-216 (2015)}
}
Downloads: 0
{"_id":"nm6pjarFMhEA5aiyi","bibbaseid":"fomin-giannopoulou-pilipczuk-computingtreedepthfasterthan2supnsup-2015","downloads":0,"creationDate":"2016-02-22T01:38:49.860Z","title":"Computing Tree-Depth Faster Than 2<sup>n</sup>","author_short":["Fomin, F. V.","Giannopoulou, A. C.","Pilipczuk, M."],"year":2015,"bibtype":"article","biburl":"http://www.dblp.org/rec/bibtex/journals/algorithmica/FominGP15","bibdata":{"title":"Computing Tree-Depth Faster Than 2<sup>n</sup>","author":["Fedor V. Fomin","Archontia C. Giannopoulou","Michal Pilipczuk"],"author_short":["Fomin, F. V.","Giannopoulou, A. C.","Pilipczuk, M."],"bibtype":"article","type":"article","year":"2015","key":"dblp1710564","id":"dblp1710564","biburl":"http://www.dblp.org/rec/bibtex/journals/algorithmica/FominGP15","url":"http://dx.doi.org/10.1007/s00453-014-9914-4","journal":"Algorithmica","pages":"202-216","number":"1","volume":"73","text":"Algorithmica 73(1):202-216 (2015)","bibtex":"@article{ dblp1710564,\n title = {Computing Tree-Depth Faster Than 2<sup>n</sup>},\n author = {Fedor V. Fomin and Archontia C. Giannopoulou and Michal Pilipczuk},\n author_short = {Fomin, F. V. and Giannopoulou, A. C. and Pilipczuk, M.},\n bibtype = {article},\n type = {article},\n year = {2015},\n key = {dblp1710564},\n id = {dblp1710564},\n biburl = {http://www.dblp.org/rec/bibtex/journals/algorithmica/FominGP15},\n url = {http://dx.doi.org/10.1007/s00453-014-9914-4},\n journal = {Algorithmica},\n pages = {202-216},\n number = {1},\n volume = {73},\n text = {Algorithmica 73(1):202-216 (2015)}\n}","bibbaseid":"fomin-giannopoulou-pilipczuk-computingtreedepthfasterthan2supnsup-2015","role":"author","urls":{"Paper":"http://dx.doi.org/10.1007/s00453-014-9914-4"},"downloads":0},"search_terms":["computing","tree","depth","faster","sup","sup","fomin","giannopoulou","pilipczuk"],"keywords":[],"authorIDs":["55899a8faca630573e0006e6"],"dataSources":["LN7DmERBbPDWEaEP5"]}