Maximum Weight Independent Sets in ( S_1, 1, 3 , bull)-free Graphs

T. Karthick, Frédéric Maffray. Maximum Weight Independent Sets in ( S_1, 1, 3 , bull)-free Graphs. In Thang N. Dinh, My T. Thai, editors, Computing and Combinatorics - 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings. Volume 9797 of Lecture Notes in Computer Science, pages 385-392, Springer, 2016. [doi]

@inproceedings{KarthickM16-1,
  title = {Maximum Weight Independent Sets in ( S_1, 1, 3 , bull)-free Graphs},
  author = {T. Karthick and Frédéric Maffray},
  year = {2016},
  doi = {10.1007/978-3-319-42634-1_31},
  url = {http://dx.doi.org/10.1007/978-3-319-42634-1_31},
  researchr = {https://researchr.org/publication/KarthickM16-1},
  cites = {0},
  citedby = {0},
  pages = {385-392},
  booktitle = {Computing and Combinatorics - 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings},
  editor = {Thang N. Dinh and My T. Thai},
  volume = {9797},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-42633-4},
}