Vertex cover (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Vertex cover" in English language version.

refsWebsite

Global rank English rank

11doi.org

2^nd place

5semanticscholar.org

11^th place

8^th place

2psu.edu

207^th place

136^th place

2weizmann.ac.il

4,983^rd place

8,002^nd place

2nature.com

234^th place

397^th place

2worldcat.org

5^th place

2nih.gov

4^th place

1acm.org

1,185^th place

840^th place

1lafayette.edu

low place

1erikdemaine.org

low place

1springer.com

274^th place

309^th place

1mcmaster.ca

6,572^nd place

4,351^st place

1books.google.com

3^rd place

1ieee.org

652^nd place

515^th place

1dartmouth.edu

2,242^nd place

1,513^th place

1osti.gov

2,036^th place

1,254^th place

acm.org

portal.acm.org

Garey, Johnson & Stockmeyer 1974 Garey, Michael R.; Johnson, David S.; Stockmeyer, Larry (1974). "Some simplified NP-complete problems". Proceedings of the Sixth Annual ACM Symposium on Theory of Computing. pp. 47–63. doi:10.1145/800119.803884.

books.google.com

Karpinski & Zelikovsky 1998 Karpinski, Marek; Zelikovsky, Alexander (1998). "Approximating dense cases of covering problems". Proceedings of the DIMACS Workshop on Network Design: Connectivity and Facilities Location. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. Vol. 40. American Mathematical Society. pp. 169–178.

dartmouth.edu

cs.dartmouth.edu

Chakrabarti, Amit (Winter 2005). "Approximation Algorithms: Vertex Cover" (PDF). Computer Science 105. Dartmouth College. Retrieved 21 February 2005.

doi.org

Garey, Johnson & Stockmeyer 1974 Garey, Michael R.; Johnson, David S.; Stockmeyer, Larry (1974). "Some simplified NP-complete problems". Proceedings of the Sixth Annual ACM Symposium on Theory of Computing. pp. 47–63. doi:10.1145/800119.803884.
Garey & Johnson 1977; Garey & Johnson 1979, pp. 190 and 195. Garey, Michael R.; Johnson, David S. (1977). "The rectilinear Steiner tree problem is NP-complete". SIAM Journal on Applied Mathematics. 32 (4): 826–834. doi:10.1137/0132071. Garey, Michael R.; Johnson, David S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman. ISBN 0-7167-1045-5. A1.1: GT1, pg.190.
Chen, Kanj & Xia 2006 Chen, Jianer; Kanj, Iyad A.; Xia, Ge (2006). "Improved Parameterized Upper Bounds for Vertex Cover". Mathematical Foundations of Computer Science 2006: 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings (PDF). Lecture Notes in Computer Science. Vol. 4162. Springer-Verlag. pp. 238–249. doi:10.1007/11821069_21. ISBN 978-3-540-37791-7.
Demaine et al. 2005 Demaine, Erik; Fomin, Fedor V.; Hajiaghayi, Mohammad Taghi; Thilikos, Dimitrios M. (2005). "Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs". Journal of the ACM. 52 (6): 866–893. doi:10.1145/1101821.1101823. S2CID 6238832. Retrieved 2010-03-05.
Flum & Grohe (2006, p. 437) Flum, Jörg; Grohe, Martin (2006). Parameterized Complexity Theory. Springer. doi:10.1007/3-540-29953-X. ISBN 978-3-540-29952-3. Retrieved 2010-03-05.
Karakostas 2009 Karakostas, George (November 2009). "A better approximation ratio for the vertex cover problem" (PDF). ACM Transactions on Algorithms. 5 (4): 41:1–41:8. CiteSeerX 10.1.1.649.7407. doi:10.1145/1597036.1597045. S2CID 2525818. ECCC TR04-084.
Dinur & Safra 2005 Dinur, Irit; Safra, Samuel (2005). "On the hardness of approximating minimum vertex cover". Annals of Mathematics. 162 (1): 439–485. CiteSeerX 10.1.1.125.334. doi:10.4007/annals.2005.162.439.
Khot, Minzer & Safra 2017; Dinur et al. 2018; Khot, Minzer & Safra 2018 Khot, Subhash; Minzer, Dor; Safra, Muli (2017). "On independent sets, 2-to-2 games, and Grassmann graphs". In Hatami, Hamed; McKenzie, Pierre; King, Valerie (eds.). Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017. Association for Computing Machinery. pp. 576–589. doi:10.1145/3055399.3055432. ISBN 978-1-4503-4528-6. ECCC TR16-124. Dinur, Irit; Khot, Subhash; Kindler, Guy; Minzer, Dor; Safra, Muli (2018). "Towards a proof of the 2-to-1 games conjecture?". In Diakonikolas, Ilias; Kempe, David; Henzinger, Monika (eds.). Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018. Association for Computing Machinery. pp. 376–389. doi:10.1145/3188745.3188804. ISBN 978-1-4503-5559-9. ECCC TR16-198. Khot, Subhash; Minzer, Dor; Safra, Muli (2018). "Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion". 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS). pp. 592–601. doi:10.1109/FOCS.2018.00062. ISBN 978-1-5386-4230-6. S2CID 3688775.
Khot & Regev 2008 Khot, Subhash; Regev, Oded (2008). "Vertex cover might be hard to approximate to within 2−ε". Journal of Computer and System Sciences. 74 (3): 335–349. doi:10.1016/j.jcss.2007.06.019.
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 1087-0156. PMID 32661437. S2CID 220506228.
Reis, Alexander C.; Halper, Sean M.; Vezeau, Grace E.; Cetnar, Daniel P.; Hossain, Ayaan; Clauer, Phillip R.; Salis, Howard M. (November 2019). "Simultaneous repression of multiple bacterial genes using nonrepetitive extra-long sgRNA arrays". Nature Biotechnology. 37 (11): 1294–1301. doi:10.1038/s41587-019-0286-9. ISSN 1546-1696. OSTI 1569832. PMID 31591552. S2CID 203852115.

