Lossy Kernels for Connected Dominating Set on Sparse Graphs (bibtex)
by Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz
Reference:
Lossy Kernels for Connected Dominating Set on Sparse GraphsEduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France (Rolf Niedermeier, Brigitte Vallée, eds.), volume 96 of LIPIcs, pages 29:1–29:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
Bibtex Entry:
@inproceedings{DBLP:conf/stacs/EibenKMPS18,
  author    = {Eduard Eiben and
               Mithilesh Kumar and
               Amer E. Mouawad and
               Fahad Panolan and
               Sebastian Siebertz},
  title     = {Lossy Kernels for Connected Dominating Set on Sparse Graphs},
  booktitle = {35th Symposium on Theoretical Aspects of Computer Science, {STACS}
               2018, February 28 to March 3, 2018, Caen, France},
  pages     = {29:1--29:15},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.STACS.2018.29},
  doi       = {10.4230/LIPIcs.STACS.2018.29},
  editor    = {Rolf Niedermeier and
               Brigitte Vall{\'{e}}e},
  series    = {LIPIcs},
  volume    = {96},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
}
Powered by bibtexbrowser