BibTeX record conf/csr/HenningJRS18

download as .bib file

@inproceedings{DBLP:conf/csr/HenningJRS18,
  author       = {S{\"{o}}ren Henning and
                  Klaus Jansen and
                  Malin Rau and
                  Lars Schmarje},
  editor       = {Fedor V. Fomin and
                  Vladimir V. Podolskii},
  title        = {Complexity and Inapproximability Results for Parallel Task Scheduling
                  and Strip Packing},
  booktitle    = {Computer Science - Theory and Applications - 13th International Computer
                  Science Symposium in Russia, {CSR} 2018, Moscow, Russia, June 6-10,
                  2018, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {10846},
  pages        = {169--180},
  publisher    = {Springer},
  year         = {2018},
  url          = {https://doi.org/10.1007/978-3-319-90530-3\_15},
  doi          = {10.1007/978-3-319-90530-3\_15},
  timestamp    = {Tue, 14 May 2019 10:00:51 +0200},
  biburl       = {https://dblp.org/rec/conf/csr/HenningJRS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics