Fredrik Kuivinen

According to our database, Fredrik Kuivinen authored at least 9 papers between 2005 and 2011.

Collaborative distances:

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

2011

On the complexity of submodular function minimisation on diamonds.

Fredrik Kuivinen

Discret. Optim., 2011

Min CSP on Four Elements: Moving beyond Submodularity.

Peter Jonsson, Fredrik Kuivinen, Johan Thapper

Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

2009

Algorithms and Hardness Results for Some Valued CSPs.

Fredrik Kuivinen

PhD thesis, 2009

Hard constraint satisfaction problems have hard gaps at location 1.

Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen

Theor. Comput. Sci., 2009

2008

MAX ONES Generalized to Larger Domains.

Peter Jonsson, Fredrik Kuivinen, Gustav Nordh

SIAM J. Comput., 2008

2007

Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems.

Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen

Proceedings of the Computer Science, 2007

2006

Approximability of Bounded Occurrence Max Ones.

Fredrik Kuivinen

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Approximability of Integer Programming with Generalised Constraints.

Peter Jonsson, Fredrik Kuivinen, Gustav Nordh

Proceedings of the Principles and Practice of Constraint Programming, 2006

2005

Tight Approximability Results for the Maximum Solution Equation Problem over Z_p.

Fredrik Kuivinen

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005