Computing Tree-depth Faster Than 2<sup>n</sup>. Fomin, F. V., Giannopoulou, A. C., & Pilipczuk, M. CoRR, 2013. ![Computing Tree-depth Faster Than 2<sup>n</sup> [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper bibtex @article{ dblp2224458,
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 = {2013},
key = {dblp2224458},
id = {dblp2224458},
biburl = {http://www.dblp.org/rec/bibtex/journals/corr/FominGP13},
url = {http://arxiv.org/abs/1306.3857},
journal = {CoRR},
volume = {abs/1306.3857},
text = {CoRR abs/1306.3857 (2013)}
}
Downloads: 0
{"_id":"sp8oJHghkj58asMit","bibbaseid":"fomin-giannopoulou-pilipczuk-computingtreedepthfasterthan2supnsup-2013","downloads":0,"creationDate":"2015-06-23T17:42:39.376Z","title":"Computing Tree-depth Faster Than 2<sup>n</sup>","author_short":["Fomin, F. V.","Giannopoulou, A. C.","Pilipczuk, M."],"year":2013,"bibtype":"article","biburl":"http://www.dblp.org/rec/bibtex/journals/corr/FominGP13","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":"2013","key":"dblp2224458","id":"dblp2224458","biburl":"http://www.dblp.org/rec/bibtex/journals/corr/FominGP13","url":"http://arxiv.org/abs/1306.3857","journal":"CoRR","volume":"abs/1306.3857","text":"CoRR abs/1306.3857 (2013)","bibtex":"@article{ dblp2224458,\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 = {2013},\n key = {dblp2224458},\n id = {dblp2224458},\n biburl = {http://www.dblp.org/rec/bibtex/journals/corr/FominGP13},\n url = {http://arxiv.org/abs/1306.3857},\n journal = {CoRR},\n volume = {abs/1306.3857},\n text = {CoRR abs/1306.3857 (2013)}\n}","bibbaseid":"fomin-giannopoulou-pilipczuk-computingtreedepthfasterthan2supnsup-2013","role":"author","urls":{"Paper":"http://arxiv.org/abs/1306.3857"},"downloads":0},"search_terms":["computing","tree","depth","faster","sup","sup","fomin","giannopoulou","pilipczuk"],"keywords":[],"authorIDs":["55899a8faca630573e0006e6"],"dataSources":["nSeAYmsFKzFKaSXhz"]}