Art gallery problem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Art gallery problem" in English language version.

refsWebsite

Global rank English rank

8doi.org

2^nd place

3ams.org

451^st place

277^th place

2semanticscholar.org

11^th place

8^th place

2arxiv.org

69^th place

59^th place

1bbc.com

20^th place

30^th place

1ubc.ca

1,997^th place

1,295^th place

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

Aigner & Ziegler (2018). Aigner, Martin; Ziegler, Günter M. (2018), "Chapter 40: How to guard a museum", Proofs from THE BOOK (6th ed.), Berlin: Springer, pp. 281–283, doi:10.1007/978-3-662-57265-8, ISBN 978-3-662-57264-1, MR 3823190.
Abrahamsen, Adamaszek & Miltzow (2022). Abrahamsen, Mikkel; Adamaszek, Anna; Miltzow, Tillmann (2022), "The art gallery problem is $\exists {\mathbb {R}}$ -complete", Journal of the ACM, 69 (1): A4:1–A4:70, arXiv:1704.06969, doi:10.1145/3486220, MR 4402363, S2CID 245059672
O'Rourke & Supowit (1983); Lee & Lin (1986). O'Rourke, Joseph; Supowit, Kenneth J. (1983), "Some NP-hard polygon decomposition problems", IEEE Transactions on Information Theory, 29 (2): 181–190, doi:10.1109/TIT.1983.1056648, MR 0712374. Lee, D. T.; Lin, A. K. (1986), "Computational complexity of art gallery problems", IEEE Transactions on Information Theory, 32 (2): 276–282, doi:10.1109/TIT.1986.1057165.

arxiv.org (Global: 69^th place; English: 59^th place)

Abrahamsen, Adamaszek & Miltzow (2022). Abrahamsen, Mikkel; Adamaszek, Anna; Miltzow, Tillmann (2022), "The art gallery problem is $\exists {\mathbb {R}}$ -complete", Journal of the ACM, 69 (1): A4:1–A4:70, arXiv:1704.06969, doi:10.1145/3486220, MR 4402363, S2CID 245059672
Eryk Lipka, A note on minimal art galleries, 2019

bbc.com (Global: 20^th place; English: 30^th place)

"Louvre robbery: Could a 50-year-old maths problem have kept the museum safe?". www.bbc.com. Oct 30, 2025.

doi.org (Global: 2^nd place; English: 2^nd place)