erikdemaine.org

Demaine et al. 2005 Demaine, Erik; Fomin, Fedor V.; Hajiaghayi, Mohammad Taghi; Thilikos, Dimitrios M. (2005). "Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs". Journal of the ACM. 52 (6): 866–893. doi:10.1145/1101821.1101823. S2CID 6238832. Retrieved 2010-03-05.

ieee.org

ieeexplore.ieee.org

Khot, Minzer & Safra 2017; Dinur et al. 2018; Khot, Minzer & Safra 2018 Khot, Subhash; Minzer, Dor; Safra, Muli (2017). "On independent sets, 2-to-2 games, and Grassmann graphs". In Hatami, Hamed; McKenzie, Pierre; King, Valerie (eds.). Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017. Association for Computing Machinery. pp. 576–589. doi:10.1145/3055399.3055432. ISBN 978-1-4503-4528-6. ECCC TR16-124. Dinur, Irit; Khot, Subhash; Kindler, Guy; Minzer, Dor; Safra, Muli (2018). "Towards a proof of the 2-to-1 games conjecture?". In Diakonikolas, Ilias; Kempe, David; Henzinger, Monika (eds.). Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018. Association for Computing Machinery. pp. 376–389. doi:10.1145/3188745.3188804. ISBN 978-1-4503-5559-9. ECCC TR16-198. Khot, Subhash; Minzer, Dor; Safra, Muli (2018). "Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion". 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS). pp. 592–601. doi:10.1109/FOCS.2018.00062. ISBN 978-1-5386-4230-6. S2CID 3688775.

lafayette.edu

cs.lafayette.edu

