On the Kernelization Complexity of String Problems

Basavaraju, Manu; Panolan, Fahad; Rai, Ashutosh; Ramanujan, M. S.; Saurabh, Saket

doi:10.1007/978-3-319-08783-2_13

by Manu Basavaraju, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan, Saket Saurabh

Reference:

On the Kernelization Complexity of String ProblemsManu Basavaraju, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan, Saket SaurabhComputing and Combinatorics - 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings, pages 141–153, 2014.

Bibtex Entry:

@inproceedings{BasavarajuPRRamanujanS14,
  author    = {Manu Basavaraju and
               Fahad Panolan and
               Ashutosh Rai and
               M. S. Ramanujan and
               Saket Saurabh},
  title     = {On the Kernelization Complexity of String Problems},
  booktitle = {Computing and Combinatorics - 20th International Conference, {COCOON}
               2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings},
  pages     = {141--153},
  year      = {2014},
  url       = {10.1007/978-3-319-08783-2_13">http://dx.doi.org/10.1007/978-3-319-08783-2_13},
  doi       = {10.1007/978-3-319-08783-2_13},
  timestamp = {Tue, 08 Jul 2014 08:07:12 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/cocoon/BasavarajuPRRS14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}