Hannes Uppman

Publication Activity (10 Years)

Years Active: 2012-2021
Publications (10 Years): 3

Top Topics

Exponential Size

Computational Complexity

Top Venues

Ann. Oper. Res.

ACM Trans. Comput. Theory

Publications

Emil Karlsson, Elina Rönnberg, Andreas Stenberg, Hannes Uppman
A matheuristic approach to large-scale avionic scheduling. Ann. Oper. Res. 302 (2) (2021)
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 (2021)
Peter Fulla, Hannes Uppman, Stanislav Zivný
The Complexity of Boolean Surjective General-Valued CSPs. ACM Trans. Comput. Theory 11 (1) (2019)
Hannes Uppman
Computational Complexity of the Extended Minimum Cost Homomorphism Problem on Three-Element Domains. STACS (2014)
Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman
Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis. CoRR (2014)
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)
Hannes Uppman
Computational Complexity of the Minimum Cost Homomorphism Problem on Three-Element Domains. CoRR (2013)
Hannes Uppman
Three-Element Min-Sol and Conservative Min-Cost-Hom CoRR (2013)
Hannes Uppman
The Complexity of Three-Element Min-Sol and Conservative Min-Cost-Hom. ICALP (1) (2013)
Hannes Uppman
Max-Sur-CSP on Two Elements. CP (2012)