Publisher
Springer International Publishing
Reference26 articles.
1. Alon, N., Erdös, P.: Disjoint edges in geometric graphs. Disc. Comput. Geom. 4, 287–290 (1989).
https://doi.org/10.1007/BF02187731
2. Batini, C., Furlani, L., Nardelli, E.: What is a good diagram? A pragmatic approach. In: Proceedings of 4th International Conference on Entity-Relationship Approach (ER 1985), pp. 312–319 (1985).
http://dl.acm.org/citation.cfm?id=647510.726382
3. Batini, C., Nardelli, E., Tamassia, R.: A layout algorithm for data flow diagrams. IEEE Trans. Softw. Eng. 12(4), 538–546 (1986).
https://doi.org/10.1109/TSE.1986.6312901
4. Bekos, M.A., Kaufmann, M., Montecchiani, F.: Guest editors’ foreword and overview - special issue on graph drawing beyond planarity. J. Graph Algorithms Appl. 22(1), 1–10 (2018).
https://doi.org/10.7155/jgaa.00459
5. Bienstock, D.: Some provably hard crossing number problems. Disc. Comput. Geom. 6, 443–459 (1991).
https://doi.org/10.1007/BF02574701
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Testing gap k-planarity is NP-complete;Information Processing Letters;2021-08