Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDennis Komm
- > Home > Persons > Dennis Komm
Publications
- 2022
[j20]Hans-Joachim Böckenhauer
, Dennis Komm, Raphael Wegner:
Call admission problems on grids with advice. Theor. Comput. Sci. 918: 77-93 (2022)- [j19]Hans-Joachim Böckenhauer, Nina Corvelo Benz, Dennis Komm:
Call admission problems on trees. Theor. Comput. Sci. 922: 410-423 (2022) - 2019
- [j16]Hans-Joachim Böckenhauer, Tobias Kohn, Dennis Komm, Giovanni Serafini:
An Elementary Approach Towards Teaching Dynamic Programming. Bull. EATCS 128 (2019) - [c24]Hans-Joachim Böckenhauer, Nina Corvelo Benz, Dennis Komm:
Call Admission Problems on Trees with Advice - (Extended Abstract). IWOCA 2019: 108-121 - 2018
- [j11]Maria Paola Bianchi, Hans-Joachim Böckenhauer, Tatjana Brülisauer, Dennis Komm, Beatrice Palano:
Online Minimum Spanning Tree with Advice. Int. J. Found. Comput. Sci. 29(4): 505-527 (2018) - [c20]Hans-Joachim Böckenhauer, Dennis Komm, Raphael Wegner:
Call Admission Problems on Grids with Advice (Extended Abstract). WAOA 2018: 118-133 - [p1]Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm:
Reoptimization of Hard Optimization Problems. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 427-454 - [e1]Hans-Joachim Böckenhauer, Dennis Komm, Walter Unger:
Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 11011, Springer 2018, ISBN 978-3-319-98354-7 [contents] - 2017
- [j9]Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke:
Online algorithms with advice: The tape model. Inf. Comput. 254: 59-83 (2017) - [j8]Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic:
On the advice complexity of the k-server problem. J. Comput. Syst. Sci. 86: 159-170 (2017) - 2016
- [c16]Maria Paola Bianchi, Hans-Joachim Böckenhauer, Tatjana Brülisauer, Dennis Komm, Beatrice Palano:
Online Minimum Spanning Tree with Advice - (Extended Abstract). SOFSEM 2016: 195-207 - 2014
- [j6]Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Peter Rossmanith:
The online knapsack problem: Advice and randomization. Theor. Comput. Sci. 527: 61-72 (2014) - [j5]Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock:
The string guessing problem as a method to prove lower bounds on the advice complexity. Theor. Comput. Sci. 554: 95-108 (2014) - [c12]Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm:
A Technique to Obtain Hardness Results for Randomized Online Algorithms - A Survey. Computing with New Resources 2014: 264-276 - 2013
- [c10]Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock:
The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity. COCOON 2013: 493-505 - 2012
- [c9]Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Richard Královic, Peter Rossmanith:
On the Power of Randomness versus Advice in Online Computation. Languages Alive 2012: 30-43 - [c7]Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Peter Rossmanith:
On the Advice Complexity of the Knapsack Problem. LATIN 2012: 61-72 - [i1]Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock:
The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j4]Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych:
Reoptimization of the Shortest Common Superstring Problem. Algorithmica 61(2): 227-251 (2011) - [c6]Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic:
On the Advice Complexity of the k-Server Problem. ICALP (1) 2011: 207-218 - 2010
- [j1]Hans-Joachim Böckenhauer, Dennis Komm:
Reoptimization of the metric deadline TSP. J. Discrete Algorithms 8(1): 87-100 (2010) - 2009
- [c3]Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych:
Reoptimization of the Shortest Common Superstring Problem. CPM 2009: 78-91 - [c2]Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke:
On the Advice Complexity of Online Problems. ISAAC 2009: 331-340 - 2008
- [c1]Hans-Joachim Böckenhauer, Dennis Komm:
Reoptimization of the Metric Deadline TSP. MFCS 2008: 156-167
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-09 20:47 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:
