Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference40 articles.
1. Ábrego, B.M., Fernández-Merchant, S.: A lower bound for the rectilinear crossing number. Graphs Comb. 21(3), 293–300 (2005)
2. Afshani, P., Sheehy, D.R., Stein, Y.: Approximating the simplicial depth (2015).
arXiv:1512.04856
3. Aichholzer, O., Hackl, T., Huemer, C., Hurtado, F., Krasser, H., Vogtenhuber, B.: On the number of plane geometric graphs. Graphs Combin. 23(Supplement–1), 67–84 (2007)
4. Aigner, M.: Motzkin numbers. Eur. J. Combin. 19(6), 663–675 (1998)
5. Arkin, E.M., Khuller, S., Mitchell, J.S.B.: Geometric knapsack problems. Algorithmica 10(5), 399–427 (1993)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Inscribable Order Types;Discrete & Computational Geometry;2023-10-18