Complexity of Kernelization in the Possible Winner Problem. Dey, P.; Misra, N.; and Narahari, Y. CoRR, 2014.
Complexity of Kernelization in the Possible Winner Problem [link]Paper  bibtex   
@article{ dblp1466680,
  title = {Complexity of Kernelization in the Possible Winner Problem},
  author = {Palash Dey and Neeldhara Misra and Y. Narahari},
  author_short = {Dey, P. and Misra, N. and Narahari, Y.},
  bibtype = {article},
  type = {article},
  year = {2014},
  key = {dblp1466680},
  id = {dblp1466680},
  biburl = {http://www.dblp.org/rec/bibtex/journals/corr/DeyMN14a},
  url = {http://arxiv.org/abs/1405.3865},
  journal = {CoRR},
  volume = {abs/1405.3865},
  text = {CoRR abs/1405.3865 (2014)}
}
Downloads: 0