@article{Fellows_2011,
    doi = {10.1016/j.ic.2010.11.026},
    url = {https://doi.org/10.1016%2Fj.ic.2010.11.026},
    year = {2011},
    month = {feb},
    publisher = {Elsevier {BV}},
    volume = {209},
    number = {2},
    pages = {143--153},
    author = {Michael R. Fellows and Fedor V. Fomin and Daniel Lokshtanov and Frances Rosamond and Saket Saurabh and Stefan Szeider and Carsten Thomassen},
    title = {On the complexity of some colorful problems parameterized by treewidth},
    journal = {Information and Computation}
}

@article{Fellows_2011, doi = {10.1016/j.ic.2010.11.026}, url = {https://doi.org/10.1016%2Fj.ic.2010.11.026}, year = {2011}, month = {feb}, publisher = {Elsevier {BV}}, volume = {209}, number = {2}, pages = {143--153}, author = {Michael R. Fellows and Fedor V. Fomin and Daniel Lokshtanov and Frances Rosamond and Saket Saurabh and Stefan Szeider and Carsten Thomassen}, title = {On the complexity of some colorful problems parameterized by treewidth}, journal = {Information and Computation} }