Jonas Holmerin Vis

*	2008
19	EE	Lars Engebretsen, Jonas Holmerin: More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP. Random Struct. Algorithms 33(4): 497-514 (2008)
	2005
18	EE	Lars Engebretsen, Jonas Holmerin: More Efficient Queries in PCPs for NP and Improved Approximation Hardness of Maximum CSP. STACS 2005: 194-205
17	EE	Lars Engebretsen, Jonas Holmerin: Three-query PCPs with perfect completeness over non-Boolean domains. Random Struct. Algorithms 27(1): 46-75 (2005)
	2004
16	EE	Jonas Holmerin, Subhash Khot: A new PCP outer verifier with applications to homogeneous linear equations and max-bisection. STOC 2004: 11-20
15	EE	Lars Engebretsen, Jonas Holmerin, Alexander Russell: Inapproximability results for equations over finite groups. Theor. Comput. Sci. 312(1): 17-45 (2004)
	2003
14	EE	Lars Engebretsen, Jonas Holmerin: Three-Query PCPs with Perfect Completeness over non-Boolean Domains. IEEE Conference on Computational Complexity 2003: 284-299
13	EE	Jonas Holmerin, Subhash Khot: A Strong Inapproximability Gap for a Generalization of Minimum Bisection. IEEE Conference on Computational Complexity 2003: 371-378
12	EE	Lars Engebretsen, Jonas Holmerin: Towards optimal lower bounds for clique and chromatic number. Theor. Comput. Sci. 1-3(299): 537-584 (2003)
	2002
11	EE	Jonas Holmerin: Improved Inapproximability Results for Vertex Cover on k -Uniform Hypergraphs. ICALP 2002: 1005-1016
10	EE	Lars Engebretsen, Jonas Holmerin, Alexander Russell: Inapproximability Results for Equations over Finite Groups. ICALP 2002: 73-84
9	EE	Jonas Holmerin: Vertex Cover on 4-Regular Hyper-graphs Is Hard to Approximate within 2 - \epsilon. IEEE Conference on Computational Complexity 2002: 6
8	EE	Jonas Holmerin: Vertex cover on 4-regular hyper-graphs is hard to approximate within 2-epsilon. STOC 2002: 544-552
7	EE	Lars Engebretsen, Jonas Holmerin, Alexander Russell: Inapproximability Results for Equations over Finite Groups Electronic Colloquium on Computational Complexity (ECCC)(030): (2002)
6	EE	Lars Engebretsen, Jonas Holmerin: Three-Query PCPs with Perfect Completeness over non-Boolean Domains Electronic Colloquium on Computational Complexity (ECCC)(040): (2002)
	2001
5	EE	Jonas Holmerin: Vertex Cover on 4-regular Hyper-graphs is Hard to Approximate Within 2-epsilon Electronic Colloquium on Computational Complexity (ECCC)(094): (2001)
4	EE	Lars Engebretsen, Jonas Holmerin: Towards Optimal Lower Bounds For Clique and Chromatic Number Electronic Colloquium on Computational Complexity (ECCC) 8(3): (2001)
	2000
3	EE	Jonas Holmerin, Björn Lisper: Development of Parallel Algorithms in Data Field Haskell (Research Note). Euro-Par 2000: 762-766
2	EE	Lars Engebretsen, Jonas Holmerin: Clique Is Hard to Approximate within n1-o(1). ICALP 2000: 2-12
1	EE	Jonas Holmerin, Björn Lisper: Data Field Haskell. Electr. Notes Theor. Comput. Sci. 41(1): (2000)

Coauthor Index

1	Lars Engebretsen	[2] [4] [6] [7] [10] [12] [14] [15] [17] [18] [19]
2	Subhash Khot	[13] [16]
3	Björn Lisper	[1] [3]
4	Alexander Russell	[7] [10] [15]

Colors in the list of coauthors