Publisher
Springer International Publishing
Reference26 articles.
1. Bienstock, D.: Some provably hard crossing number problems. Discrete Comput. Geom. 6, 443–459 (1991)
2. Bose, P., Everett, H., Wismath, S.K.: Properties of arrangement graphs. Int. J. Comput. Geom. Appl. 13(6), 447–462 (2003)
3. Canny, J.F.: Some algebraic and geometric computations in PSPACE. In: Proc. 20th Annu. ACM Symp. Theory Comput. (STOC 1988), pp. 460–467 (1988)
4. Cardinal, J.: Computational geometry column 62. SIGACT News 46(4), 69–78 (2015)
5. Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., Wolff, A.: The complexity of drawing graphs on few lines and few planes (2016). arxiv.org/1607.06444
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献