Lukas Nölke

Publication Activity (10 Years)

Years Active: 2019-2023
Publications (10 Years): 15

Top Topics

Top Venues

Publications

Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon
Speed-robust scheduling: sand, bricks, and rocks. Math. Program. 197 (2) (2023)
Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon
On Hop-Constrained Steiner Trees in Tree-Like Metrics. SIAM J. Discret. Math. 36 (2) (2022)
Franziska Eberle, Alexander Lindermayr, Nicole Megow, Lukas Nölke, Jens Schlöter
Robustification of Online Graph Exploration Methods. AAAI (2022)
Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook, Christoph Damerius, Peter Kling, Lukas Nölke, Nidia Obscura Acosta, Joachim Spoerhase
On Minimum Generalized Manhattan Connections. WADS (2021)
Franziska Eberle, Alexander Lindermayr, Nicole Megow, Lukas Nölke, Jens Schlöter
Robustification of Online Graph Exploration Methods. CoRR (2021)
Franziska Eberle, Nicole Megow, Lukas Nölke, Bertrand Simon, Andreas Wiese
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time. FSTTCS (2021)
Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon
Speed-Robust Scheduling - Sand, Bricks, and Rocks. IPCO (2021)
Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon
Computing a Minimum-Cost k-hop Steiner Tree in Tree-Like Metrics. CoRR (2020)
Martin Böhm, Franziska Eberle, Nicole Megow, Lukas Nölke, Jens Schlöter, Bertrand Simon, Andreas Wiese
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time. CoRR (2020)
Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook, Christoph Damerius, Peter Kling, Lukas Nölke, Nidia Obscura Acosta, Joachim Spoerhase
On Minimum Generalized Manhattan Connections. CoRR (2020)
Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon
Speed-Robust Scheduling. CoRR (2020)
Nicole Megow, Lukas Nölke
Online Minimum Cost Matching with Recourse on the Line. APPROX-RANDOM (2020)
Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon
Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics. MFCS (2020)
Nicole Megow, Lukas Nölke
Online Minimum Cost Matching on the Line with Recourse. CoRR (2020)
Antonios Antoniadis, Felix Biermeier, Andrés Cristi, Christoph Damerius, Ruben Hoeksma, Dominik Kaaser, Peter Kling, Lukas Nölke
On the Complexity of Anchored Rectangle Packing. ESA (2019)