( en | de | ru )

 

Disambiguation of "Nölke, Lukas"

Author of the publication

copydeleteadd this publication to your clipboard
On Minimum Generalized Manhattan Connections.

, , , , , , , and . WADS, volume 12808 of Lecture Notes in Computer Science, page 85-100. Springer, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Gerhard Nölke

Konrad Nölkensmeier

Stefan Nölker

Klaus Nölker

Otto Nölke

 

Other publications of authors with the same name

On Minimum Generalized Manhattan Connections, , , , , , , and . Proc. 17th Algorithms and Data Structures Symposium (WADS'21), 12808, page 85--100. (2021)Matching and packing problems - optimization under uncertainty in theory and practice. Bremen University, Germany, (2023)base-search.net (ftsubbremen:oai:media.suub.uni-bremen.de:Publications/elib/6748).Robustification of Online Graph Exploration Methods., , , , and . AAAI, page 9732-9740. AAAI Press, (2022)Robustification of Online Graph Exploration Methods., , , , and . CoRR, (2021)Speed-Robust Scheduling - Sand, Bricks, and Rocks., , , , , and . IPCO, volume 12707 of Lecture Notes in Computer Science, page 283-296. Springer, (2021)Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics., , , , and . MFCS, volume 170 of LIPIcs, page 18:1-18:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time., , , , and . FSTTCS, volume 213 of LIPIcs, page 18:1-18:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)On Hop-Constrained Steiner Trees in Tree-Like Metrics., , , , and . SIAM J. Discret. Math., 36 (2): 1249-1273 (2022)Speed-robust scheduling: sand, bricks, and rocks., , , , , and . Math. Program., 197 (2): 1009-1048 (February 2023)Online Minimum Cost Matching on the Line with Recourse., and . CoRR, (2020)