Lukas Nölke

According to our database, Lukas Nölke authored at least 12 papers between 2019 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2023

Speed-robust scheduling: sand, bricks, and rocks.

Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon

Math. Program., February, 2023

Matching and packing problems - optimization under uncertainty in theory and practice

Lukas Nölke

PhD thesis, 2023

2022

On Hop-Constrained Steiner Trees in Tree-Like Metrics.

Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon

SIAM J. Discret. Math., 2022

Robustification of Online Graph Exploration Methods.

Franziska Eberle, Alexander Lindermayr, Nicole Megow, Lukas Nölke, Jens Schlöter

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

On Minimum Generalized Manhattan Connections.

Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook, Christoph Damerius, Peter Kling, Lukas Nölke, Nidia Obscura Acosta, Joachim Spoerhase

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time.

Franziska Eberle, Nicole Megow, Lukas Nölke, Bertrand Simon, Andreas Wiese

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2020

Speed-Robust Scheduling.

Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon

CoRR, 2020

Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time.

Martin Böhm, Franziska Eberle, Nicole Megow, Lukas Nölke, Jens Schlöter, Bertrand Simon, Andreas Wiese

CoRR, 2020

Online Minimum Cost Matching on the Line with Recourse.

Nicole Megow, Lukas Nölke

CoRR, 2020

Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics.

Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Online Minimum Cost Matching with Recourse on the Line.

Nicole Megow, Lukas Nölke

Proceedings of the Approximation, 2020

2019

On the Complexity of Anchored Rectangle Packing.

Antonios Antoniadis, Felix Biermeier, Andrés Cristi, Christoph Damerius, Ruben Hoeksma, Dominik Kaaser, Peter Kling, Lukas Nölke

Proceedings of the 27th Annual European Symposium on Algorithms, 2019