Independent set (graph theory) (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Independent set (graph theory)" in English language version.

refsWebsite

Global rank English rank

23doi.org

2^nd place

15semanticscholar.org

11^th place

8^th place

7arxiv.org

69^th place

59^th place

6worldcat.org

5^th place

4ams.org

451^st place

277^th place

2psu.edu

207^th place

136^th place

2ieee.org

652^nd place

515^th place

2sciencedirect.com

149^th place

178^th place

2siam.org

low place

6,473^rd place

1harvard.edu

18^th place

17^th place

1books.google.com

3^rd place

1dauphine.fr

low place

1port.ac.uk

low place

7,554^th place

1handle.net

102^nd place

76^th place

1nature.com

234^th place

397^th place

1nih.gov

4^th place

ams.org

mathscinet.ams.org

Moon & Moser (1965). Moon, J.W.; Moser, Leo (1965), "On cliques in graphs", Israel Journal of Mathematics, 3 (1): 23–28, doi:10.1007/BF02760024, MR 0182577, S2CID 9855414.
Minty (1980),Sbihi (1980),Nakamura & Tamura (2001),Faenza, Oriolo & Stauffer (2014),Nobili & Sassano (2015) Minty, G.J. (1980), "On maximal independent sets of vertices in claw-free graphs", Journal of Combinatorial Theory, Series B, 28 (3): 284–304, doi:10.1016/0095-8956(80)90074-x. Sbihi, Najiba (1980), "Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoile", Discrete Mathematics (in French), 29 (1): 53–76, doi:10.1016/0012-365X(90)90287-R, MR 0553650. Nakamura, D.; Tamura, A. (2001), "A revision of Minty's algorithm for finding a maximum weight stable set in a claw-free graph", Journal of Operations Research Society Japan, 44 (2): 194–204, doi:10.15807/jorsj.44.194. Faenza, Yuri; Oriolo, Gianpaolo; Stauffer, Gautier (2014), "Solving the Weighted Stable Set Problem in Claw-Free Graphs", Journal of the ACM, 61 (4): 1–41, doi:10.1145/2629600, S2CID 1995056. Nobili, P.; Sassano, A. (2015), An O(n^2 log n) algorithm for the weighted stable set problem in claw-free graphs, arXiv:1501.05775, Bibcode:2015arXiv150105775N
Grötschel, Lovász & Schrijver (1993, Chapter 9: Stable Sets in Graphs) Grötschel, Martin; Lovász, László; Schrijver, Alexander (1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag, Berlin, doi:10.1007/978-3-642-78240-4, ISBN 978-3-642-78242-8, MR 1261419.
Luby (1986). Luby, Michael (1986), "A simple parallel algorithm for the maximal independent set problem", SIAM Journal on Computing, 15 (4): 1036–1053, CiteSeerX 10.1.1.225.5475, doi:10.1137/0215074, MR 0861369.

arxiv.org

Xiao & Nagamochi (2017) Xiao, Mingyu; Nagamochi, Hiroshi (2017), "Exact algorithms for maximum independent set", Information and Computation, 255: 126–146, arXiv:1312.6260, doi:10.1016/j.ic.2017.06.001, S2CID 1714739.
Minty (1980),Sbihi (1980),Nakamura & Tamura (2001),Faenza, Oriolo & Stauffer (2014),Nobili & Sassano (2015) Minty, G.J. (1980), "On maximal independent sets of vertices in claw-free graphs", Journal of Combinatorial Theory, Series B, 28 (3): 284–304, doi:10.1016/0095-8956(80)90074-x. Sbihi, Najiba (1980), "Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoile", Discrete Mathematics (in French), 29 (1): 53–76, doi:10.1016/0012-365X(90)90287-R, MR 0553650. Nakamura, D.; Tamura, A. (2001), "A revision of Minty's algorithm for finding a maximum weight stable set in a claw-free graph", Journal of Operations Research Society Japan, 44 (2): 194–204, doi:10.15807/jorsj.44.194. Faenza, Yuri; Oriolo, Gianpaolo; Stauffer, Gautier (2014), "Solving the Weighted Stable Set Problem in Claw-Free Graphs", Journal of the ACM, 61 (4): 1–41, doi:10.1145/2629600, S2CID 1995056. Nobili, P.; Sassano, A. (2015), An O(n^2 log n) algorithm for the weighted stable set problem in claw-free graphs, arXiv:1501.05775, Bibcode:2015arXiv150105775N
Baker (1994); Grohe (2003). Baker, Brenda S. (1994), "Approximation algorithms for NP-complete problems on planar graphs", Journal of the ACM, 41 (1): 153–180, doi:10.1145/174644.174650, S2CID 9706753. Grohe, Martin (2003), "Local tree-width, excluded minors, and approximation algorithms", Combinatorica, 23 (4): 613–632, arXiv:math/0001128, doi:10.1007/s00493-003-0037-9, S2CID 11751235.
Neuwohner, Meike (2021-06-07), An Improved Approximation Algorithm for the Maximum Weight Independent Set Problem in d-Claw Free Graphs, arXiv:2106.03545
Cygan, Marek (October 2013). "Improved Approximation for 3-Dimensional Matching via Bounded Pathwidth Local Search". 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. pp. 509–518. arXiv:1304.1424. doi:10.1109/FOCS.2013.61. ISBN 978-0-7695-5135-7. S2CID 14160646.
Bezáková, Ivona; Galanis, Andreas; Goldberg, Leslie Ann; Guo, Heng; Štefankovič, Daniel (2019). "Approximation via Correlation Decay When Strong Spatial Mixing Fails". SIAM Journal on Computing. 48 (2): 279–349. arXiv:1510.09193. doi:10.1137/16M1083906. ISSN 0097-5397. S2CID 131975798.
Cannon, Sarah; Perkins, Will (2020). Chawla, Shuchi (ed.). Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics. arXiv:1906.01666. doi:10.1137/1.9781611975994.88. ISBN 978-1-61197-599-4. S2CID 174799567.

books.google.com

Grötschel, Lovász & Schrijver (1993, Chapter 9: Stable Sets in Graphs) Grötschel, Martin; Lovász, László; Schrijver, Alexander (1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag, Berlin, doi:10.1007/978-3-642-78240-4, ISBN 978-3-642-78242-8, MR 1261419.

dauphine.fr

basepub.dauphine.fr

Bazgan, Cristina; Escoffier, Bruno; Paschos, Vangelis Th. (2005). "Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness". Theoretical Computer Science. 339 (2–3): 272–292. doi:10.1016/j.tcs.2005.03.007. S2CID 1418848.

doi.org

Korshunov (1974) Korshunov, A.D. (1974), "Coefficient of Internal Stability", Kibernetika (in Ukrainian), 10 (1): 17–28, doi:10.1007/BF01069014, S2CID 120343511.
Garey, M. R.; Johnson, D. S. (1978-07-01). ""Strong" NP-Completeness Results: Motivation, Examples, and Implications". Journal of the ACM. 25 (3): 499–508. doi:10.1145/322077.322090. ISSN 0004-5411. S2CID 18371269.
Moon & Moser (1965). Moon, J.W.; Moser, Leo (1965), "On cliques in graphs", Israel Journal of Mathematics, 3 (1): 23–28, doi:10.1007/BF02760024, MR 0182577, S2CID 9855414.
Füredi (1987). Füredi, Zoltán (1987), "The number of maximal independent sets in connected graphs", Journal of Graph Theory, 11 (4): 463–470, doi:10.1002/jgt.3190110403.
Chiba & Nishizeki (1985). Chiba, N.; Nishizeki, T. (1985), "Arboricity and subgraph listing algorithms", SIAM Journal on Computing, 14 (1): 210–223, doi:10.1137/0214017, S2CID 207051803.
Berman & Fujito (1995). Berman, Piotr; Fujito, Toshihiro (1995), "On approximation properties of the Independent set problem for degree 3 graphs", Algorithms and Data Structures, Lecture Notes in Computer Science, vol. 955, Springer-Verlag, pp. 449–460, doi:10.1007/3-540-60220-8_84, ISBN 978-3-540-60220-0.
Xiao & Nagamochi (2017) Xiao, Mingyu; Nagamochi, Hiroshi (2017), "Exact algorithms for maximum independent set", Information and Computation, 255: 126–146, arXiv:1312.6260, doi:10.1016/j.ic.2017.06.001, S2CID 1714739.
Xiao & Nagamochi (2013) Xiao, Mingyu; Nagamochi, Hiroshi (2013), "Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs", Theoretical Computer Science, 469: 92–104, doi:10.1016/j.tcs.2012.09.022.
Minty (1980),Sbihi (1980),Nakamura & Tamura (2001),Faenza, Oriolo & Stauffer (2014),Nobili & Sassano (2015) Minty, G.J. (1980), "On maximal independent sets of vertices in claw-free graphs", Journal of Combinatorial Theory, Series B, 28 (3): 284–304, doi:10.1016/0095-8956(80)90074-x. Sbihi, Najiba (1980), "Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoile", Discrete Mathematics (in French), 29 (1): 53–76, doi:10.1016/0012-365X(90)90287-R, MR 0553650. Nakamura, D.; Tamura, A. (2001), "A revision of Minty's algorithm for finding a maximum weight stable set in a claw-free graph", Journal of Operations Research Society Japan, 44 (2): 194–204, doi:10.15807/jorsj.44.194. Faenza, Yuri; Oriolo, Gianpaolo; Stauffer, Gautier (2014), "Solving the Weighted Stable Set Problem in Claw-Free Graphs", Journal of the ACM, 61 (4): 1–41, doi:10.1145/2629600, S2CID 1995056. Nobili, P.; Sassano, A. (2015), An O(n^2 log n) algorithm for the weighted stable set problem in claw-free graphs, arXiv:1501.05775, Bibcode:2015arXiv150105775N
Grötschel, Lovász & Schrijver (1993, Chapter 9: Stable Sets in Graphs) Grötschel, Martin; Lovász, László; Schrijver, Alexander (1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag, Berlin, doi:10.1007/978-3-642-78240-4, ISBN 978-3-642-78242-8, MR 1261419.
Tarjan (1985) Tarjan, R.E. (1985), "Decomposition by clique separators", Discrete Mathematics, 55 (2): 221–232, doi:10.1016/0012-365x(85)90051-2.
Bazgan, Cristina; Escoffier, Bruno; Paschos, Vangelis Th. (2005). "Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness". Theoretical Computer Science. 339 (2–3): 272–292. doi:10.1016/j.tcs.2005.03.007. S2CID 1418848.
Baker (1994); Grohe (2003). Baker, Brenda S. (1994), "Approximation algorithms for NP-complete problems on planar graphs", Journal of the ACM, 41 (1): 153–180, doi:10.1145/174644.174650, S2CID 9706753. Grohe, Martin (2003), "Local tree-width, excluded minors, and approximation algorithms", Combinatorica, 23 (4): 613–632, arXiv:math/0001128, doi:10.1007/s00493-003-0037-9, S2CID 11751235.
Halldórsson & Radhakrishnan (1997). Halldórsson, M. M.; Radhakrishnan, J. (1997), "Greed is good: Approximating independent sets in sparse and bounded-degree graphs", Algorithmica, 18 (1): 145–163, CiteSeerX 10.1.1.145.4523, doi:10.1007/BF02523693, S2CID 4661668.
Chlebík, Miroslav; Chlebíková, Janka (2003). "Approximation Hardness for Small Occurrence Instances of NP-Hard Problems". Proceedings of the 5th International Conference on Algorithms and Complexity. Lecture Notes in Computer Science. Vol. 2653. pp. 152–164. doi:10.1007/3-540-44849-7_21. ISBN 978-3-540-40176-6.
Cygan, Marek (October 2013). "Improved Approximation for 3-Dimensional Matching via Bounded Pathwidth Local Search". 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. pp. 509–518. arXiv:1304.1424. doi:10.1109/FOCS.2013.61. ISBN 978-0-7695-5135-7. S2CID 14160646.
Luby (1986). Luby, Michael (1986), "A simple parallel algorithm for the maximal independent set problem", SIAM Journal on Computing, 15 (4): 1036–1053, CiteSeerX 10.1.1.225.5475, doi:10.1137/0215074, MR 0861369.
Dyer, Martin; Greenhill, Catherine (2000-04-01). "On Markov Chains for Independent Sets". Journal of Algorithms. 35 (1): 17–49. doi:10.1006/jagm.1999.1071. ISSN 0196-6774.
Sly, Allan (2010). "Computational Transition at the Uniqueness Threshold". 2010 IEEE 51st Annual Symposium on Foundations of Computer Science. pp. 287–296. doi:10.1109/FOCS.2010.34. ISBN 978-1-4244-8525-3. S2CID 901126.
Bezáková, Ivona; Galanis, Andreas; Goldberg, Leslie Ann; Guo, Heng; Štefankovič, Daniel (2019). "Approximation via Correlation Decay When Strong Spatial Mixing Fails". SIAM Journal on Computing. 48 (2): 279–349. arXiv:1510.09193. doi:10.1137/16M1083906. ISSN 0097-5397. S2CID 131975798.
Xia, Mingji; Zhang, Peng; Zhao, Wenbo (2007-09-24). "Computational complexity of counting problems on 3-regular planar graphs". Theoretical Computer Science. Theory and Applications of Models of Computation. 384 (1): 111–125. doi:10.1016/j.tcs.2007.05.023. ISSN 0304-3975., quoted in Curticapean, Radu; Dell, Holger; Fomin, Fedor; Goldberg, Leslie Ann; Lapinskas, John (2019-10-01). "A Fixed-Parameter Perspective on #BIS". Algorithmica. 81 (10): 3844–3864. doi:10.1007/s00453-019-00606-4. hdl:1983/ecb5c34c-d6be-44ec-97ea-080f57c5e6af. ISSN 1432-0541. S2CID 3626662.
Cannon, Sarah; Perkins, Will (2020). Chawla, Shuchi (ed.). Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics. arXiv:1906.01666. doi:10.1137/1.9781611975994.88. ISBN 978-1-61197-599-4. S2CID 174799567.
Hossain, Ayaan; Lopez, Eriberto; Halper, Sean M.; Cetnar, Daniel P.; Reis, Alexander C.; Strickland, Devin; Klavins, Eric; Salis, Howard M. (2020-07-13). "Automated design of thousands of nonrepetitive parts for engineering stable genetic systems". Nature Biotechnology. 38 (12): 1466–1475. doi:10.1038/s41587-020-0584-2. ISSN 1546-1696. PMID 32661437. S2CID 220506228.

handle.net

hdl.handle.net

Xia, Mingji; Zhang, Peng; Zhao, Wenbo (2007-09-24). "Computational complexity of counting problems on 3-regular planar graphs". Theoretical Computer Science. Theory and Applications of Models of Computation. 384 (1): 111–125. doi:10.1016/j.tcs.2007.05.023. ISSN 0304-3975., quoted in Curticapean, Radu; Dell, Holger; Fomin, Fedor; Goldberg, Leslie Ann; Lapinskas, John (2019-10-01). "A Fixed-Parameter Perspective on #BIS". Algorithmica. 81 (10): 3844–3864. doi:10.1007/s00453-019-00606-4. hdl:1983/ecb5c34c-d6be-44ec-97ea-080f57c5e6af. ISSN 1432-0541. S2CID 3626662.

harvard.edu

ui.adsabs.harvard.edu

Minty (1980),Sbihi (1980),Nakamura & Tamura (2001),Faenza, Oriolo & Stauffer (2014),Nobili & Sassano (2015) Minty, G.J. (1980), "On maximal independent sets of vertices in claw-free graphs", Journal of Combinatorial Theory, Series B, 28 (3): 284–304, doi:10.1016/0095-8956(80)90074-x. Sbihi, Najiba (1980), "Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoile", Discrete Mathematics (in French), 29 (1): 53–76, doi:10.1016/0012-365X(90)90287-R, MR 0553650. Nakamura, D.; Tamura, A. (2001), "A revision of Minty's algorithm for finding a maximum weight stable set in a claw-free graph", Journal of Operations Research Society Japan, 44 (2): 194–204, doi:10.15807/jorsj.44.194. Faenza, Yuri; Oriolo, Gianpaolo; Stauffer, Gautier (2014), "Solving the Weighted Stable Set Problem in Claw-Free Graphs", Journal of the ACM, 61 (4): 1–41, doi:10.1145/2629600, S2CID 1995056. Nobili, P.; Sassano, A. (2015), An O(n^2 log n) algorithm for the weighted stable set problem in claw-free graphs, arXiv:1501.05775, Bibcode:2015arXiv150105775N

ieee.org

ieeexplore.ieee.org

Cygan, Marek (October 2013). "Improved Approximation for 3-Dimensional Matching via Bounded Pathwidth Local Search". 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. pp. 509–518. arXiv:1304.1424. doi:10.1109/FOCS.2013.61. ISBN 978-0-7695-5135-7. S2CID 14160646.
Sly, Allan (2010). "Computational Transition at the Uniqueness Threshold". 2010 IEEE 51st Annual Symposium on Foundations of Computer Science. pp. 287–296. doi:10.1109/FOCS.2010.34. ISBN 978-1-4244-8525-3. S2CID 901126.

nature.com

Hossain, Ayaan; Lopez, Eriberto; Halper, Sean M.; Cetnar, Daniel P.; Reis, Alexander C.; Strickland, Devin; Klavins, Eric; Salis, Howard M. (2020-07-13). "Automated design of thousands of nonrepetitive parts for engineering stable genetic systems". Nature Biotechnology. 38 (12): 1466–1475. doi:10.1038/s41587-020-0584-2. ISSN 1546-1696. PMID 32661437. S2CID 220506228.

nih.gov

pubmed.ncbi.nlm.nih.gov

Hossain, Ayaan; Lopez, Eriberto; Halper, Sean M.; Cetnar, Daniel P.; Reis, Alexander C.; Strickland, Devin; Klavins, Eric; Salis, Howard M. (2020-07-13). "Automated design of thousands of nonrepetitive parts for engineering stable genetic systems". Nature Biotechnology. 38 (12): 1466–1475. doi:10.1038/s41587-020-0584-2. ISSN 1546-1696. PMID 32661437. S2CID 220506228.

port.ac.uk

researchportal.port.ac.uk

Chlebík, Miroslav; Chlebíková, Janka (2003). "Approximation Hardness for Small Occurrence Instances of NP-Hard Problems". Proceedings of the 5th International Conference on Algorithms and Complexity. Lecture Notes in Computer Science. Vol. 2653. pp. 152–164. doi:10.1007/3-540-44849-7_21. ISBN 978-3-540-40176-6.

psu.edu

citeseerx.ist.psu.edu

Halldórsson & Radhakrishnan (1997). Halldórsson, M. M.; Radhakrishnan, J. (1997), "Greed is good: Approximating independent sets in sparse and bounded-degree graphs", Algorithmica, 18 (1): 145–163, CiteSeerX 10.1.1.145.4523, doi:10.1007/BF02523693, S2CID 4661668.
Luby (1986). Luby, Michael (1986), "A simple parallel algorithm for the maximal independent set problem", SIAM Journal on Computing, 15 (4): 1036–1053, CiteSeerX 10.1.1.225.5475, doi:10.1137/0215074, MR 0861369.

sciencedirect.com

Dyer, Martin; Greenhill, Catherine (2000-04-01). "On Markov Chains for Independent Sets". Journal of Algorithms. 35 (1): 17–49. doi:10.1006/jagm.1999.1071. ISSN 0196-6774.
Xia, Mingji; Zhang, Peng; Zhao, Wenbo (2007-09-24). "Computational complexity of counting problems on 3-regular planar graphs". Theoretical Computer Science. Theory and Applications of Models of Computation. 384 (1): 111–125. doi:10.1016/j.tcs.2007.05.023. ISSN 0304-3975., quoted in Curticapean, Radu; Dell, Holger; Fomin, Fedor; Goldberg, Leslie Ann; Lapinskas, John (2019-10-01). "A Fixed-Parameter Perspective on #BIS". Algorithmica. 81 (10): 3844–3864. doi:10.1007/s00453-019-00606-4. hdl:1983/ecb5c34c-d6be-44ec-97ea-080f57c5e6af. ISSN 1432-0541. S2CID 3626662.

semanticscholar.org

api.semanticscholar.org

Korshunov (1974) Korshunov, A.D. (1974), "Coefficient of Internal Stability", Kibernetika (in Ukrainian), 10 (1): 17–28, doi:10.1007/BF01069014, S2CID 120343511.
Garey, M. R.; Johnson, D. S. (1978-07-01). ""Strong" NP-Completeness Results: Motivation, Examples, and Implications". Journal of the ACM. 25 (3): 499–508. doi:10.1145/322077.322090. ISSN 0004-5411. S2CID 18371269.
Moon & Moser (1965). Moon, J.W.; Moser, Leo (1965), "On cliques in graphs", Israel Journal of Mathematics, 3 (1): 23–28, doi:10.1007/BF02760024, MR 0182577, S2CID 9855414.
Chiba & Nishizeki (1985). Chiba, N.; Nishizeki, T. (1985), "Arboricity and subgraph listing algorithms", SIAM Journal on Computing, 14 (1): 210–223, doi:10.1137/0214017, S2CID 207051803.
Xiao & Nagamochi (2017) Xiao, Mingyu; Nagamochi, Hiroshi (2017), "Exact algorithms for maximum independent set", Information and Computation, 255: 126–146, arXiv:1312.6260, doi:10.1016/j.ic.2017.06.001, S2CID 1714739.
Minty (1980),Sbihi (1980),Nakamura & Tamura (2001),Faenza, Oriolo & Stauffer (2014),Nobili & Sassano (2015) Minty, G.J. (1980), "On maximal independent sets of vertices in claw-free graphs", Journal of Combinatorial Theory, Series B, 28 (3): 284–304, doi:10.1016/0095-8956(80)90074-x. Sbihi, Najiba (1980), "Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoile", Discrete Mathematics (in French), 29 (1): 53–76, doi:10.1016/0012-365X(90)90287-R, MR 0553650. Nakamura, D.; Tamura, A. (2001), "A revision of Minty's algorithm for finding a maximum weight stable set in a claw-free graph", Journal of Operations Research Society Japan, 44 (2): 194–204, doi:10.15807/jorsj.44.194. Faenza, Yuri; Oriolo, Gianpaolo; Stauffer, Gautier (2014), "Solving the Weighted Stable Set Problem in Claw-Free Graphs", Journal of the ACM, 61 (4): 1–41, doi:10.1145/2629600, S2CID 1995056. Nobili, P.; Sassano, A. (2015), An O(n^2 log n) algorithm for the weighted stable set problem in claw-free graphs, arXiv:1501.05775, Bibcode:2015arXiv150105775N
Bazgan, Cristina; Escoffier, Bruno; Paschos, Vangelis Th. (2005). "Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness". Theoretical Computer Science. 339 (2–3): 272–292. doi:10.1016/j.tcs.2005.03.007. S2CID 1418848.
Baker (1994); Grohe (2003). Baker, Brenda S. (1994), "Approximation algorithms for NP-complete problems on planar graphs", Journal of the ACM, 41 (1): 153–180, doi:10.1145/174644.174650, S2CID 9706753. Grohe, Martin (2003), "Local tree-width, excluded minors, and approximation algorithms", Combinatorica, 23 (4): 613–632, arXiv:math/0001128, doi:10.1007/s00493-003-0037-9, S2CID 11751235.
Halldórsson & Radhakrishnan (1997). Halldórsson, M. M.; Radhakrishnan, J. (1997), "Greed is good: Approximating independent sets in sparse and bounded-degree graphs", Algorithmica, 18 (1): 145–163, CiteSeerX 10.1.1.145.4523, doi:10.1007/BF02523693, S2CID 4661668.
Cygan, Marek (October 2013). "Improved Approximation for 3-Dimensional Matching via Bounded Pathwidth Local Search". 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. pp. 509–518. arXiv:1304.1424. doi:10.1109/FOCS.2013.61. ISBN 978-0-7695-5135-7. S2CID 14160646.
Sly, Allan (2010). "Computational Transition at the Uniqueness Threshold". 2010 IEEE 51st Annual Symposium on Foundations of Computer Science. pp. 287–296. doi:10.1109/FOCS.2010.34. ISBN 978-1-4244-8525-3. S2CID 901126.
Bezáková, Ivona; Galanis, Andreas; Goldberg, Leslie Ann; Guo, Heng; Štefankovič, Daniel (2019). "Approximation via Correlation Decay When Strong Spatial Mixing Fails". SIAM Journal on Computing. 48 (2): 279–349. arXiv:1510.09193. doi:10.1137/16M1083906. ISSN 0097-5397. S2CID 131975798.
Xia, Mingji; Zhang, Peng; Zhao, Wenbo (2007-09-24). "Computational complexity of counting problems on 3-regular planar graphs". Theoretical Computer Science. Theory and Applications of Models of Computation. 384 (1): 111–125. doi:10.1016/j.tcs.2007.05.023. ISSN 0304-3975., quoted in Curticapean, Radu; Dell, Holger; Fomin, Fedor; Goldberg, Leslie Ann; Lapinskas, John (2019-10-01). "A Fixed-Parameter Perspective on #BIS". Algorithmica. 81 (10): 3844–3864. doi:10.1007/s00453-019-00606-4. hdl:1983/ecb5c34c-d6be-44ec-97ea-080f57c5e6af. ISSN 1432-0541. S2CID 3626662.
Cannon, Sarah; Perkins, Will (2020). Chawla, Shuchi (ed.). Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics. arXiv:1906.01666. doi:10.1137/1.9781611975994.88. ISBN 978-1-61197-599-4. S2CID 174799567.
Hossain, Ayaan; Lopez, Eriberto; Halper, Sean M.; Cetnar, Daniel P.; Reis, Alexander C.; Strickland, Devin; Klavins, Eric; Salis, Howard M. (2020-07-13). "Automated design of thousands of nonrepetitive parts for engineering stable genetic systems". Nature Biotechnology. 38 (12): 1466–1475. doi:10.1038/s41587-020-0584-2. ISSN 1546-1696. PMID 32661437. S2CID 220506228.

siam.org

epubs.siam.org

Bezáková, Ivona; Galanis, Andreas; Goldberg, Leslie Ann; Guo, Heng; Štefankovič, Daniel (2019). "Approximation via Correlation Decay When Strong Spatial Mixing Fails". SIAM Journal on Computing. 48 (2): 279–349. arXiv:1510.09193. doi:10.1137/16M1083906. ISSN 0097-5397. S2CID 131975798.
Cannon, Sarah; Perkins, Will (2020). Chawla, Shuchi (ed.). Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics. arXiv:1906.01666. doi:10.1137/1.9781611975994.88. ISBN 978-1-61197-599-4. S2CID 174799567.

worldcat.org

Garey, M. R.; Johnson, D. S. (1978-07-01). ""Strong" NP-Completeness Results: Motivation, Examples, and Implications". Journal of the ACM. 25 (3): 499–508. doi:10.1145/322077.322090. ISSN 0004-5411. S2CID 18371269.
Dyer, Martin; Greenhill, Catherine (2000-04-01). "On Markov Chains for Independent Sets". Journal of Algorithms. 35 (1): 17–49. doi:10.1006/jagm.1999.1071. ISSN 0196-6774.
Bezáková, Ivona; Galanis, Andreas; Goldberg, Leslie Ann; Guo, Heng; Štefankovič, Daniel (2019). "Approximation via Correlation Decay When Strong Spatial Mixing Fails". SIAM Journal on Computing. 48 (2): 279–349. arXiv:1510.09193. doi:10.1137/16M1083906. ISSN 0097-5397. S2CID 131975798.
Xia, Mingji; Zhang, Peng; Zhao, Wenbo (2007-09-24). "Computational complexity of counting problems on 3-regular planar graphs". Theoretical Computer Science. Theory and Applications of Models of Computation. 384 (1): 111–125. doi:10.1016/j.tcs.2007.05.023. ISSN 0304-3975., quoted in Curticapean, Radu; Dell, Holger; Fomin, Fedor; Goldberg, Leslie Ann; Lapinskas, John (2019-10-01). "A Fixed-Parameter Perspective on #BIS". Algorithmica. 81 (10): 3844–3864. doi:10.1007/s00453-019-00606-4. hdl:1983/ecb5c34c-d6be-44ec-97ea-080f57c5e6af. ISSN 1432-0541. S2CID 3626662.
Skiena, Steven S. (2012). The algorithm design manual. Springer. ISBN 978-1-84800-069-8. OCLC 820425142.
Hossain, Ayaan; Lopez, Eriberto; Halper, Sean M.; Cetnar, Daniel P.; Reis, Alexander C.; Strickland, Devin; Klavins, Eric; Salis, Howard M. (2020-07-13). "Automated design of thousands of nonrepetitive parts for engineering stable genetic systems". Nature Biotechnology. 38 (12): 1466–1475. doi:10.1038/s41587-020-0584-2. ISSN 1546-1696. PMID 32661437. S2CID 220506228.