Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs. van Bevern, R., Hartung, S., Kammer, F., Niedermeier, R., & Weller, M. In Parameterized and Exact Computation - 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers, pages 194–206, 2011.
Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/iwpec/BevernHKNW11,
  author       = {Ren{\'{e}} van Bevern and
                  Sepp Hartung and
                  Frank Kammer and
                  Rolf Niedermeier and
                  Mathias Weller},
  title        = {Linear-Time Computation of a Linear Problem Kernel for Dominating
                  Set on Planar Graphs},
  booktitle    = {Parameterized and Exact Computation - 6th International Symposium,
                  {IPEC} 2011, Saarbr{\"{u}}cken, Germany, September 6-8, 2011. Revised
                  Selected Papers},
  pages        = {194--206},
  year         = {2011},
  crossref     = {DBLP:conf/iwpec/2011},
  url          = {https://doi.org/10.1007/978-3-642-28050-4\_16},
  doi          = {10.1007/978-3-642-28050-4\_16},
  timestamp    = {Fri, 09 Apr 2021 18:49:30 +0200},
  biburl       = {https://dblp.org/rec/conf/iwpec/BevernHKNW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0