Funder
TCS Research Scholar Program
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference30 articles.
1. The art gallery theorem: its variations, applications and algorithmic aspects;Aggarwal,1984
2. V.S. Anil Kumar, Sunil Arya, H. Ramesh, Hardness of set cover with intersection 1, in: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings, 2000, pp. 624–635.
3. Approximation algorithms for NP-hard problems;Arora,1996
4. An optimal algorithm for determining the visibility of a polygon from an edge;Avis;IEEE Trans. Comput.,1981
5. Vertex guarding in weak visibility polygons;Bhattacharya,2015
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献