Better Approximation Algorithms and Tighter Analysis for Set Splitting and Not-All-Equal Sat - Gunnar Andersson; Lars Engebretsen (Electron. Colloquium Comput. Complex., 1997)

Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems. - Gunnar Andersson; Lars Engebretsen (RANDOM, 1998)

An Explicit Lower Bound for TSP with Distances One and Two - Lars Engebretsen (Electron. Colloquium Comput. Complex., 1998)

Better Approximation Algorithms for SET SPLITTING and NOT-ALL-EQUAL SAT. - Gunnar Andersson; Lars Engebretsen (Inf. Process. Lett., 1998)

A New Way to Use Semidefinite Programming with Applications to Linear Equations mod p. - Gunnar Andersson; Lars Engebretsen; Johan Håstad (SODA, 1999)

Clique Is Hard to Approximate within n1-o(1). - Lars Engebretsen; Jonas Holmerin (ICALP, 2000)

Lower Bounds for non-Boolean Constraint Satisfaction - Lars Engebretsen (Electron. Colloquium Comput. Complex., 2000)

Approximation Hardness of TSP with Bounded Metrics - Lars Engebretsen; Marek Karpinski (Electron. Colloquium Comput. Complex., 2000)

Using easy optimization problems to solve hard ones. - Lars Engebretsen (FotFS, 2001)

The Non-approximability of Non-Boolean Predicates. - Lars Engebretsen (RANDOM-APPROX, 2001)

A New Way of Using Semidefinite Programming with Applications to Linear Equations mod p. - Gunnar Andersson; Lars Engebretsen; Johan Håstad (J. Algorithms, 2001)

Derandomized dimensionality reduction with applications. - Lars Engebretsen; Piotr Indyk; Ryan O'Donnell (SODA, 2002)

Harmonic broadcasting is optimal. - Lars Engebretsen; Madhu Sudan 001 (SODA, 2002)

Three-Query PCPs with Perfect Completeness over non-Boolean Domains - Lars Engebretsen; Jonas Holmerin (Electron. Colloquium Comput. Complex., 2002)

Is Constraint Satisfaction Over Two Variables Always Easy? - Lars Engebretsen; Venkatesan Guruswami (Electron. Colloquium Comput. Complex., 2002)

Property testers for dense constraint satisfaction programs on finite domains. - Gunnar Andersson; Lars Engebretsen (Random Struct. Algorithms, 2002)

Towards optimal lower bounds for clique and chromatic number. - Lars Engebretsen; Jonas Holmerin (Theor. Comput. Sci., 2003)

Simplified tight analysis of Johnson's algorithm. - Lars Engebretsen (Inf. Process. Lett., 2004)

The Nonapproximability of Non-Boolean Predicates. - Lars Engebretsen (SIAM J. Discret. Math., 2004)

Inapproximability results for equations over finite groups. - Lars Engebretsen; Jonas Holmerin; Alexander Russell (Theor. Comput. Sci., 2004)

TSP with bounded metrics. - Lars Engebretsen; Marek Karpinski (J. Comput. Syst. Sci., 2006)

Harmonic broadcasting is bandwidth-optimal assuming constant bit rate. - Lars Engebretsen; Madhu Sudan 001 (Networks, 2006)

Platform-independent code conversion within the C++ locale framework. - Lars Engebretsen (Softw. Pract. Exp., 2006)

Bipartite multigraphs with expander-like properties. - Lars Engebretsen (Discret. Appl. Math., 2007)

More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP. - Lars Engebretsen; Jonas Holmerin (Random Struct. Algorithms, 2008)