BibTeX records: Olaf Maurer

download as .bib file

@article{DBLP:journals/networks/BleyLM17,
  author       = {Andreas Bley and
                  Ivana Ljubic and
                  Olaf Maurer},
  title        = {A node-based {ILP} formulation for the node-weighted dominating Steiner
                  problem},
  journal      = {Networks},
  volume       = {69},
  number       = {1},
  pages        = {33--51},
  year         = {2017},
  url          = {https://doi.org/10.1002/net.21722},
  doi          = {10.1002/NET.21722},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/BleyLM17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/LubbeckeMMW16,
  author       = {Elisabeth L{\"{u}}bbecke and
                  Olaf Maurer and
                  Nicole Megow and
                  Andreas Wiese},
  title        = {A New Approach to Online Scheduling: Approximating the Optimal Competitive
                  Ratio},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {13},
  number       = {1},
  pages        = {15:1--15:34},
  year         = {2016},
  url          = {https://doi.org/10.1145/2996800},
  doi          = {10.1145/2996800},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/talg/LubbeckeMMW16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ArulselvanMS15,
  author       = {Ashwin Arulselvan and
                  Olaf Maurer and
                  Martin Skutella},
  title        = {An incremental algorithm for the uncapacitated facility location problem},
  journal      = {Networks},
  volume       = {65},
  number       = {4},
  pages        = {306--311},
  year         = {2015},
  url          = {https://doi.org/10.1002/net.21595},
  doi          = {10.1002/NET.21595},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/ArulselvanMS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejco/BleyLM13,
  author       = {Andreas Bley and
                  Ivana Ljubic and
                  Olaf Maurer},
  title        = {Lagrangian decompositions for the two-level FTTx network design problem},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {1},
  number       = {3-4},
  pages        = {221--252},
  year         = {2013},
  url          = {https://doi.org/10.1007/s13675-013-0014-z},
  doi          = {10.1007/S13675-013-0014-Z},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejco/BleyLM13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuntherMMW13,
  author       = {Elisabeth G{\"{u}}nther and
                  Olaf Maurer and
                  Nicole Megow and
                  Andreas Wiese},
  editor       = {Sanjeev Khanna},
  title        = {A New Approach to Online Scheduling: Approximating the Optimal Competitive
                  Ratio},
  booktitle    = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
                  2013},
  pages        = {118--128},
  publisher    = {{SIAM}},
  year         = {2013},
  url          = {https://doi.org/10.1137/1.9781611973105.9},
  doi          = {10.1137/1.9781611973105.9},
  timestamp    = {Tue, 02 Feb 2021 17:07:29 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/GuntherMMW13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-0897,
  author       = {Elisabeth G{\"{u}}nther and
                  Olaf Maurer and
                  Nicole Megow and
                  Andreas Wiese},
  title        = {A New Approach to Online Scheduling: Approximating the Optimal Competitive
                  Ratio},
  journal      = {CoRR},
  volume       = {abs/1204.0897},
  year         = {2012},
  url          = {http://arxiv.org/abs/1204.0897},
  eprinttype    = {arXiv},
  eprint       = {1204.0897},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1204-0897.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/inoc/ArulselvanBGLM11,
  author       = {Ashwin Arulselvan and
                  Andreas Bley and
                  Stefan Gollowitzer and
                  Ivana Ljubic and
                  Olaf Maurer},
  editor       = {Julia Pahl and
                  Torsten Reiners and
                  Stefan Vo{\ss}},
  title        = {{MIP} Modeling of Incremental Connected Facility Location},
  booktitle    = {Network Optimization - 5th International Conference, {INOC} 2011,
                  Hamburg, Germany, June 13-16, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6701},
  pages        = {490--502},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-21527-8\_54},
  doi          = {10.1007/978-3-642-21527-8\_54},
  timestamp    = {Fri, 16 Feb 2024 11:29:47 +0100},
  biburl       = {https://dblp.org/rec/conf/inoc/ArulselvanBGLM11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}