Chen, Kanj & Xia 2006 Chen, Jianer; Kanj, Iyad A.; Xia, Ge (2006). "Improved Parameterized Upper Bounds for Vertex Cover". Mathematical Foundations of Computer Science 2006: 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings (PDF). Lecture Notes in Computer Science. Vol. 4162. Springer-Verlag. pp. 238–249. doi:10.1007/11821069_21. ISBN 978-3-540-37791-7.

mcmaster.ca

cas.mcmaster.ca

Karakostas 2009 Karakostas, George (November 2009). "A better approximation ratio for the vertex cover problem" (PDF). ACM Transactions on Algorithms. 5 (4): 41:1–41:8. CiteSeerX 10.1.1.649.7407. doi:10.1145/1597036.1597045. S2CID 2525818. ECCC TR04-084.

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 1087-0156. PMID 32661437. S2CID 220506228.
Reis, Alexander C.; Halper, Sean M.; Vezeau, Grace E.; Cetnar, Daniel P.; Hossain, Ayaan; Clauer, Phillip R.; Salis, Howard M. (November 2019). "Simultaneous repression of multiple bacterial genes using nonrepetitive extra-long sgRNA arrays". Nature Biotechnology. 37 (11): 1294–1301. doi:10.1038/s41587-019-0286-9. ISSN 1546-1696. OSTI 1569832. PMID 31591552. S2CID 203852115.

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 1087-0156. PMID 32661437. S2CID 220506228.
Reis, Alexander C.; Halper, Sean M.; Vezeau, Grace E.; Cetnar, Daniel P.; Hossain, Ayaan; Clauer, Phillip R.; Salis, Howard M. (November 2019). "Simultaneous repression of multiple bacterial genes using nonrepetitive extra-long sgRNA arrays". Nature Biotechnology. 37 (11): 1294–1301. doi:10.1038/s41587-019-0286-9. ISSN 1546-1696. OSTI 1569832. PMID 31591552. S2CID 203852115.

osti.gov

Reis, Alexander C.; Halper, Sean M.; Vezeau, Grace E.; Cetnar, Daniel P.; Hossain, Ayaan; Clauer, Phillip R.; Salis, Howard M. (November 2019). "Simultaneous repression of multiple bacterial genes using nonrepetitive extra-long sgRNA arrays". Nature Biotechnology. 37 (11): 1294–1301. doi:10.1038/s41587-019-0286-9. ISSN 1546-1696. OSTI 1569832. PMID 31591552. S2CID 203852115.

psu.edu

citeseerx.ist.psu.edu

Karakostas 2009 Karakostas, George (November 2009). "A better approximation ratio for the vertex cover problem" (PDF). ACM Transactions on Algorithms. 5 (4): 41:1–41:8. CiteSeerX 10.1.1.649.7407. doi:10.1145/1597036.1597045. S2CID 2525818. ECCC TR04-084.
Dinur & Safra 2005 Dinur, Irit; Safra, Samuel (2005). "On the hardness of approximating minimum vertex cover". Annals of Mathematics. 162 (1): 439–485. CiteSeerX 10.1.1.125.334. doi:10.4007/annals.2005.162.439.

semanticscholar.org

api.semanticscholar.org

