default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLukas Nölke
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[b1]Lukas Nölke:
Matching and packing problems - optimization under uncertainty in theory and practice. Bremen University, Germany, 2023- [j2]Franziska Eberle
, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon:
Speed-robust scheduling: sand, bricks, and rocks. Math. Program. 197(2): 1009-1048 (2023) - 2022
- [j1]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): 1249-1273 (2022) - [c7]Franziska Eberle, Alexander Lindermayr, Nicole Megow, Lukas Nölke, Jens Schlöter:
Robustification of Online Graph Exploration Methods. AAAI 2022: 9732-9740 - 2021
- [c6]Franziska Eberle, Nicole Megow, Lukas Nölke, Bertrand Simon, Andreas Wiese:
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time. FSTTCS 2021: 18:1-18:17 - [c5]Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon:
Speed-Robust Scheduling - Sand, Bricks, and Rocks. IPCO 2021: 283-296 - [c4]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: 85-100 - [i6]Franziska Eberle, Alexander Lindermayr, Nicole Megow, Lukas Nölke, Jens Schlöter:
Robustification of Online Graph Exploration Methods. CoRR abs/2112.05422 (2021) - 2020
- [c3]Nicole Megow, Lukas Nölke:
Online Minimum Cost Matching with Recourse on the Line. APPROX-RANDOM 2020: 37:1-37:16 - [c2]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: 18:1-18:15 - [i5]Nicole Megow, Lukas Nölke:
Online Minimum Cost Matching on the Line with Recourse. CoRR abs/2001.03107 (2020) - [i4]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 abs/2003.05699 (2020) - [i3]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 abs/2007.08415 (2020) - [i2]Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook, Christoph Damerius, Peter Kling, Lukas Nölke, Nidia Obscura Acosta, Joachim Spoerhase:
On Minimum Generalized Manhattan Connections. CoRR abs/2010.14338 (2020) - [i1]Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon:
Speed-Robust Scheduling. CoRR abs/2011.05181 (2020)
2010 – 2019
- 2019
- [c1]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: 8:1-8:14
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
