Tight Approximability Results for the Maximum Solution Equation Problem over Zp. - Fredrik Kuivinen (MFCS, 2005)

Approximability of Integer Programming with Generalised Constraints. - Peter Jonsson; Fredrik Kuivinen; Gustav Nordh (CP, 2006)

Approximability of Bounded Occurrence Max Ones. - Fredrik Kuivinen (MFCS, 2006)

Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems. - Peter Jonsson; Andrei A. Krokhin; Fredrik Kuivinen (CSR, 2007)

MAX ONES Generalized to Larger Domains. - Peter Jonsson; Fredrik Kuivinen; Gustav Nordh (SIAM J. Comput., 2008)

Hard constraint satisfaction problems have hard gaps at location 1. - Peter Jonsson; Andrei A. Krokhin; Fredrik Kuivinen (Theor. Comput. Sci., 2009)

Algorithms and Hardness Results for Some Valued CSPs. - Fredrik Kuivinen (2009)

Min CSP on Four Elements: Moving beyond Submodularity. - Peter Jonsson; Fredrik Kuivinen; Johan Thapper (CP, 2011)

On the complexity of submodular function minimisation on diamonds. - Fredrik Kuivinen (Discret. Optim., 2011)