Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph. - Venkatesan Guruswami; Rajsekar Manokaran; Prasad Raghavendra (FOCS, 2008)

Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling. - Rajsekar Manokaran; Joseph Naor; Prasad Raghavendra; Roy Schwartz 002 (STOC, 2008)

Every Permutation CSP of arity 3 is Approximation Resistant. - Moses Charikar; Venkatesan Guruswami; Rajsekar Manokaran (CCC, 2009)

On the Optimality of a Class of LP-based Algorithms. - Amit Kumar 001; Rajsekar Manokaran; Madhur Tulsiani; Nisheeth K. Vishnoi (Electron. Colloquium Comput. Complex., 2009)

On LP-Based Approximability for Strict CSPs. - Amit Kumar 001; Rajsekar Manokaran; Madhur Tulsiani; Nisheeth K. Vishnoi (SODA, 2011)

Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant. - Venkatesan Guruswami; Johan Håstad; Rajsekar Manokaran; Prasad Raghavendra; Moses Charikar (SIAM J. Comput., 2011)

On Quadratic Programming with a Ratio Objective. - Aditya Bhaskara; Moses Charikar; Rajsekar Manokaran; Aravindan Vijayaraghavan (ICALP (1), 2012)

Testing Permanent Oracles - Revisited. - Sanjeev Arora; Arnab Bhattacharyya 001; Rajsekar Manokaran; Sushant Sachdeva (Electron. Colloquium Comput. Complex., 2012)

Approximability and Mathematical Relaxations - Rajsekar Manokaran (2012)

Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-based Approximation Algorithm. - Konstantin Makarychev; Rajsekar Manokaran; Maxim Sviridenko (ACM Trans. Algorithms, 2014)

Towards a Characterization of Constant-Factor Approximable Min CSPs. - Víctor Dalmau; Andrei A. Krokhin; Rajsekar Manokaran (SODA, 2015)

On the NP-Hardness of Approximating Ordering-Constraint Satisfaction Problems. - Per Austrin; Rajsekar Manokaran; Cenny Wenner (Theory Comput., 2015)

Improved NP-Inapproximability for 2-Variable Linear Equations. - Johan Håstad; Sangxia Huang; Rajsekar Manokaran; Ryan O'Donnell; John Wright 004 (Theory Comput., 2017)

On the Hardness of Approximating Balanced Homogenous 3-Lin. - Johan Håstad; Rajsekar Manokaran (Theory Comput., 2017)

Towards a characterization of constant-factor approximable finite-valued CSPs. - Víctor Dalmau; Andrei A. Krokhin; Rajsekar Manokaran (J. Comput. Syst. Sci., 2018)

Farmer.Chat: Scaling AI-Powered Agricultural Services for Smallholder Farmers. - Namita Singh; Jacqueline Wang'ombe; Nereah Okanga; Tetyana Zelenska; Jona Repishti; Jayasankar G. K; Sanjeev Mishra; Rajsekar Manokaran; Vineet Singh; Mohammed Irfan Rafiq; Rikin Gandhi; Akshay Nambi 001 (CoRR, 2024)