Publisher
Springer International Publishing
Reference30 articles.
1. Bannister, M.J., Cabello, S., Eppstein, D.: Parameterized complexity of 1-planarity. J. Graph Algorithms Appl. 22(1), 23–49 (2018).
https://doi.org/10.7155/jgaa.00457
2. Bannister, M.J., Eppstein, D.: Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth. J. Graph Algorithms Appl. 22(4), 577–606 (2018).
https://doi.org/10.7155/jgaa.00479
3. Bekos, M.A., Gronemann, M., Raftopoulou, C.N.: Two-page book embeddings of 4-planar graphs. Algorithmica 75(1), 158–185 (2016).
https://doi.org/10.1007/s00453-015-0016-8
4. Bernhart, F., Kainen, P.C.: The book thickness of a graph. J. Comb. Theory Ser. B 27(3), 320–331 (1979).
https://doi.org/10.1016/0095-8956(79)90021-2
5. Bhore, S., Ganian, R., Montecchiani, F., Nöllenburg, M.: Parameterized algorithms for book embedding problems. CoRR abs/1908.08911 (2019).
http://arxiv.org/abs/1908.08911
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献