Computing Tree-Depth Faster Than 2 n. Fomin, F. V., Giannopoulou, A. C., & Pilipczuk, M. In Proceedings of International Symposium on Parameterized and Exact Computation (IPEC), pages 137-149, 2013. Paper bibtex @inproceedings{ dblp2332138,
title = {Computing Tree-Depth Faster Than 2 n},
author = {Fedor V. Fomin and Archontia C. Giannopoulou and Michal Pilipczuk},
author_short = {Fomin, F. V. and Giannopoulou, A. C. and Pilipczuk, M.},
bibtype = {inproceedings},
type = {inproceedings},
year = {2013},
key = {dblp2332138},
id = {dblp2332138},
biburl = {http://www.dblp.org/rec/bibtex/conf/iwpec/FominGP13},
url = {http://dx.doi.org/10.1007/978-3-319-03898-8_13},
conference = {IPEC},
pages = {137-149},
text = {IPEC 2013:137-149},
booktitle = {Proceedings of International Symposium on Parameterized and Exact Computation (IPEC)}
}
Downloads: 0
{"_id":"cpgvmsGAEX6AsDaeF","bibbaseid":"fomin-giannopoulou-pilipczuk-computingtreedepthfasterthan2n-2013","downloads":0,"creationDate":"2015-06-23T17:42:39.426Z","title":"Computing Tree-Depth Faster Than 2 n","author_short":["Fomin, F. V.","Giannopoulou, A. C.","Pilipczuk, M."],"year":2013,"bibtype":"inproceedings","biburl":"http://www.dblp.org/rec/bibtex/conf/iwpec/FominGP13","bibdata":{"title":"Computing Tree-Depth Faster Than 2 n","author":["Fedor V. Fomin","Archontia C. Giannopoulou","Michal Pilipczuk"],"author_short":["Fomin, F. V.","Giannopoulou, A. C.","Pilipczuk, M."],"bibtype":"inproceedings","type":"inproceedings","year":"2013","key":"dblp2332138","id":"dblp2332138","biburl":"http://www.dblp.org/rec/bibtex/conf/iwpec/FominGP13","url":"http://dx.doi.org/10.1007/978-3-319-03898-8_13","conference":"IPEC","pages":"137-149","text":"IPEC 2013:137-149","booktitle":"Proceedings of International Symposium on Parameterized and Exact Computation (IPEC)","bibtex":"@inproceedings{ dblp2332138,\n title = {Computing Tree-Depth Faster Than 2 n},\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 = {inproceedings},\n type = {inproceedings},\n year = {2013},\n key = {dblp2332138},\n id = {dblp2332138},\n biburl = {http://www.dblp.org/rec/bibtex/conf/iwpec/FominGP13},\n url = {http://dx.doi.org/10.1007/978-3-319-03898-8_13},\n conference = {IPEC},\n pages = {137-149},\n text = {IPEC 2013:137-149},\n booktitle = {Proceedings of International Symposium on Parameterized and Exact Computation (IPEC)}\n}","bibbaseid":"fomin-giannopoulou-pilipczuk-computingtreedepthfasterthan2n-2013","role":"author","urls":{"Paper":"http://dx.doi.org/10.1007/978-3-319-03898-8_13"},"downloads":0},"search_terms":["computing","tree","depth","faster","fomin","giannopoulou","pilipczuk"],"keywords":[],"authorIDs":["55899a8faca630573e0006e6"],"dataSources":["FvxcgP6pjFyqF37C3"]}