| Decision trees for entity identification: Approximation algorithms and hardness results VT Chakaravarthy, V Pandit, S Roy, P Awasthi, M Mohania Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on …, 2007 | 113* | 2007 |
| Planar and grid graph reachability problems E Allender, DA Mix Barrington, T Chakraborty, S Datta, S Roy Theory of Computing Systems 45 (4), 675-723, 2009 | 65 | 2009 |
| Response of summer sesame (Sesamum indicum) to irrigation, row spacing and plant population. DK Majumdar, SK Roy | 64 | 1992 |
| The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory E Allender, M Koucký, D Ronneburger, S Roy Journal of Computer and System Sciences 77 (1), 14-40, 2011 | 54 | 2011 |
| The directed planar reachability problem E Allender, S Datta, S Roy FSTTCS 2005: Foundations of Software Technology and Theoretical Computer …, 2005 | 38 | 2005 |
| The Directed Planar Reachability Problem E Allender, S Datta, S Roy FSTTCS 2005, 0 | 38* | |
| Approximating decision trees with multiway branches VT Chakaravarthy, V Pandit, S Roy, Y Sabharwal International Colloquium on Automata, Languages, and Programming, 210-221, 2009 | 29 | 2009 |
| Improved algorithms for resource allocation under varying capacity VT Chakaravarthy, AR Choudhury, S Gupta, S Roy, Y Sabharwal European symposium on algorithms, 222-234, 2014 | 23 | 2014 |
| Some combinatorial and algorithmic applications of the Borsuk–Ulam theorem S Roy, W Steiger Graphs and Combinatorics 23, 331-341, 2007 | 23 | 2007 |
| Oblivious symmetric alternation V Chakaravarthy, S Roy STACS 2006, 230-241, 2006 | 23 | 2006 |
| Improvement of reproductive performances of Black Bengal goat through selection under field condition. KC Dhara, N Ray, S Roy, AK Samanta, PK Senapati | 22 | 2008 |
| Derandomization and distinguishing complexity E Allender, M Koucky, D Ronneburger, S Roy 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings …, 2003 | 22 | 2003 |
| Approximation algorithms for the partition vertex cover problem SK Bera, S Gupta, A Kumar, S Roy Theoretical Computer Science 555, 2-8, 2014 | 19 | 2014 |
| Extracting dense communities from telecom call graphs V Pandit, N Modani, S Mukherjea, AA Nanavati, S Roy, A Agarwal 2008 3rd International Conference on Communication Systems Software and …, 2008 | 18 | 2008 |
| Approximating maximum weight K-colorable subgraphs in chordal graphs VT Chakaravarthy, S Roy Information processing letters 109 (7), 365-368, 2009 | 13 | 2009 |
| Effective decision support systems for workforce deployment V Chenthamarakshan, K Dixit, M Gattani, M Goyal, P Gupta, N Kambhatla, ... IBM Journal of Research and Development 54 (6), 5: 1-5: 15, 2010 | 11 | 2010 |
| Effective decision support for workforce deployment service systems K Dixit, M Goyal, P Gupta, N Kambhatla, RM Lotlikar, D Majumdar, ... 2009 IEEE International Conference on Services Computing, 104-111, 2009 | 11 | 2009 |
| Arthur and Merlin as oracles VT Chakaravarthy, S Roy computational complexity 20 (3), 505-558, 2011 | 10 | 2011 |
| Topology inside NC1 E Allender, S Datta, S Roy Computational Complexity, 2005. Proceedings. Twentieth Annual IEEE …, 2005 | 10* | 2005 |
| Parity problems in planar graphs M Braverman, R Kulkarni, S Roy Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07 …, 2007 | 9 | 2007 |
Venkatesan ChakaravarthyIBM Research, Bangalore在 in.ibm.com 的电子邮件经过验证
