Sambuddha Roy

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2011
33Decision trees for entity identification: Approximation algorithms and hardness results. Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Pranjal Awasthi, Mukesh K. Mohania. ACM Transactions on Algorithms (7): 15 (2011). Web SearchBibTeXDownload
32Scheduling Resources for Throughput Maximization. Venkatesan T. Chakaravarthy, Amit Kumar, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal. APPROX-RANDOM 2011, 111-122. Web SearchBibTeXDownload
31Arthur and Merlin as Oracles. Venkatesan T. Chakaravarthy, Sambuddha Roy. Computational Complexity (20): 505-558 (2011). Web SearchBibTeXDownload
30Approximation Algorithms for Edge Partitioned Vertex Cover Problems. Suman Kalyan Bera, Shalmoli Gupta, Amit Kumar, Sambuddha Roy. CoRR (abs/1112.1945) (2011). Web SearchBibTeXDownload
29Resource Allocation for Covering Time Varying Demands. Venkatesan T. Chakaravarthy, Amit Kumar, Sambuddha Roy, Yogish Sabharwal. ESA 2011, 543-554. Web SearchBibTeXDownload
28VMSpreader: Multi-tier application resiliency through virtual machine striping. Pradipta De, Sambuddha Roy. Integrated Network Management 2011, 185-192. Web SearchBibTeXDownload
27Contact Center Scheduling with Strict Resource Requirements. Aman Dhesi, Pranav Gupta, Amit Kumar, Gyana R. Parija, Sambuddha Roy. IPCO 2011, 156-169. Web SearchBibTeXDownload
26Minimum Cost Resource Allocation for Meeting Job Requirements. Venkatesan T. Chakaravarthy, Gyana R. Parija, Sambuddha Roy, Yogish Sabharwal, Amit Kumar. IPDPS 2011, 14-23. Web SearchBibTeXDownload
25The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory. Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy. J. Comput. Syst. Sci. (77): 14-40 (2011). Web SearchBibTeXDownload
2010
24Finding Independent Sets in Unions of Perfect Graphs. Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal. FSTTCS 2010, 251-259. Web SearchBibTeXDownload
23Effective decision support systems for workforce deployment. Vijil Chenthamarakshan, Kashyap Dixit, M. Gattani, Munish Goyal, Pranav Gupta, Nanda Kambhatla, Rohit Lotlikar, Debapriyo Majumdar, Gyana R. Parija, Sambuddha Roy, Soujanya Soni, Karthik Visweswariah. IBM Journal of Research and Development (54): 5 (2010). Web SearchBibTeXDownload
22Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. Samir Datta, Raghav Kulkarni, Sambuddha Roy. Theory Comput. Syst. (47): 737-757 (2010). Web SearchBibTeXDownload
2009
21Space-Efficient Counting in Graphs on Surfaces. Mark Braverman, Raghav Kulkarni, Sambuddha Roy. Computational Complexity (18): 601-649 (2009). Web SearchBibTeXDownload
20Arthur and Merlin as Oracles. Venkatesan T. Chakaravarthy, Sambuddha Roy. Electronic Colloquium on Computational Complexity (ECCC) (16): 55 (2009). Web SearchBibTeXDownload
19The Pervasive Reach of Resource-Bounded Kolmogorov Complexity in Computational Complexity Theory. Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy. Electronic Colloquium on Computational Complexity (ECCC) (16): 51 (2009). Web SearchBibTeXDownload
18Approximating Decision Trees with Multiway Branches. Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal. ICALP (1) 2009, 210-221. Web SearchBibTeXDownload
17Effective Decision Support for Workforce Deployment Service Systems. Kashyap Dixit, Munish Goyal, Pranav Gupta, Nanda Kambhatla, Rohit Lotlikar, Debapriyo Majumdar, Gyana R. Parija, Sambuddha Roy, Soujanya Soni. IEEE SCC 2009, 104-111. Web SearchBibTeXDownload
16Approximating maximum weight K-colorable subgraphs in chordal graphs. Venkatesan T. Chakaravarthy, Sambuddha Roy. Inf. Process. Lett. (109): 365-368 (2009). Web SearchBibTeXDownload
15Planar and Grid Graph Reachability Problems. Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy. Theory Comput. Syst. (45): 675-723 (2009). Web SearchBibTeXDownload
2008
14Extracting dense communities from telecom call graphs. Vinayaka Pandit, Natwar Modani, Sougata Mukherjea, Amit Anil Nanavati, Sambuddha Roy, Amit Agarwal. COMSWARE 2008, 82-89. Web SearchBibTeXDownload
13Arthur and Merlin as Oracles. Venkatesan T. Chakaravarthy, Sambuddha Roy. MFCS 2008, 229-240. Web SearchBibTeXDownload
12Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. Samir Datta, Raghav Kulkarni, Sambuddha Roy. STACS (abs/0802.2850): 229-240 (2008). Web SearchBibTeXDownload
11Finding Irrefutable Certificates for S2p via Arthur and Merlin. Venkatesan T. Chakaravarthy, Sambuddha Roy. STACS 2008, 157-168. Web SearchBibTeXDownload
2007
10Parity Problems in Planar Graphs. Mark Braverman, Raghav Kulkarni, Sambuddha Roy. IEEE Conference on Computational Complexity 2007, 222-235. Web SearchBibTeXDownload
9Decision trees for entity identification: approximation algorithms and hardness results. Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Pranjal Awasthi, Mukesh K. Mohania. PODS 2007, 53-62. Cited by 13Web SearchBibTeXDownload
2006
8Grid Graph Reachability Problems. Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy. IEEE Conference on Computational Complexity 2006, 299-313. Web SearchBibTeXDownload
7Oblivious Symmetric Alternation. Venkatesan T. Chakaravarthy, Sambuddha Roy. STACS 2006, 230-241. Web SearchBibTeXDownload
2005
6Grid Graph Reachability Problems. Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy. Electronic Colloquium on Computational Complexity (ECCC) 2005. Web SearchBibTeXDownload
5The Directed Planar Reachability Problem. Eric Allender, Samir Datta, Sambuddha Roy. FSTTCS 2005, 238-249. Web SearchBibTeXDownload
4Topology Inside NC¹. Eric Allender, Samir Datta, Sambuddha Roy. IEEE Conference on Computational Complexity 2005, 298-307. Web SearchBibTeXDownload
2004
3Topology inside NC1. Eric Allender, Samir Datta, Sambuddha Roy. Electronic Colloquium on Computational Complexity (ECCC) 2004. Web SearchBibTeXDownload
2003
2Derandomization and Distinguishing Complexity. Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy. IEEE Conference on Computational Complexity 2003, 209-220. Web SearchBibTeXDownload
2001
1Time-Space Tradeoffs in the Counting Hierarchy. Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay. IEEE Conference on Computational Complexity 2001, 295-302. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research