2008 | ||
---|---|---|
2 | EE | Venkatesan Guruswami, Rajsekar Manokaran, Prasad Raghavendra: Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph. FOCS 2008: 573-582 |
1 | EE | Rajsekar Manokaran, Joseph Naor, Prasad Raghavendra, Roy Schwartz: Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling. STOC 2008: 11-20 |
1 | Venkatesan Guruswami | [2] |
2 | Joseph Naor (Seffi Naor) | [1] |
3 | Prasad Raghavendra | [1] [2] |
4 | Roy Schwartz | [1] |