Ashbel Smith Professor Emeritus, Computer Science
School of Engineering and Computer Science
Ph. D., University of California, Berkeley,1967
The University of Texas at
Dallas
P. O. Box 830688
Richardson, TX 75083-0688
Phone: (972) 883-2032
Office: ECSN 4.316
E-mail:
This page is under construction.
combinatorial optimization, scheduling, computational geometry, telecommunciations, mathematical programming.
Recent Publications:
“Geometric Problems in Automated Manufacturing”, (with S.N. Kabadi), OPSEARCH, 36, #1, March 1999
"Identifying Alternate Optimal Solutions to the Design Approximation Problem in Stock Cutting", Engineering Optimization, (with J. Bhadury), 31 (1999), pp. 369-392.
"Filtering Objectionable Internet Content," (joint with V. Jacob, R. Krishnan, Y.U. Ryu, and S. Hong) in Proceedings (Refereed) of the 20th International Conference on Information Systems, pp. 274-278, 1999.
"Computational Complexity of Integrated Models of Network Design and Facility Location" (with J. Bhadury and L. Gewali), Southwest Jour. of Pure and Applied Mathematics, July 2000, pp. 30-43.
“Maximizing Residual Flow under Arc Destruction” (with Y.P. Aneja and K.P.K. Nair), Networks, 38, #4, (2001), pp. 194-198.
”Using Linear Programming in a Business-to-Business Auction Mechanism” (with Milind Dawande and J. Kalagnanam), Review of Marketing Science, 1, #4, July 2002.
"Parametric Min-Cuts Analysis in a Network”, Y.P. Aneja, R. Chandrasekaran, K.P.K. Nair, Discrete Applied Mathematics, 127 (2003), 679-689.
“Parametric Overall Min-cut Trees”, Y.P. Aneja, R. Chandrasekaran, K.P.K. Nair), Information Processing Letters, 85 (2003), 105-109.
“Improved Bounds for the On-line Scheduling Problem”, John Rudin, R. Chandrasekaran, SIAM Journal on Computing, 32, (2003), 717-735.
“Scheduling Multiple Parts in a Robotic Cell Served by a Dual Gripper Robot”, C. Sriskandarajah, I. Drobouchevitch, S.P. Sethi, R. Chandrasekaran, Operations Research, 52 (2004), 65-82.
“Minimum Cost System Reliability with Discrete Choice Sets for Components”, Y.P. Aneja, R. Chandrasekaran, K.P.K. Nair, IEEE Transactions on Reliability 53 (2004), 71-76.
“Isotonic Separation”, R. Chandrasekaran, Young Ryu, Varghese Jacob, Sung-Chul Hong, INFORMS Journal on Computing 17, (2005), pp. 462-474
"The multiroute maximum flow problem revisited", D.L. Du and R. Chandrasekaran, Networks, 47 (2005), pp. 81-92
"Multi-Route flows: Cut-trees and realizability" , S.N. Kabadi, R. Chandrasekaran and K.P.K. Nair), Discrete Optimization, 2(2005), #3, pp. 229-240.
``Efficient Minimum-Cost Bandwidth-Constrained Routing in Wireless Sensor Networks'', M. Patel, R. Chandrasekaran, and S. Venkatesan, Special Issue on "Wireless Networks and Pervasive Computing," Journal of Pervasive Computing and Communications (JPCC), to appear.
“Integer Version of the Multi-path Flow Network Synthesis Problem”, S.N. Kabadi, R. Chandrasekaran, K.P.K. Nair, and Y.P. Aneja, Discrete Applied Mathematics (submitted).
“Flows over Edge-Disjoint Mixed Multi-paths and Applications”, Y.P. Aneja, R. Chandrasekaran, K.P.K. Nair, and S.N. Kabadi, Discrete Applied Mathematics (submitted).
“Cutting out polygons”, R. Chandrasekaran, O. Daescu, and J. Luo, Proceedings of 17th Canadian Conference on Computational Geometry, pp. 180-183, August 2005.
“Time-efficient Layer-2 Auto-configuration for Cognitive Radios," S. Kuppa, S. Krishnamurthy, M. Thoppian, S. Venkatesan, R. Chandrasekaran, R. Prakash and N. Mittal, Proceedings of IASTED Conference on Parallel and Distributed Computing and Systems (PDCS 2005), Phoenix, AZ, November 2005, to appear.
“Energy Efficient Sensor, Relay and Base Station Placements for Coverage, Connectivity and Routing," M. Patel, R. Chandrasekaran, and S. Venkatesan, Proceedings of 24th IEEE International Performance, Computing and Communications Conference, Phoenix, AZ, April 2005
Efficient Minimum-Cost Bandwidth-Constrained Routing in Wireless Sensor Networks" , M. Patel, R. Chandrasekaran, and S. Venkatesan, Proceedings of International Conference on Wireless Networks, June 2004
“Highly Efficient Spare Capacity Planning for Generalized Link Restoration" S. Krishnamurthy, M. Dawande and R. Chandrasekaran, and S. Venkatesan, Proceedings of 12th International Conference on Computer Communications and Networks, 2003, IEEE, pp 47--52.
"A Comparative Study of Restoration Schemes and Spare Capacity Assignments in Mesh Networks", M. Patel and R. Chandrasekaran and S. Venkatesan, Proceedings of 12th International Conference on Computer Communications and Networks, 2003, IEEE, pp 399--404 (Nominated for the best paper award).
Current Research: