Selected Publications

2013

  • K. Khodamoradi, R. Krishnamurti, A. Rafiey, G. Stamoulis. PTAS for Ordered Instances of Resources Allocation. FSTTCS, 2013 (to appear). (PDF)
  • A. Karmakar, S. Das, S. C. Nandy, B. K. Bhattacharya. Some Variations on Constrained Minimum Enclosing Circle Problem. J. Comb. Optim., 25(2): 176-190, 2013.
  • B. K. Bhattacharya, S. Chakraborty, E. Iranmanesh, R. Krishnamurti. The Cyclical Scheduling Problem. WALCOM, 217-232, 2013.
  • P. Berenbrink, K. Khodamoradi, T. Sauerwald and A. Stauffer. Balls-into-Bins with Nearly Optimal Load Distribution. SPAA, 2013.

2012

  • R. Benkoczi, B. K. Bhattacharya, Y. Hu, C.-H. Lin, Q. Shi, B.-F. Wang. Efficient Algorithms for the Conditional Covering Problem. Inf. Comput., 219: 39-57, 2012.
  • P. Jula, A. Rafiey. Coordinated Scheduling of a Single Machine with Sequence Dependent Setup Times and Time Window Constraints. Int. Journal of Production Research, 50 (8) :2304-2320, 2012.
  • P. Hell, M. Mastrolilli, M. Nevisi, and A. Rafiey. Approximation of Minimum Cost Homomorphisms. ESA, 2012.
  • B. K. Bhattacharya, Y. Hu. k-delivery Traveling Salesman Problem on Tree Networks. FSTTCS, 325-336, 2012.
  • Cong Wang, Andrei A. Bulatov. Greedy Algorithms, Ordering of Variables, and d-degenerate Instances. ISMVL, 31-36, 2012.

2011

  • Daya Ram Gaur, Ramesh Krishnamurti, Rajeev Kohli. Erratum to: The Capacitated Max k-cut Problem. Math. Program., 126(1): 19, 2011.
  • Pengpeng Wang, Kamal Gupta, Ramesh Krishnamurti. Some Complexity Results for Metric View Planning Problem With Traveling Cost and Visibility Range. IEEE T. Automation Science and Engineering, 8(3): 654-659, 2011.
  • Somsubhra Sharangi, Ramesh Krishnamurti, Mohamed Hefeeda. Energy-Efficient Multicasting of Scalable Video Streams Over WiMAX Networks. IEEE Transactions on Multimedia, 13 (1): 102-115, 2011.

2010

  • C.Thachuk, J. Manuch, A.Rafiey, L. Mathieson, L. Stacho, A.Condon. An Algorithm for the Energy Barrier Problem Without Pseudoknots and Temporary Arcs. Pacific Symposium on Biocomputing, 108-119. 2010.
  • Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta. Generalized Watchman Route Problem with Discrete View Cost. Int. J. Comput. Geometry Appl., 20 (2): 119-146 ,2010.

2009

  • B. K. Bhattacharya, Q. Shi, A. Tamir. Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees. Algorithmica, 55(4): 601-618, 2009.
  • Gupta, A. Khodabakhshi, J. Manuch, and A. Rafiey. Inverse Protein Folding in 3D Hexagonal Prism Lattice under HP Model. J. Computational Biology, 769-802, 2009.
  • Daya Ram Gaur, Ramesh Krishnamurti, Rajeev Kohli. Conflict Resolution in the Scheduling of Television Commercials. Oper. Res., 57 (5): 1098-1105, 2009.
  • Salimur Choudhury, Daya Ram Gaur, Ramesh Krishnamurti. An Approximation Algorithm for Max k-Uncut with Capacity Constraints. CSO (2) : 934-938, 2009.

2008
  • A. Mukhopadhyay, C. Kumar, E. Greene, B. K. Bhattacharya. On Intersecting a Set of Parallel Line Segments with a Convex Polygon of Minimum Area. Inf. Process. Lett., 105(2): 58-64, 2008.
  • B. K. Bhattacharya, P. Carmi, Y. Hu, Q. Shi. Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times. ISAAC , 800-811, 2008.
2007

  • Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta. Generalized Watchman Route Problem with Discrete View Cost. CCCG, 241-244, 2007.

2006

  • G. Gutin, A. Rafiey, M.Tso , A.Yeo. Level of Repair Analysis and Minimum Cost Homomorphism of Graphs. Discrete Applied Math, 154, 881-889, 2006.
  • Daya Ram Gaur, Ramesh Krishnamurti, Ján Manuch. Improved Approximation Algorithm for Scheduling Tasks with a Choice of Start Times. ACiD, 85-94, 2006.

2005

  • G. Gutin, N.Jones, A. Rafiey, S.Severini, A.Yeo. Mediated Digraphs and Quantum Nonlocality. Discrete Applied Math, 150, 41-50, 2005.