Author:
Kobayashi Yasuaki,Maruta Hirokazu,Nakae Yusuke,Tamaki Hisao
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing 25(6), 1305–1317 (1996)
2. Bodlaender, H.L., Kloks, T.: Efficient and constructive algorithms for the pathwidth and treewidth of graphs. Journal of Algorithms 21(2), 358–402 (1996)
3. Chimani, M., Hungerländer, P., Jünger, M., Mutzel, P.: An SDP approach to multi-level crossing minimization. Journal of Experimental Algorithmics 3(3), 1–16 (2012)
4. Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer (1999)
5. Dujmović, V., Fellows, M.R., Hallet, M., Kitching, M., Liotta, G., McCartin, C., Nishimura, N., Ragde, P., Rosamond, F., Whitesides, S., Wood, D.R.: A fixed parameter approach to two-layer planarization. Algorithmica 45(2), 159–182 (2006)