BibTeX record journals/mst/HenningJRS20

download as .bib file

@article{DBLP:journals/mst/HenningJRS20,
  author       = {S{\"{o}}ren Henning and
                  Klaus Jansen and
                  Malin Rau and
                  Lars Schmarje},
  title        = {Complexity and Inapproximability Results for Parallel Task Scheduling
                  and Strip Packing},
  journal      = {Theory Comput. Syst.},
  volume       = {64},
  number       = {1},
  pages        = {120--140},
  year         = {2020},
  url          = {https://doi.org/10.1007/s00224-019-09910-6},
  doi          = {10.1007/S00224-019-09910-6},
  timestamp    = {Thu, 14 Oct 2021 09:05:57 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/HenningJRS20.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.