Recognizing k-equistable Graphs in FPT Time

Eun Jung Kim 0002, Martin Milanic, Oliver Schaudt. Recognizing k-equistable Graphs in FPT Time. In Ernst W. Mayr, editor, Graph-Theoretic Concepts in Computer Science - 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers. Volume 9224 of Lecture Notes in Computer Science, pages 487-498, Springer, 2015. [doi]

@inproceedings{0002MS15,
  title = {Recognizing k-equistable Graphs in FPT Time},
  author = {Eun Jung Kim 0002 and Martin Milanic and Oliver Schaudt},
  year = {2015},
  doi = {10.1007/978-3-662-53174-7_34},
  url = {http://dx.doi.org/10.1007/978-3-662-53174-7_34},
  researchr = {https://researchr.org/publication/0002MS15},
  cites = {0},
  citedby = {0},
  pages = {487-498},
  booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers},
  editor = {Ernst W. Mayr},
  volume = {9224},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-662-53173-0},
}