External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Vertex Cover Gets Faster and Harder on Low Degree Graphs

Akanksha Agrawal, Sathish Govindarajan, Neeldhara Misra. Vertex Cover Gets Faster and Harder on Low Degree Graphs. In Zhipeng Cai, Alex Zelikovsky, Anu G. Bourgeois, editors, Computing and Combinatorics - 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings. Volume 8591 of Lecture Notes in Computer Science, pages 179-190, Springer, 2014. [doi]

Authors

Akanksha Agrawal

This author has not been identified. Look up 'Akanksha Agrawal' in Google

Sathish Govindarajan

This author has not been identified. Look up 'Sathish Govindarajan' in Google

Neeldhara Misra

This author has not been identified. Look up 'Neeldhara Misra' in Google
runs on