Demaine et al. 2005 Demaine, Erik; Fomin, Fedor V.; Hajiaghayi, Mohammad Taghi; Thilikos, Dimitrios M. (2005). "Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs". Journal of the ACM. 52 (6): 866–893. doi:10.1145/1101821.1101823. S2CID 6238832. Retrieved 2010-03-05.
Karakostas 2009 Karakostas, George (November 2009). "A better approximation ratio for the vertex cover problem" (PDF). ACM Transactions on Algorithms. 5 (4): 41:1–41:8. CiteSeerX 10.1.1.649.7407. doi:10.1145/1597036.1597045. S2CID 2525818. ECCC TR04-084.
Khot, Minzer & Safra 2017; Dinur et al. 2018; Khot, Minzer & Safra 2018 Khot, Subhash; Minzer, Dor; Safra, Muli (2017). "On independent sets, 2-to-2 games, and Grassmann graphs". In Hatami, Hamed; McKenzie, Pierre; King, Valerie (eds.). Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017. Association for Computing Machinery. pp. 576–589. doi:10.1145/3055399.3055432. ISBN 978-1-4503-4528-6. ECCC TR16-124. Dinur, Irit; Khot, Subhash; Kindler, Guy; Minzer, Dor; Safra, Muli (2018). "Towards a proof of the 2-to-1 games conjecture?". In Diakonikolas, Ilias; Kempe, David; Henzinger, Monika (eds.). Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018. Association for Computing Machinery. pp. 376–389. doi:10.1145/3188745.3188804. ISBN 978-1-4503-5559-9. ECCC TR16-198. Khot, Subhash; Minzer, Dor; Safra, Muli (2018). "Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion". 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS). pp. 592–601. doi:10.1109/FOCS.2018.00062. ISBN 978-1-5386-4230-6. S2CID 3688775.
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 1087-0156. PMID 32661437. S2CID 220506228.
Reis, Alexander C.; Halper, Sean M.; Vezeau, Grace E.; Cetnar, Daniel P.; Hossain, Ayaan; Clauer, Phillip R.; Salis, Howard M. (November 2019). "Simultaneous repression of multiple bacterial genes using nonrepetitive extra-long sgRNA arrays". Nature Biotechnology. 37 (11): 1294–1301. doi:10.1038/s41587-019-0286-9. ISSN 1546-1696. OSTI 1569832. PMID 31591552. S2CID 203852115.

springer.com

link.springer.com

Flum & Grohe (2006, p. 437) Flum, Jörg; Grohe, Martin (2006). Parameterized Complexity Theory. Springer. doi:10.1007/3-540-29953-X. ISBN 978-3-540-29952-3. Retrieved 2010-03-05.

weizmann.ac.il

eccc.weizmann.ac.il

Karakostas 2009 Karakostas, George (November 2009). "A better approximation ratio for the vertex cover problem" (PDF). ACM Transactions on Algorithms. 5 (4): 41:1–41:8. CiteSeerX 10.1.1.649.7407. doi:10.1145/1597036.1597045. S2CID 2525818. ECCC TR04-084.
Khot, Minzer & Safra 2017; Dinur et al. 2018; Khot, Minzer & Safra 2018 Khot, Subhash; Minzer, Dor; Safra, Muli (2017). "On independent sets, 2-to-2 games, and Grassmann graphs". In Hatami, Hamed; McKenzie, Pierre; King, Valerie (eds.). Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017. Association for Computing Machinery. pp. 576–589. doi:10.1145/3055399.3055432. ISBN 978-1-4503-4528-6. ECCC TR16-124. Dinur, Irit; Khot, Subhash; Kindler, Guy; Minzer, Dor; Safra, Muli (2018). "Towards a proof of the 2-to-1 games conjecture?". In Diakonikolas, Ilias; Kempe, David; Henzinger, Monika (eds.). Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018. Association for Computing Machinery. pp. 376–389. doi:10.1145/3188745.3188804. ISBN 978-1-4503-5559-9. ECCC TR16-198. Khot, Subhash; Minzer, Dor; Safra, Muli (2018). "Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion". 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS). pp. 592–601. doi:10.1109/FOCS.2018.00062. ISBN 978-1-5386-4230-6. S2CID 3688775.

worldcat.org

search.worldcat.org

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 1087-0156. PMID 32661437. S2CID 220506228.
Reis, Alexander C.; Halper, Sean M.; Vezeau, Grace E.; Cetnar, Daniel P.; Hossain, Ayaan; Clauer, Phillip R.; Salis, Howard M. (November 2019). "Simultaneous repression of multiple bacterial genes using nonrepetitive extra-long sgRNA arrays". Nature Biotechnology. 37 (11): 1294–1301. doi:10.1038/s41587-019-0286-9. ISSN 1546-1696. OSTI 1569832. PMID 31591552. S2CID 203852115.