BibTeX records: Marten Waanders

download as .bib file

@article{DBLP:journals/mst/CornelissenHMNR18,
  author       = {Kamiel Cornelissen and
                  Ruben Hoeksma and
                  Bodo Manthey and
                  N. S. Narayanaswamy and
                  C. S. Rahul and
                  Marten Waanders},
  title        = {Approximation Algorithms for Connected Graph Factors of Minimum Weight},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {2},
  pages        = {441--464},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-016-9723-z},
  doi          = {10.1007/S00224-016-9723-Z},
  timestamp    = {Thu, 28 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/CornelissenHMNR18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/MantheyW15,
  author       = {Bodo Manthey and
                  Marten Waanders},
  editor       = {Laura Sanit{\`{a}} and
                  Martin Skutella},
  title        = {Approximation Algorithms for k-Connected Graph Factors},
  booktitle    = {Approximation and Online Algorithms - 13th International Workshop,
                  {WAOA} 2015, Patras, Greece, September 17-18, 2015. Revised Selected
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {9499},
  pages        = {1--12},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-319-28684-6\_1},
  doi          = {10.1007/978-3-319-28684-6\_1},
  timestamp    = {Tue, 14 May 2019 10:00:46 +0200},
  biburl       = {https://dblp.org/rec/conf/waoa/MantheyW15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics