BibTeX record journals/iandc/FellowsFLRSST11

download as .bib file

@article{DBLP:journals/iandc/FellowsFLRSST11,
  author       = {Michael R. Fellows and
                  Fedor V. Fomin and
                  Daniel Lokshtanov and
                  Frances A. Rosamond and
                  Saket Saurabh and
                  Stefan Szeider and
                  Carsten Thomassen},
  title        = {On the complexity of some colorful problems parameterized by treewidth},
  journal      = {Inf. Comput.},
  volume       = {209},
  number       = {2},
  pages        = {143--153},
  year         = {2011},
  url          = {https://doi.org/10.1016/j.ic.2010.11.026},
  doi          = {10.1016/J.IC.2010.11.026},
  timestamp    = {Fri, 12 Feb 2021 22:15:34 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/FellowsFLRSST11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.