On the Kernelization Complexity of Colorful Motifs

Ambalath, Abhimanyu M.; Balasundaram, Radheshyam; H., Chintan Rao; Koppula, Venkata; Misra, Neeldhara; Philip, Geevarghese; Ramanujan, M. S.

doi:10.1007/978-3-642-17493-3_4

by Abhimanyu M. Ambalath, Radheshyam Balasundaram, Chintan Rao H., Venkata Koppula, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan

View PDF

Reference:

On the Kernelization Complexity of Colorful MotifsAbhimanyu M. Ambalath, Radheshyam Balasundaram, Chintan Rao H., Venkata Koppula, Neeldhara Misra, Geevarghese Philip, M. S. RamanujanParameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, pages 14–25, 2010.

Bibtex Entry:

@inproceedings{AmbalathBHKMPRamanujan10,
  author    = {Abhimanyu M. Ambalath and
               Radheshyam Balasundaram and
               Chintan Rao H. and
               Venkata Koppula and
               Neeldhara Misra and
               Geevarghese Philip and
               M. S. Ramanujan},
  title     = {On the Kernelization Complexity of Colorful Motifs},
  booktitle = {Parameterized and Exact Computation - 5th International Symposium,
               {IPEC} 2010, Chennai, India, December 13-15, 2010. Proceedings},
  pages     = {14--25},
  year      = {2010},
  url       = {10.1007/978-3-642-17493-3_4">http://dx.doi.org/10.1007/978-3-642-17493-3_4},
  doi       = {10.1007/978-3-642-17493-3_4},
  timestamp = {Fri, 21 Jan 2011 13:43:23 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/iwpec/AmbalathBHKMPR10},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}