@article{DBLP:journals/algorithmica/MisraPRS14,
  author    = {Neeldhara Misra and
               Geevarghese Philip and
               Venkatesh Raman and
               Saket Saurabh},
  title     = {The Kernelization Complexity of Connected Domination in Graphs with
               (no) Small Cycles},
  journal   = {Algorithmica},
  volume    = {68},
  number    = {2},
  pages     = {504--530},
  year      = {2014},
  url       = {https://doi.org/10.1007/s00453-012-9681-z},
  doi       = {10.1007/s00453-012-9681-z},
  timestamp = {Mon, 30 Oct 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/algorithmica/MisraPRS14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

{"_id":{"_str":"540c01e0480d3bb058001217"},"__v":0,"authorIDs":[],"author_short":["Misra, N.","Philip, G.","Raman, V.","Saurabh, S."],"bibbaseid":"misra-philip-raman-saurabh-thekernelizationcomplexityofconnecteddominationingraphswithnosmallcycles-2014","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Neeldhara"],"propositions":[],"lastnames":["Misra"],"suffixes":[]},{"firstnames":["Geevarghese"],"propositions":[],"lastnames":["Philip"],"suffixes":[]},{"firstnames":["Venkatesh"],"propositions":[],"lastnames":["Raman"],"suffixes":[]},{"firstnames":["Saket"],"propositions":[],"lastnames":["Saurabh"],"suffixes":[]}],"title":"The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles","journal":"Algorithmica","volume":"68","number":"2","pages":"504–530","year":"2014","url":"https://doi.org/10.1007/s00453-012-9681-z","doi":"10.1007/s00453-012-9681-z","timestamp":"Mon, 30 Oct 2017 00:00:00 +0100","biburl":"https://dblp.org/rec/journals/algorithmica/MisraPRS14.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/algorithmica/MisraPRS14,\n author = {Neeldhara Misra and\n Geevarghese Philip and\n Venkatesh Raman and\n Saket Saurabh},\n title = {The Kernelization Complexity of Connected Domination in Graphs with\n (no) Small Cycles},\n journal = {Algorithmica},\n volume = {68},\n number = {2},\n pages = {504--530},\n year = {2014},\n url = {https://doi.org/10.1007/s00453-012-9681-z},\n doi = {10.1007/s00453-012-9681-z},\n timestamp = {Mon, 30 Oct 2017 00:00:00 +0100},\n biburl = {https://dblp.org/rec/journals/algorithmica/MisraPRS14.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Misra, N.","Philip, G.","Raman, V.","Saurabh, S."],"key":"DBLP:journals/algorithmica/MisraPRS14","id":"DBLP:journals/algorithmica/MisraPRS14","bibbaseid":"misra-philip-raman-saurabh-thekernelizationcomplexityofconnecteddominationingraphswithnosmallcycles-2014","role":"author","urls":{"Paper":"https://doi.org/10.1007/s00453-012-9681-z"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://dblp.org/pid/85/6789.bib","creationDate":"2014-09-07T06:57:36.652Z","downloads":0,"keywords":[],"search_terms":["kernelization","complexity","connected","domination","graphs","small","cycles","misra","philip","raman","saurabh"],"title":"The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles","year":2014,"dataSources":["5Q8WModtorX8amuM7","tDMHZRX27gzjeY5r7"]}