Author:
Klawitter Jonathan,Mchedlidze Tamara,Nöllenburg Martin
Publisher
Springer International Publishing
Reference41 articles.
1. Alam, M.J., Brandenburg, F.J., Kobourov, S.G.: On the book thickness of 1-planar graphs. CoRR, abs/1510.05891, October 2015. http://arxiv.org/abs/1510.05891
2. Lecture Notes in Computer Science;MJ Bannister,2014
3. Bansal, R., Srivastava, K., Varshney, K., Sharma, N., et al.: An evolutionary algorithm for the 2-page crossing number problem. In: Evolutionary Computation (CEC 2008), pp. 1095–1102. IEEE, June 2008. https://doi.org/10.1109/CEC.2008.4630933
4. Lecture Notes in Computer Science;M Baur,2004
5. Bernhart, F., Kainen, P.C.: The book thickness of a graph. J. Comb. Theor. Ser. B 27(3), 320–331 (1979). http://dx.doi.org/10.1016/0095-8956(79)90021-2
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献