☰

Sambuddha Roy, Ph.D. - Publications

Affiliations: 
2006 Rutgers University, New Brunswick, New Brunswick, NJ, United States 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

9 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2018 Chakaravarthy VT, Choudhury AR, Gupta S, Roy S, Sabharwal Y. Improved algorithms for resource allocation under varying capacity Journal of Scheduling. 21: 313-325. DOI: 10.1007/S10951-017-0515-3  0.32
2014 Bera SK, Gupta S, Kumar A, Roy S. Approximation algorithms for the partition vertex cover problem Theoretical Computer Science. 555: 2-8. DOI: 10.1016/J.Tcs.2014.04.006  0.355
2011 Chakaravarthy VT, Pandit V, Roy S, Awasthi P, Mohania MK. Decision trees for entity identification: Approximation algorithms and hardness results Acm Transactions On Algorithms. 7. DOI: 10.1145/1921659.1921661  0.343
2011 Allender E, Koucký M, Ronneburger D, Roy S. The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory Journal of Computer and System Sciences. 77: 14-40. DOI: 10.1016/J.Jcss.2010.06.004  0.426
2011 Chakaravarthy VT, Roy S. Arthur and Merlin as Oracles Computational Complexity. 20: 505-558. DOI: 10.1007/S00037-011-0015-3  0.37
2009 Chakaravarthy VT, Roy S. Approximating maximum weight K-colorable subgraphs in chordal graphs Information Processing Letters. 109: 365-368. DOI: 10.1016/J.Ipl.2008.12.007  0.321
2009 Allender E, Barrington DAM, Chakraborty T, Datta S, Roy S. Planar and grid graph reachability problems Theory of Computing Systems. 45: 675-723. DOI: 10.1007/S00224-009-9172-Z  0.616
2009 Braverman M, Kulkarni R, Roy S. Space-Efficient counting in graphs on surfaces Computational Complexity. 18: 601-649. DOI: 10.1007/S00037-009-0266-4  0.392
2007 Roy S, Steiger W. Some combinatorial and algorithmic applications of the borsuk-ulam theorem Graphs and Combinatorics. 23: 331-341. DOI: 10.1007/S00373-007-0716-1  0.316
Show low-probability matches.