default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRajsekar Manokaran
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i10]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:
Farmer.Chat: Scaling AI-Powered Agricultural Services for Smallholder Farmers. CoRR abs/2409.08916 (2024)
2010 – 2019
- 2018
- [j6]Víctor Dalmau, Andrei A. Krokhin
, Rajsekar Manokaran:
Towards a characterization of constant-factor approximable finite-valued CSPs. J. Comput. Syst. Sci. 97: 14-27 (2018) - 2017
- [j5]Johan Håstad, Sangxia Huang, Rajsekar Manokaran, Ryan O'Donnell, John Wright:
Improved NP-Inapproximability for 2-Variable Linear Equations. Theory Comput. 13(1): 1-51 (2017) - [j4]Johan Håstad, Rajsekar Manokaran:
On the Hardness of Approximating Balanced Homogenous 3-Lin. Theory Comput. 13(1): 1-19 (2017) - 2016
- [i9]Víctor Dalmau, Andrei A. Krokhin, Rajsekar Manokaran:
Towards a Characterization of Constant-Factor Approximable Finite-Valued CSPs. CoRR abs/1610.01019 (2016) - 2015
- [j3]Per Austrin, Rajsekar Manokaran, Cenny Wenner:
On the NP-Hardness of Approximating Ordering-Constraint Satisfaction Problems. Theory Comput. 11: 257-283 (2015) - [c10]Johan Håstad, Sangxia Huang, Rajsekar Manokaran, Ryan O'Donnell, John Wright:
Improved NP-Inapproximability for 2-Variable Linear Equations. APPROX-RANDOM 2015: 341-360 - [c9]Víctor Dalmau, Andrei A. Krokhin, Rajsekar Manokaran:
Towards a Characterization of Constant-Factor Approximable Min CSPs. SODA 2015: 847-857 - 2014
- [j2]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): 18:1-18:18 (2014) - [i8]Konstantin Makarychev, Rajsekar Manokaran, Maxim Sviridenko:
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-based Approximation Algorithm. CoRR abs/1403.7721 (2014) - 2013
- [c8]Per Austrin, Rajsekar Manokaran, Cenny Wenner:
On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems. APPROX-RANDOM 2013: 26-41 - [i7]Per Austrin, Rajsekar Manokaran, Cenny Wenner:
On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems. CoRR abs/1307.5090 (2013) - 2012
- [b1]Rajsekar Manokaran:
Approximability and Mathematical Relaxations. Princeton University, USA, 2012 - [c7]Sanjeev Arora, Arnab Bhattacharyya, Rajsekar Manokaran, Sushant Sachdeva:
Testing Permanent Oracles - Revisited. APPROX-RANDOM 2012: 362-373 - [c6]Aditya Bhaskara, Moses Charikar, Rajsekar Manokaran, Aravindan Vijayaraghavan:
On Quadratic Programming with a Ratio Objective. ICALP (1) 2012: 109-120 - [i6]Sanjeev Arora, Arnab Bhattacharyya, Rajsekar Manokaran, Sushant Sachdeva:
Testing Permanent Oracles -- Revisited. CoRR abs/1207.4783 (2012) - [i5]Sanjeev Arora, Arnab Bhattacharyya, Rajsekar Manokaran, Sushant Sachdeva:
Testing Permanent Oracles - Revisited. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j1]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): 878-914 (2011) - [c5]Amit Kumar, Rajsekar Manokaran, Madhur Tulsiani, Nisheeth K. Vishnoi:
On LP-Based Approximability for Strict CSPs. SODA 2011: 1560-1573 - [i4]Aditya Bhaskara, Moses Charikar, Rajsekar Manokaran, Aravindan Vijayaraghavan:
On Quadratic Programming with a Ratio Objective. CoRR abs/1101.1710 (2011) - [i3]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. TR11 (2011) - 2010
- [c4]Konstantin Makarychev, Rajsekar Manokaran, Maxim Sviridenko:
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm. ICALP (1) 2010: 594-604
2000 – 2009
- 2009
- [c3]Moses Charikar, Venkatesan Guruswami, Rajsekar Manokaran:
Every Permutation CSP of arity 3 is Approximation Resistant. CCC 2009: 62-73 - [i2]Amit Kumar, Rajsekar Manokaran, Madhur Tulsiani, Nisheeth K. Vishnoi:
On the Optimality of a Class of LP-based Algorithms. CoRR abs/0912.1776 (2009) - [i1]Amit Kumar, Rajsekar Manokaran, Madhur Tulsiani, Nisheeth K. Vishnoi:
On the Optimality of a Class of LP-based Algorithms. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c2]Venkatesan Guruswami, Rajsekar Manokaran, Prasad Raghavendra:
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph. FOCS 2008: 573-582 - [c1]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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-18 20:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
