Conversion of coloring algorithms into maximum weight independent set algorithms

Thomas Erlebach, Klaus Jansen. Conversion of coloring algorithms into maximum weight independent set algorithms. Discrete Applied Mathematics, 148(1):107-125, 2005. [doi]

@article{ErlebachJ05,
  title = {Conversion of coloring algorithms into maximum weight independent set algorithms},
  author = {Thomas Erlebach and Klaus Jansen},
  year = {2005},
  doi = {10.1016/j.dam.2004.11.007},
  url = {http://dx.doi.org/10.1016/j.dam.2004.11.007},
  researchr = {https://researchr.org/publication/ErlebachJ05},
  cites = {0},
  citedby = {0},
  journal = {Discrete Applied Mathematics},
  volume = {148},
  number = {1},
  pages = {107-125},
}