Rajsekar Manokaran

27 papers A* 4A 1Journal 16Unranked 5

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