![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Hannes Uppman
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j3]Emil Karlsson
, Elina Rönnberg
, Andreas Stenberg, Hannes Uppman
:
A matheuristic approach to large-scale avionic scheduling. Ann. Oper. Res. 302(2): 425-459 (2021) - [j2]Peter Jonsson, Victor Lagerkvist, Johannes Schmidt
, Hannes Uppman
:
The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems. Theor. Comput. Sci. 892: 1-24 (2021)
2010 – 2019
- 2019
- [j1]Peter Fulla, Hannes Uppman
, Stanislav Zivný
:
The Complexity of Boolean Surjective General-Valued CSPs. ACM Trans. Comput. Theory 11(1): 4:1-4:31 (2019) - 2015
- [b1]Hannes Uppman:
On Some Combinatorial Optimization Problems: Algorithms and Complexity. Linköping University, Sweden, 2015 - 2014
- [c4]Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman
:
Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis. MFCS (2) 2014: 408-419 - [c3]Hannes Uppman
:
Computational Complexity of the Extended Minimum Cost Homomorphism Problem on Three-Element Domains. STACS 2014: 651-662 - [i3]Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman:
Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis. CoRR abs/1406.3247 (2014) - 2013
- [c2]Hannes Uppman
:
The Complexity of Three-Element Min-Sol and Conservative Min-Cost-Hom. ICALP (1) 2013: 804-815 - [i2]Hannes Uppman:
Three-Element Min-Sol and Conservative Min-Cost-Hom. CoRR abs/1301.0027 (2013) - [i1]Hannes Uppman:
Computational Complexity of the Minimum Cost Homomorphism Problem on Three-Element Domains. CoRR abs/1308.1394 (2013) - 2012
- [c1]Hannes Uppman
:
Max-Sur-CSP on Two Elements. CP 2012: 38-54
Coauthor Index
![](https://dblp.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-04-24 23:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint