Author:
Bannister Michael J.,Eppstein David
Publisher
Springer International Publishing
Reference26 articles.
1. Arnborg, S., Corneil, D., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Alg. Disc. Meth. 8(2), 277–284 (1987), doi:10.1137/0608024
2. Auslander, L., Parter, S.V.: On imbedding graphs in the sphere. Journal of Mathematics and Mechanics 10(3), 517–523 (1961)
3. Lecture Notes in Computer Science;M.J. Bannister,2013
4. Bernhart, F., Kainen, P.C.: The book thickness of a graph. Journal of Combinatorial Theory, Series B 27(3), 320–331 (1979), doi:10.1016/0095-8956(79)90021-2
5. Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. In: Proceedings of the Twenty-fifth Annual ACM Symposium on Theory of Computing, STOC 1993, pp. 226–234. ACM (1993), doi:10.1145/167088.167161
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献