Author:
Brandenburg Franz,Eppstein David,Goodrich Michael T.,Kobourov Stephen,Liotta Giuseppe,Mutzel Petra
Publisher
Springer Berlin Heidelberg
Reference136 articles.
1. Lecture Notes in Computer Science;J. Abello,1995
2. Aichholzer, O., Aurenhammer, F., Chen, S.-W., Katoh, N., Taschwer, M., Rote, G., Xu, Y.-F.: Triangulations intersect nicely. Discrete Comput. Geom. 16, 339–359 (1996)
3. Aichholzer, O., Aurenhammer, F., Krasser, H.: On the crossing number of complete graphs. In: Proceedings of the 18th ACM Symposium on Computational Geometry, pp. 19–24. ACM Press, New York (2002)
4. Aronov, B., Erdős, P., Goddard, W., Kleitman, D.J., Klugerman, M., Pach, J., Schulman, L.J.: Crossing families. Combinatorica 14, 127–134 (1994)
5. Lecture Notes in Computer Science;W. Barth,2002
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献