Funder
Grantová Agentura České Republiky
European Research Council
Grantová Agentura, Univerzita Karlova
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference18 articles.
1. Alpert, H., Koch, C., Laison, J.D.: Obstacle numbers of graphs. Discrete Comput. Geom. 44(1), 223–244 (2010)
2. Arkin, E.M., Halperin, D., Kedem, K., Mitchell, J.S.B., Naor, N.: Arrangements of segments that share endpoints: single face results. Discrete Comput. Geom. 13(3–4), 257–270 (1995)
3. Aronov, B., Edelsbrunner, H., Guibas, L.J., Sharir, M.: The number of edges of many faces in a line segment arrangement. Combinatorica 12(3), 261–274 (1992)
4. Lecture Notes in Computer Science;M Balko,2015
5. Berman, L.W., Chappell, G.G., Faudree, J.R., Gimbel, J., Hartman, C., Williams, G.I.: Graphs with obstacle number greater than one. arXiv:1606.03782 (2016)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献