Max-Sur-CSP on Two Elements. - Hannes Uppman (CP, 2012)

The Complexity of Three-Element Min-Sol and Conservative Min-Cost-Hom. - Hannes Uppman (ICALP (1), 2013)

Computational Complexity of the Minimum Cost Homomorphism Problem on Three-Element Domains. - Hannes Uppman (CoRR, 2013)

Three-Element Min-Sol and Conservative Min-Cost-Hom - Hannes Uppman (CoRR, 2013)

Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis. - Peter Jonsson; Victor Lagerkvist; Johannes Schmidt 001; Hannes Uppman (MFCS (2), 2014)

Computational Complexity of the Extended Minimum Cost Homomorphism Problem on Three-Element Domains. - Hannes Uppman (STACS, 2014)

On Some Combinatorial Optimization Problems: Algorithms and Complexity. - Hannes Uppman (2015)

The Complexity of Boolean Surjective General-Valued CSPs. - Peter Fulla; Hannes Uppman; Stanislav Zivný (ACM Trans. Comput. Theory, 2019)

A matheuristic approach to large-scale avionic scheduling. - Emil Karlsson; Elina Rönnberg; Andreas Stenberg; Hannes Uppman (Ann. Oper. Res., 2021)

The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems. - Peter Jonsson; Victor Lagerkvist; Johannes Schmidt 001; Hannes Uppman (Theor. Comput. Sci., 2021)