Rajsekar Manokaran

Publication Activity (10 Years)

Years Active: 2008-2018
Publications (10 Years): 4

Top Topics

Quadratic Program

Finding Optimal Solutions

Constraint Satisfaction Problems

Top Venues

J. Comput. Syst. Sci.

Publications

Víctor Dalmau, Andrei A. Krokhin, Rajsekar Manokaran
Towards a characterization of constant-factor approximable finite-valued CSPs. J. Comput. Syst. Sci. 97 (2018)
Johan Håstad, Rajsekar Manokaran
On the Hardness of Approximating Balanced Homogenous 3-Lin. Theory Comput. 13 (1) (2017)
Johan Håstad, Sangxia Huang, Rajsekar Manokaran, Ryan O'Donnell, John Wright
Improved NP-Inapproximability for 2-Variable Linear Equations. Theory Comput. 13 (1) (2017)
Víctor Dalmau, Andrei A. Krokhin, Rajsekar Manokaran
Towards a Characterization of Constant-Factor Approximable Finite-Valued CSPs. CoRR (2016)
Johan Håstad, Sangxia Huang, Rajsekar Manokaran, Ryan O'Donnell, John Wright
Improved NP-Inapproximability for 2-Variable Linear Equations. APPROX-RANDOM (2015)
Víctor Dalmau, Andrei A. Krokhin, Rajsekar Manokaran
Towards a Characterization of Constant-Factor Approximable Min CSPs. SODA (2015)
Per Austrin, Rajsekar Manokaran, Cenny Wenner
On the NP-Hardness of Approximating Ordering-Constraint Satisfaction Problems. Theory Comput. 11 (2015)
Konstantin Makarychev, Rajsekar Manokaran, Maxim Sviridenko
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-based Approximation Algorithm. CoRR (2014)
Konstantin Makarychev, Rajsekar Manokaran, Maxim Sviridenko
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-based Approximation Algorithm. ACM Trans. Algorithms 10 (4) (2014)
Per Austrin, Rajsekar Manokaran, Cenny Wenner
On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems. CoRR (2013)
Per Austrin, Rajsekar Manokaran, Cenny Wenner
On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems. APPROX-RANDOM (2013)
Aditya Bhaskara, Moses Charikar, Rajsekar Manokaran, Aravindan Vijayaraghavan
On Quadratic Programming with a Ratio Objective. ICALP (1) (2012)
Sanjeev Arora, Arnab Bhattacharyya, Rajsekar Manokaran, Sushant Sachdeva
Testing Permanent Oracles -- Revisited CoRR (2012)
Sanjeev Arora, Arnab Bhattacharyya, Rajsekar Manokaran, Sushant Sachdeva
Testing Permanent Oracles - Revisited. APPROX-RANDOM (2012)
Sanjeev Arora, Arnab Bhattacharyya, Rajsekar Manokaran, Sushant Sachdeva
Testing Permanent Oracles - Revisited. Electron. Colloquium Comput. Complex. 19 (2012)
Venkatesan Guruswami, Johan Håstad, Rajsekar Manokaran, Prasad Raghavendra, Moses Charikar
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant. SIAM J. Comput. 40 (3) (2011)
Aditya Bhaskara, Moses Charikar, Rajsekar Manokaran, Aravindan Vijayaraghavan
On Quadratic Programming with a Ratio Objective CoRR (2011)
Venkatesan Guruswami, Johan Håstad, Rajsekar Manokaran, Prasad Raghavendra, Moses Charikar
Beating the Random Ordering is Hard: Every ordering CSP is approximation resistant. Electron. Colloquium Comput. Complex. 18 (2011)
Amit Kumar, Rajsekar Manokaran, Madhur Tulsiani, Nisheeth K. Vishnoi
On LP-Based Approximability for Strict CSPs. SODA (2011)
Konstantin Makarychev, Rajsekar Manokaran, Maxim Sviridenko
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm. ICALP (1) (2010)
Amit Kumar, Rajsekar Manokaran, Madhur Tulsiani, Nisheeth K. Vishnoi
On the Optimality of a Class of LP-based Algorithms. Electron. Colloquium Comput. Complex. 16 (2009)
Moses Charikar, Venkatesan Guruswami, Rajsekar Manokaran
Every Permutation CSP of arity 3 is Approximation Resistant. Computational Complexity Conference (2009)
Amit Kumar, Rajsekar Manokaran, Madhur Tulsiani, Nisheeth K. Vishnoi
On the Optimality of a Class of LP-based Algorithms CoRR (2009)
Venkatesan Guruswami, Rajsekar Manokaran, Prasad Raghavendra
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph. FOCS (2008)
Rajsekar Manokaran, Joseph Naor, Prasad Raghavendra, Roy Schwartz
Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling. STOC (2008)