Efficient robust algorithms for the Maximum Weight Stable Set Problem in chair-free graph classes

Andreas Brandstädt, Van Bang Le, H. N. de Ridder. Efficient robust algorithms for the Maximum Weight Stable Set Problem in chair-free graph classes. Inf. Process. Lett., 89(4):165-173, 2004. [doi]

@article{BrandstadtLR04,
  title = {Efficient robust algorithms for the Maximum Weight Stable Set Problem in chair-free graph classes},
  author = {Andreas Brandstädt and Van Bang Le and H. N. de Ridder},
  year = {2004},
  doi = {10.1016/j.ipl.2003.11.002},
  url = {http://dx.doi.org/10.1016/j.ipl.2003.11.002},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BrandstadtLR04},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {89},
  number = {4},
  pages = {165-173},
}