BibTeX record journals/tcs/KhoshkhahGMT19

download as .bib file

@article{DBLP:journals/tcs/KhoshkhahGMT19,
  author       = {Kaveh Khoshkhah and
                  Mehdi Khosravian Ghadikolaei and
                  J{\'{e}}r{\^{o}}me Monnot and
                  Dirk Oliver Theis},
  title        = {Complexity and approximability of extended Spanning Star Forest problems
                  in general and complete graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {775},
  pages        = {1--15},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2018.11.025},
  doi          = {10.1016/J.TCS.2018.11.025},
  timestamp    = {Tue, 16 Jun 2020 17:16:20 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/KhoshkhahGMT19.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.