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.
Computing Tree-Depth Faster Than 2 n [link]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