Lukas Nölke

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

Robustification of Online Graph Exploration Methods  arxiv.org
Franziska Eberle, Alexander Lindermayr, Nicole Megow, Lukas Nölke, Jens Schlöter
AAAI 2022

Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time arxiv.org
Franziska Eberle, Nicole Megow, Lukas Nölke, Bertrand Simon, Andreas Wiese
Accepted for publication at FSTTCS 2021

On Minimum Generalized Manhattan Connections springer.com
Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook, Christoph Damerius, Peter Kling, Lukas Nölke, Nidia Obscura Acosta, Joachim Spoerhase
WADS 2021

Speed-Robust Scheduling arxiv.org
Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon
IPCO 2021

Online Minimum Cost Matching with Recourse on the Line [pdf]
N. Megow and L. Nölke.
APPROX 2020

Computing a Minimum-Cost k-hop Steiner Tree in Tree-Like Metrics [pdf]
M. Böhm, R. Hoeksma, N. Megow, L. Nölke and B. Simon
MFCS2020

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.
ESA 2019

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.