Eden Chlamtac

	2012
15		Eden Chlamtac, Ishay Haviv: Linear index coding via semidefinite programming. SODA 2012: 406-419
14		Eden Chlamtac, Zac Friggstad, Konstantinos Georgiou: Understanding Set Cover: Sub-exponential Time Approximations and Lift-and-Project Methods CoRR abs/1204.5489: (2012)
	2011
13		Per Austrin, Mark Braverman, Eden Chlamtac: Inapproximability of NP-Complete Variants of Nash Equilibrium. APPROX-RANDOM 2011: 13-25
12		Per Austrin, Mark Braverman, Eden Chlamtac: Inapproximability of NP-Complete Variants of Nash Equilibrium CoRR abs/1104.3760: (2011)
11		Eden Chlamtac, Ishay Haviv: Linear Index Coding via Semidefinite Programming CoRR abs/1107.1958: (2011)
	2010
10		Eden Chlamtac, Robert Krauthgamer, Prasad Raghavendra: Approximating Sparsest Cut in Graphs of Bounded Treewidth. APPROX-RANDOM 2010: 124-137
9		Aditya Bhaskara, Moses Charikar, Eden Chlamtac, Uriel Feige, Aravindan Vijayaraghavan: Detecting high log-densities: an O(n1/4) approximation for densest k-subgraph. STOC 2010: 201-210
8		Aditya Bhaskara, Moses Charikar, Eden Chlamtac, Uriel Feige, Aravindan Vijayaraghavan: Detecting High Log-Densities -- an O(n^1/4) Approximation for Densest k-Subgraph CoRR abs/1001.2891: (2010)
7		Eden Chlamtac, Robert Krauthgamer, Prasad Raghavendra: Approximating Sparsest Cut in Graphs of Bounded Treewidth CoRR abs/1006.3970: (2010)
	2008
6		Eden Chlamtac, Gyanit Singh: Improved Approximation Guarantees through Higher Levels of SDP Hierarchies. APPROX-RANDOM 2008: 49-62
5		Pedro V. Sander, Diego Nehab, Eden Chlamtac, Hugues Hoppe: Efficient traversal of mesh edges using adjacency primitives. ACM Trans. Graph. 27(5): 144 (2008)
	2007
4		Eden Chlamtac: Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations. FOCS 2007: 691-701
	2006
3		Eden Chlamtac, Konstantin Makarychev, Yury Makarychev: How to Play Unique Games Using Embeddings. FOCS 2006: 687-696
2		Sanjeev Arora, Eden Chlamtac: New approximation guarantee for chromatic number. STOC 2006: 215-224
	2005
1		Eden Chlamtac, Uriel Feige: Improved approximation of the minimum cover time. Theor. Comput. Sci. 341(1-3): 22-38 (2005)

Coauthor Index

1	Sanjeev Arora	[2]
2	Per Austrin	[12] [13]
3	Aditya Bhaskara	[8] [9]
4	Mark Braverman	[12] [13]
5	Moses Charikar	[8] [9]
6	Uriel Feige	[1] [8] [9]
7	Zac Friggstad	[14]
8	Konstantinos Georgiou (Constantinos Georgiou)	[14]
9	Ishay Haviv	[11] [15]
10	Hugues Hoppe	[5]
11	Robert Krauthgamer	[7] [10]
12	Konstantin Makarychev	[3]
13	Yury Makarychev	[3]
14	Diego F. Nehab (Diego Nehab)	[5]
15	Prasad Raghavendra	[7] [10]
16	Pedro V. Sander	[5]
17	Gyanit Singh	[6]
18	Aravindan Vijayaraghavan	[8] [9]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page