Skip to main content

Lukas Nölke

Lukas Nölke

Universität Bremen
FB3: Mathematik/Informatik
Bibliothekstr. 5
28359 Bremen
Germany
Office: MZH 3260
Phone: +49 (421) 218-63586
Email
Office hours: by appointment

Computing a Minimum-Cost k-hop Steiner Tree in Tree-Like Metrics

About me

I am a PhD student at the University of Bremen in Germany under the supervision of Prof. Dr. Nicole Megow. My research interests are combinatorial optimization and approximation algorithms, especially under uncertainty, as well as theoretical graph theory.

Publications

Computing a Minimum-Cost k-hop Steiner Tree in Tree-Like Metrics [preprint: pdf]
M. Böhm, R. Hoeksma, N. Megow, L. Nölke and B. Simon
Accepted for publication at the 45th International Symposium on Mathematical Foundations of Computer Science (MFCS2020)

Online Mimimum Cost Matching  with Recourse on the Line [preprint: pdf]
N. Megow and L. Nölke.
Accepted for publication at the 23rd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2020)

On the Complexity of Anchored Rectangle Packing  [pdf]
A. Antoniadis, F. Biermeier, A. Cristi, C. Damerius, R. Hoeksma, D.. Kaaser, P. Kling, and L. Nölke.
In Proc. of the 27th Annual European Symposium on Algorithms (ESA 2019), DOI: 10.4230/LIPIcs.ESA.2019.8

Education

  • Master of Science, Mathematics, Paderborn University, Germany.

    Advisor: Prof. Dr. Eckhard Steffen.
    Thesis title: Recent Developments in Nowhere-Zero Flow Problems.

  • Bachelor of Science, Mathematics, Paderborn University, Germany.

    Advisor: Prof. Dr. Peter Buergisser.
    Thesis title: A Combinatorial/Numerical Algorithm for Symmetric, Diagonally Dominant Linear Systems.