Author:
Biedl Therese,Derka Martin,Dujmović Vida,Morin Pat
Publisher
Springer International Publishing
Reference17 articles.
1. Lecture Notes in Computer Science;MJ Alam,2015
2. Alon, N., Seymour, P., Thomas, R.: A separator theorem for graphs with an excluded minor and its applications. In: Proceedings of the Twenty-second Annual ACM Symposium on Theory of Computing, STOC 1990, pp. 293–299. ACM, New York (1990)
3. Asinowski, A., Suk, A.: Edge intersection graphs of systems of paths on a grid with a bounded number of bends. Discrete Appl. Math. 157(14), 3174–3180 (2009)
4. Biedl, T., Stern, M.: Edge-intersection graphs of $$k$$-bend paths in grids. Discrete Math. Theor. Comput. Sci. 12(1), 1–12 (2010). (electronic journal)
5. Bodlaender, H.: A partial k-arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209(1–2), 1–45 (1998)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献