Complexity of Kernelization in the Possible Winner Problem. Dey, P., Misra, N., & Narahari, Y. CoRR, 2014.
Complexity of Kernelization in the Possible Winner Problem [link]Paper  bibtex   
@article{DBLP:journals/corr/DeyMN14a,
  author    = {Palash Dey and
               Neeldhara Misra and
               Y. Narahari},
  title     = {Complexity of Kernelization in the Possible Winner Problem},
  journal   = {CoRR},
  volume    = {abs/1405.3865},
  year      = {2014},
  url       = {http://arxiv.org/abs/1405.3865},
  archivePrefix = {arXiv},
  eprint    = {1405.3865},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/DeyMN14a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0