Hannes Uppman

According to our database, Hannes Uppman authored at least 10 papers between 2012 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2021

The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems.

Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman

Theor. Comput. Sci., 2021

A matheuristic approach to large-scale avionic scheduling.

Emil Karlsson, Elina Rönnberg, Andreas Stenberg, Hannes Uppman

Ann. Oper. Res., 2021

2019

The Complexity of Boolean Surjective General-Valued CSPs.

Peter Fulla, Hannes Uppman, Stanislav Zivný

ACM Trans. Comput. Theory, 2019

2015

On Some Combinatorial Optimization Problems: Algorithms and Complexity.

Hannes Uppman

PhD thesis, 2015

2014

Computational Complexity of the Extended Minimum Cost Homomorphism Problem on Three-Element Domains.

Hannes Uppman

Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis.

Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013

Three-Element Min-Sol and Conservative Min-Cost-Hom

Hannes Uppman

CoRR, 2013

Computational Complexity of the Minimum Cost Homomorphism Problem on Three-Element Domains.

Hannes Uppman

CoRR, 2013

The Complexity of Three-Element Min-Sol and Conservative Min-Cost-Hom.

Hannes Uppman

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

Max-Sur-CSP on Two Elements.

Hannes Uppman

Proceedings of the Principles and Practice of Constraint Programming, 2012