Vertex Cover Gets Faster and Harder on Low Degree Graphs. Agrawal, A., Govindarajan, S., & Misra, N. CoRR, 2014.
Vertex Cover Gets Faster and Harder on Low Degree Graphs [link]Paper  bibtex   
@article{DBLP:journals/corr/AgrawalGM14,
  author    = {Akanksha Agrawal and
               Sathish Govindarajan and
               Neeldhara Misra},
  title     = {Vertex Cover Gets Faster and Harder on Low Degree Graphs},
  journal   = {CoRR},
  volume    = {abs/1404.5566},
  year      = {2014},
  url       = {http://arxiv.org/abs/1404.5566},
  archivePrefix = {arXiv},
  eprint    = {1404.5566},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/AgrawalGM14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0