References analysis of the Wikipedia article "Dominating set" in the English version

arxiv.org (Global: 49^th place; English: 31^st place)

Alber, Fellows & Niedermeier (2004). Alber, Jochen; Fellows, Michael R; Niedermeier, Rolf (2004), "Polynomial-time data reduction for dominating set", Journal of the ACM, 51 (3): 363–384, arXiv:cs/0207066, doi:10.1145/990308.990309, S2CID 488501.

Brandstädt, Leitert & Rautenbach (2012). Brandstädt, Andreas; Leitert, Arne; Rautenbach, Dieter (2012). "Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs". Algorithms and Computation. Lecture Notes in Computer Science. Vol. 7676. Berlin, Heidelberg: Springer. pp. 267–277. arXiv:1207.0953. doi:10.1007/978-3-642-35261-4_30. ISBN 978-3-642-35261-4.

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

Hedetniemi & Laskar (1990). Hedetniemi, S. T.; Laskar, R. C. (1990), "Bibliography on domination in graphs and some basic definitions of domination parameters", Discrete Mathematics, 86 (1–3): 257–277, doi:10.1016/0012-365X(90)90365-O.

Escoffier & Paschos (2006). Escoffier, Bruno; Paschos, Vangelis Th. (2006), "Completeness in approximation classes beyond APX" (PDF), Theoretical Computer Science, 359 (1–3): 369–377, doi:10.1016/j.tcs.2006.05.023

Raz & Safra (1997). Raz, R.; Safra, S. (1997), "A sub-constant error-probability low-degree test, and sub-constant error-probability PCP characterization of NP", Proc. 29th Annual ACM Symposium on Theory of Computing, ACM, pp. 475–484, doi:10.1145/258533.258641, ISBN 0-89791-888-6, S2CID 15457604.

Parekh (1991). Parekh, Abhay K. (1991), "Analysis of a greedy heuristic for finding small dominating sets in graphs", Information Processing Letters, 39 (5): 237–240, doi:10.1016/0020-0190(91)90021-9, hdl:1721.1/1201

Papadimitriou & Yannakakis (1991). Papadimitriou, Christos H.; Yannakakis, Mihailis (1991), "Optimization, Approximation, and Complexity Classes", Journal of Computer and System Sciences, 43 (3): 425–440, doi:10.1016/0022-0000(91)90023-X

Takamizawa, Nishizeki & Saito (1982). Takamizawa, K.; Nishizeki, T.; Saito, N. (1982), "Linear-time computability of combinatorial problems on series–parallel graphs", Journal of the ACM, 29 (3): 623–641, doi:10.1145/322326.322328, S2CID 16082154.

Fomin et al. (2008). Fomin, Fedor V.; Grandoni, Fabrizio; Pyatkin, Artem; Stepanov, Alexey (2008), "Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications", ACM Transactions on Algorithms, 5 (1): 9:1–17, doi:10.1145/1435375.1435384, S2CID 2489447.

Fomin & Thilikos (2006). Fomin, Fedor V.; Thilikos, Dimitrios M. (2006), "Dominating sets in planar graphs: branch-width and exponential speed-up", SIAM Journal on Computing, 36 (2): 281, doi:10.1137/S0097539702419649, hdl:2117/97398, S2CID 5232238.

Telle & Villanger (2012). Telle, Jan Arne; Villanger, Yngve (2012), "FPT algorithms for domination in biclique-free graphs", in Epstein, Leah; Ferragina, Paolo (eds.), Algorithms – ESA 2012: 20th Annual European Symposium, Ljubljana, Slovenia, September 10–12, 2012, Proceedings, Lecture Notes in Computer Science, vol. 7501, Springer, pp. 802–812, doi:10.1007/978-3-642-33090-2_69, ISBN 978-3-642-33089-6.

Dehne et al. (2006). Dehne, Frank; Fellows, Michael; Fernau, Henning; Prieto, Elena; Rosamond, Frances (2006), "Nonblocker: Parameterized algorithmics for minimum dominating set" (PDF), SOFSEM 2006: 32nd Conference on Current Trends in Theory and Practice of Computer Science, Merin, Czech Republic, January 21-27, 2006, Proceedings, Lecture Notes in Computer Science, vol. 3831, Springer, pp. 237–245, doi:10.1007/11611257_21, ISBN 978-3-540-31198-0.

Allan & Laskar (1978). Allan, Robert B.; Laskar, Renu (1978), "On domination and independent domination numbers of a graph", Discrete Mathematics, 23 (2): 73–76, doi:10.1016/0012-365X(78)90105-X.

Klasing & Laforest (2004). Klasing, Ralf; Laforest, Christian (2004), "Hardness results and approximation algorithms of k-tuple domination in graphs", Information Processing Letters, 89 (2): 75–83, doi:10.1016/j.ipl.2003.10.004.

Förster (2013). Förster, Klaus-Tycho. (2013), "Approximating Fault-Tolerant Domination in General Graphs", Proc. of the Tenth Workshop on Analytic Algorithmics and Combinatorics ANALCO, SIAM, pp. 25–32, doi:10.1137/1.9781611973037.4, ISBN 978-1-61197-254-2.

