![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Henri Lotze
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
- [j1]Li-Hsuan Chen, Ling-Ju Hung
, Henri Lotze
, Peter Rossmanith:
Online Node- and Edge-Deletion Problems with Advice. Algorithmica 83(9): 2719-2753 (2021)
Conference and Workshop Papers
- 2024
- [c9]Matthias Gehnen, Henri Lotze, Peter Rossmanith:
Online Simple Knapsack with Bounded Predictions. STACS 2024: 37:1-37:20 - 2023
- [c8]Elisabet Burjons
, Fabian Frei
, Matthias Gehnen
, Henri Lotze
, Daniel Mock
, Peter Rossmanith
:
Delaying Decisions and Reservation Costs. COCOON (1) 2023: 371-383 - [c7]Niklas Berndt
, Henri Lotze
:
Advice Complexity Bounds for Online Delayed ℱ-Node-, H-Node- and H-Edge-Deletion Problems. IWOCA 2023: 62-73 - [c6]Elisabet Burjons, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith:
The Online Simple Knapsack Problem with Reservation and Removability. MFCS 2023: 29:1-29:12 - 2022
- [c5]Elisabet Burjons
, Janosch Fuchs
, Henri Lotze
:
The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs. IWOCA 2022: 243-256 - 2021
- [c4]Elisabet Burjons
, Matthias Gehnen
, Henri Lotze
, Daniel Mock
, Peter Rossmanith
:
The Secretary Problem with Reservation Costs. COCOON 2021: 553-564 - [c3]Hans-Joachim Böckenhauer, Elisabet Burjons
, Juraj Hromkovic, Henri Lotze, Peter Rossmanith:
Online Simple Knapsack with Reservation Costs. STACS 2021: 16:1-16:18 - 2020
- [c2]Jan Dreier
, Henri Lotze
, Peter Rossmanith
:
Hard Problems on Random Graphs. ICALP 2020: 40:1-40:14 - [c1]Li-Hsuan Chen, Ling-Ju Hung
, Henri Lotze
, Peter Rossmanith:
Further Results on Online Node- and Edge-Deletion Problems with Advice. IWOCA 2020: 140-153
Informal and Other Publications
- 2024
- [i5]Hans-Joachim Böckenhauer, Matthias Gehnen, Juraj Hromkovic, Ralf Klasing, Dennis Komm, Henri Lotze, Daniel Mock, Peter Rossmanith, Moritz Stocker:
Online Unbounded Knapsack. CoRR abs/2407.02045 (2024) - 2023
- [i4]Niklas Berndt, Henri Lotze:
Advice Complexity bounds for Online Delayed F-Node-, H-Node- and H-Edge-Deletion Problems. CoRR abs/2303.17346 (2023) - [i3]Elisabet Burjons, Fabian Frei, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith:
Delaying Decisions and Reservation Costs. CoRR abs/2307.07284 (2023) - 2022
- [i2]Elisabet Burjons, Janosch Fuchs, Henri Lotze:
The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs. CoRR abs/2201.04061 (2022) - 2020
- [i1]Hans-Joachim Böckenhauer
, Elisabet Burjons, Juraj Hromkovic, Henri Lotze, Peter Rossmanith:
Online Simple Knapsack with Reservation Costs. CoRR abs/2009.14043 (2020)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-08-11 01:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint