Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Aspvall, B., Heggernes, P.: Finding Minimum Height Elimination Trees for Interval Graphs in Polynomial Time. BIT 34, 484–509 (1994)
2. Bodlaender, H.L.: A Tourist Quide through Treewidth. Acta Cybernetica 11, 1–23 (1993)
3. Lecture Notes in Computer Science;H.L. Bodlaender,2005
4. Bodlaender, H.L., Deogun, J.S., Jansen, K., Kloks, T., Kratsch, D., Müller, H., Tuza, Z.: Rankings of Graphs. SIAM Journal on Discrete Mathematics 11, 168–181 (1998)
5. Lecture Notes in Computer Science;H.L. Bodlaender,2008
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The complexity of bicriteria tree-depth;Theoretical Computer Science;2023-02
2. The Complexity of Bicriteria Tree-Depth;Fundamentals of Computation Theory;2021