Meshulam (2003). Meshulam, Roy (2003-05-01). "Domination numbers and homology". Journal of Combinatorial Theory, Series A. 102 (2): 321–330. doi:10.1016/S0097-3165(03)00045-1. ISSN 0097-3165.

Cockayne et al. (2004). Cockayne, E. J.; Dreyer, P. A.; Hedetniemi, S. M.; Hedetniemi, S. T. (2004). "Roman domination in graphs". Discrete Mathematics. 278 (1–3): 11–22. doi:10.1016/j.disc.2003.06.004.

Dettlaff et al. (2020). Dettlaff, Magda; Lemańska, Magdalena; Topp, Jerzy; Ziemann, Radosław; Żyliński, Paweł (2020). "Certified domination". AKCE International Journal of Graphs and Combinatorics. 17 (1): 86–97. doi:10.1016/j.akcej.2018.09.004. ISSN 0972-8600.

Domke et al. (1999). Domke, Gayla S.; Hattingh, Johannes H.; Hedetniemi, Stephen T.; Laskar, Renu C.; Markus, Lisa R. (1999). "Restrained domination in graphs". Discrete Mathematics. 203 (1–3): 61–69. doi:10.1016/S0012-365X(99)00016-3. ISSN 0012-365X.

Merouane & Chellali (2015). Merouane, Houcine Boumediene; Chellali, Mustapha (2015). "On Secure Domination in Graphs". Information Processing Letters. 115 (10): 786–790. doi:10.1016/j.ipl.2015.05.006. ISSN 0020-0190.

Haas & Wexler (2004). Haas, Ruth; Wexler, Thomas B. (2004). "Signed domination numbers of a graph and its complement". Discrete Mathematics. 283 (1–3): 87–92. doi:10.1016/j.disc.2004.01.007. ISSN 0012-365X.

Kang & Shan (2020). Kang, L.; Shan, E. (2020). "Signed and Minus Dominating Functions in Graphs". In Haynes, T.W.; Hedetniemi, S.T.; Henning, M.A. (eds.). Topics in Domination in Graphs. Developments in Mathematics. Vol. 64. Cham: Springer. doi:10.1007/978-3-030-51117-3_9. ISBN 978-3-030-51117-3.

Cabahug Jr., Eballe & Fernandez (2025). Cabahug Jr., IS; Eballe, RG; Fernandez, RT (2025). "Friendly Domination in Graph". European Journal of Pure & Applied Mathematics. 18 (4): 1–15. doi:10.29020/nybg.ejpam.v18i4.6326.

hdl.handle.net (Global: 66^th place; English: 34^th place)

mrfellows.net (Global: low place; English: low place)

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

api.semanticscholar.org

worldcat.org (Global: 4^th place; English: 4^th place)

search.worldcat.org

Garey & Johnson (1979). Garey, Michael R.; Johnson, David S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in the Mathematical Sciences (1st ed.). New York: W. H. Freeman and Company. ISBN 9780716710455. MR 0519066. OCLC 247570676., p. 190, problem GT2.

Meshulam (2003). Meshulam, Roy (2003-05-01). "Domination numbers and homology". Journal of Combinatorial Theory, Series A. 102 (2): 321–330. doi:10.1016/S0097-3165(03)00045-1. ISSN 0097-3165.

Dominating set (English Wikipedia)

ams.org (Global: 434^th place; English: 249^th place)

mathscinet.ams.org

archives-ouvertes.fr (Global: 1,143^rd place; English: 973^rd place)

hal.archives-ouvertes.fr

arxiv.org (Global: 49^th place; English: 31^st place)

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

hdl.handle.net (Global: 66^th place; English: 34^th place)

kth.se (Global: low place; English: low place)

csc.kth.se

mrfellows.net (Global: low place; English: low place)

researchgate.net (Global: 96^th place; English: 89^th place)

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

api.semanticscholar.org

worldcat.org (Global: 4^th place; English: 4^th place)

search.worldcat.org

Dominating set (English Wikipedia)

ams.org (Global: 434th place; English: 249th place)

mathscinet.ams.org

archives-ouvertes.fr (Global: 1,143rd place; English: 973rd place)

hal.archives-ouvertes.fr

arxiv.org (Global: 49th place; English: 31st place)

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

hdl.handle.net (Global: 66th place; English: 34th place)

kth.se (Global: low place; English: low place)

csc.kth.se

mrfellows.net (Global: low place; English: low place)

researchgate.net (Global: 96th place; English: 89th place)

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

api.semanticscholar.org

worldcat.org (Global: 4th place; English: 4th place)

search.worldcat.org

ams.org (Global: 434^th place; English: 249^th place)

archives-ouvertes.fr (Global: 1,143^rd place; English: 973^rd place)

arxiv.org (Global: 49^th place; English: 31^st place)

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

hdl.handle.net (Global: 66^th place; English: 34^th place)

researchgate.net (Global: 96^th place; English: 89^th place)

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

worldcat.org (Global: 4^th place; English: 4^th place)