Chvátal (1975). Chvátal, V. (1975), "A combinatorial theorem in plane geometry", Journal of Combinatorial Theory, Series B, 18: 39–41, doi:10.1016/0095-8956(75)90061-1.
Fisk (1978). Fisk, S. (1978), "A short proof of Chvátal's watchman theorem", Journal of Combinatorial Theory, Series B, 24 (3): 374, doi:10.1016/0095-8956(78)90059-X.
Aigner & Ziegler (2018). Aigner, Martin; Ziegler, Günter M. (2018), "Chapter 40: How to guard a museum", Proofs from THE BOOK (6th ed.), Berlin: Springer, pp. 281–283, doi:10.1007/978-3-662-57265-8, ISBN 978-3-662-57264-1, MR 3823190.
Shermer (1992); Urrutia (2000) Shermer, Thomas (1992), "Recent Results in Art Galleries" (PDF), Proceedings of the IEEE, 80 (9): 1384–1399, doi:10.1109/5.163407. Urrutia, Jorge (2000), "Art gallery and illumination problems", in Sack, J. -R.; Urrutia, Jorge (eds.), Handbook of Computational Geometry, North-Holland, pp. 973–1027, doi:10.1016/B978-044482537-7/50023-1, ISBN 978-0-444-82537-7.
Kahn, Klawe & Kleitman (1983); Lubiw (1985); Sack & Toussaint (1988). Kahn, J.; Klawe, M.; Kleitman, D. (1983), "Traditional galleries require fewer watchmen", SIAM J. Algebr. Discrete Methods, 4 (2): 194–206, doi:10.1137/0604020. Lubiw, A. (1985), "Decomposing polygonal regions into convex quadrilaterals", Proc. 1st ACM Symposium on Computational Geometry, pp. 97–106, doi:10.1145/323233.323247, ISBN 0-89791-163-6, S2CID 15752916. Sack, J. R.; Toussaint, G. T. (1988), "Guard placement in rectilinear polygons", in Toussaint, G. T. (ed.), Computational Morphology, North-Holland, pp. 153–176.
Abrahamsen, Adamaszek & Miltzow (2022). Abrahamsen, Mikkel; Adamaszek, Anna; Miltzow, Tillmann (2022), "The art gallery problem is $\exists {\mathbb {R}}$ -complete", Journal of the ACM, 69 (1): A4:1–A4:70, arXiv:1704.06969, doi:10.1145/3486220, MR 4402363, S2CID 245059672
O'Rourke & Supowit (1983); Lee & Lin (1986). O'Rourke, Joseph; Supowit, Kenneth J. (1983), "Some NP-hard polygon decomposition problems", IEEE Transactions on Information Theory, 29 (2): 181–190, doi:10.1109/TIT.1983.1056648, MR 0712374. Lee, D. T.; Lin, A. K. (1986), "Computational complexity of art gallery problems", IEEE Transactions on Information Theory, 32 (2): 276–282, doi:10.1109/TIT.1986.1057165.
Brönnimann & Goodrich (1995). Brönnimann, H.; Goodrich, M. T. (1995), "Almost optimal set covers in finite VC-dimension", Discrete and Computational Geometry, 14 (1): 463–479, doi:10.1007/BF02570718.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Kahn, Klawe & Kleitman (1983); Lubiw (1985); Sack & Toussaint (1988). Kahn, J.; Klawe, M.; Kleitman, D. (1983), "Traditional galleries require fewer watchmen", SIAM J. Algebr. Discrete Methods, 4 (2): 194–206, doi:10.1137/0604020. Lubiw, A. (1985), "Decomposing polygonal regions into convex quadrilaterals", Proc. 1st ACM Symposium on Computational Geometry, pp. 97–106, doi:10.1145/323233.323247, ISBN 0-89791-163-6, S2CID 15752916. Sack, J. R.; Toussaint, G. T. (1988), "Guard placement in rectilinear polygons", in Toussaint, G. T. (ed.), Computational Morphology, North-Holland, pp. 153–176.
Abrahamsen, Adamaszek & Miltzow (2022). Abrahamsen, Mikkel; Adamaszek, Anna; Miltzow, Tillmann (2022), "The art gallery problem is $\exists {\mathbb {R}}$ -complete", Journal of the ACM, 69 (1): A4:1–A4:70, arXiv:1704.06969, doi:10.1145/3486220, MR 4402363, S2CID 245059672

ubc.ca (Global: 1,997^th place; English: 1,295^th place)

cs.ubc.ca

Shermer (1992); Urrutia (2000) Shermer, Thomas (1992), "Recent Results in Art Galleries" (PDF), Proceedings of the IEEE, 80 (9): 1384–1399, doi:10.1109/5.163407. Urrutia, Jorge (2000), "Art gallery and illumination problems", in Sack, J. -R.; Urrutia, Jorge (eds.), Handbook of Computational Geometry, North-Holland, pp. 973–1027, doi:10.1016/B978-044482537-7/50023-1, ISBN 978-0-444-82537-7.

Art gallery problem (English Wikipedia)

ams.org (Global: 451st place; English: 277th place)

mathscinet.ams.org

arxiv.org (Global: 69th place; English: 59th place)

bbc.com (Global: 20th place; English: 30th place)

doi.org (Global: 2nd place; English: 2nd place)

semanticscholar.org (Global: 11th place; English: 8th place)