BibTeX record journals/algorithmica/MisraPRS14

download as .bib file

@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 11:35:03 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/MisraPRS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.