Manokaran, Rajsekar

1. On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems
   2013/07/18 by Austrin, Per, Manokaran, Rajsekar, Wenner, Cenny · 3 citations
   #Computational Complexity (cs.CC) #FOS: Computer and information sciences
2. Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-based Approximation Algorithm
   2014/03/30 by Makarychev, Konstantin, Manokaran, Rajsekar, Sviridenko, Maxim · 3 citations
   #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
3. Farmer.Chat: Scaling AI-Powered Agricultural Services for Smallholder Farmers
   2024/09/13 by Namita Singh, J. Wang’ombe, Singh, Namita +21 · 4 citations
   Business, Management and Accounting · Engineering · #FinTech, Crowdfunding, Digital Finance #Smart Cities and Technologies