default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSacha Krug
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j6]Hans-Joachim Böckenhauer
, Juraj Hromkovic, Sacha Krug, Walter Unger:
On the advice complexity of the online dominating set problem. Theor. Comput. Sci. 862: 81-96 (2021)
2010 – 2019
- 2017
- [j5]Stefan Dobrev, Jeff Edmonds, Dennis Komm, Rastislav Královic, Richard Královic, Sacha Krug, Tobias Mömke:
Improved analysis of the online set cover problem with advice. Theor. Comput. Sci. 689: 96-107 (2017) - 2015
- [j4]Sacha Krug:
Towards using the history in online computation with advice. RAIRO Theor. Informatics Appl. 49(2): 139-152 (2015) - [c5]Hans-Joachim Böckenhauer, Richard J. B. Dobson, Sacha Krug, Kathleen Steinhöfel:
On Energy-Efficient Computations With Advice. COCOON 2015: 747-758 - 2014
- [j3]Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Sacha Krug, Björn Steffen:
On the advice complexity of the online L(2, 1)-coloring problem on paths and cycles. Theor. Comput. Sci. 554: 22-39 (2014) - [j2]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) - [c4]Kfir Barhum, Hans-Joachim Böckenhauer, Michal Forisek, Heidi Gebauer, Juraj Hromkovic, Sacha Krug, Jasmin Smula, Björn Steffen:
On the Power of Advice and Randomization for the Disjoint Path Allocation Problem. SOFSEM 2014: 89-101 - 2013
- [j1]Sacha Krug:
Analysis of a near-metric TSP approximation algorithm. RAIRO Theor. Informatics Appl. 47(3): 293-314 (2013) - [c3]Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Sacha Krug, Björn Steffen:
On the Advice Complexity of the Online L(2, 1)-Coloring Problem on Paths and Cycles. COCOON 2013: 53-64 - [c2]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
- [c1]Sacha Krug:
On the Approximation Ratio of the Path Matching Christofides Algorithm. SOFSEM 2012: 349-360 - [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)
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-25 05:51 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:
