Lukas Nölke

University of Bremen — Germany

Computer Science · Physical Sciences

3h-index18citations15works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Optimization and Search Problems(10), Complexity and Algorithms in Graphs(8), Scheduling and Optimization Algorithms(4), Computational Geometry and Mesh Generation(4), Optimization and Packing Problems(4)

Publications15 total

Online Metric Matching on the Line with Recourse
Algorithmica·2025Open Access
Speed-robust scheduling: sand, bricks, and rocks
Mathematical Programming·2022· 4 citedOpen Access
Robustification of Online Graph Exploration Methods
Proceedings of the AAAI Conference on Artificial Intelligence·2022· 3 citedOpen Access
On Hop-Constrained Steiner Trees in Tree-Like Metrics
SIAM Journal on Discrete Mathematics·2022Open Access
Speed-Robust Scheduling: Sand, Bricks, and Rocks
Data Archiving and Networked Services (DANS)·2021· 1 citedOpen Access
On Minimum Generalized Manhattan Connections
Lecture notes in computer science·2021Open Access
Speed-Robust Scheduling
Lecture notes in computer science·2021Open Access
Speed-Robust Scheduling -- Sand, Bricks, and Rocks
arXiv (Cornell University)·2020Open Access
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2020· 1 citedOpen Access
On Hop-Constrained Steiner Trees in Tree-Like Metrics
arXiv (Cornell University)·2020Open Access
Online Minimum Cost Matching on the Line with Recourse
arXiv (Cornell University)·2020Open Access
Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2020· 3 citedOpen Access
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time.
arXiv (Cornell University)·2020Open Access
Online Minimum Cost Matching with Recourse on the Line
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2020· 5 citedOpen Access
On the Complexity of Anchored Rectangle Packing
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2019· 1 citedOpen Access

Frequent Co-authors

Nicole Megow(13), Ruben Hoeksma(8), Bertrand Simon(8), Franziska Eberle(7), Martin Böhm(5), Kevin Schewior(4), Jens Schlöter(3), Antonios Antoniadis(2), Christoph Damerius(2), Peter Kling(2), Alexander Lindermayr(1), Felix Biermeier(1), Andrés Cristi(1), Dominik Kaaser(1), Margarita Capretto(1), Parinya Chalermsook(1), Nidia Obscura(1), Joachim Spoerhase(1), Andreas Wiese(1)