advertisement

i VITA R.CHANDRASEKARAN EDUCATION Ph.D. in Operations Research, University of California, Berkeley, 1967. B. Tech. (Hons with Distinction) in Mechanical Engineering, Indian Institute of Technology, Bombay, India, 1963. HONORS Merit Scholarship (given to top ten students at IIT, Bombay), 1960-62. Nominated for Piper Teaching Award from the University of Texas at Dallas, 1980. Gurudas Chatterjee Award given by Operations Research Society of India, 1983. Polykarp Kusch Lecturer, 1986-87. Nominated for the George B. Dantzig Prize in Mathematical Programming, 1988. Ashbel Smith Professor, UT Dallas, 1997Dr. M.C. Puri Memorial Award for Life Time achievement given by Operational Research Society of India, 2011 EXPERIENCE Academic: . School of Engineering and Computer Science – The University of Texas at Dallas, P. O. Box 830688, Richardson, Texas 75083-0688. Ashbel Smith Professor of Computer Science, 1999-Present Interim Dean, 2002-3 School of Management – The University of Texas at Dallas. Ashbel Smith Professor, Operations Research 1997-2002; 2006-Present ii Professor, Operations Research, 1981-1997 Associate Professor, Operations Research, 1975-81. Department of Operations Research, Case Western Reserve University, 1969-75. Associate Professor, Operations Research, 1972-75. Assistant Professor, Operations Research, 1969-72. Instructor, University of California, Berkeley, 1967. Industrial:. Consultant, Banking Systems International, Inc. – Reno, Nevada, 197275. Scientist/Consulting Staff, Optimum Systems, Inc. – Palo Alto, California, 1967-69. Consultant, MCI, 1995-1997 Consultant, BNR/Nortel, 1995-1999 Consultant, Qtera/Nortel, 1997-2000 Consultant, Yottanetworks, 2000-2002 Visiting Appointments:. Visiting Professor, Department of Statistics and Operations Research, Tel Aviv University, December 1981. Visiting Professor, MEDS Department, School of Management, Northwestern University, 1978-79. Lecturer, Indian Statistical Institute, Calcutta, India, October-December,1966. PUBLICATIONS (Includes Refereed Conference Proceedings): “Optimal Strategies of Fire Fighting by Firebreaks” (with R. W. Shephard), Proceedings of Fourth International Conference on Operations Research, MIT, 1966. “Total Unimodularity of Matrices,” SIAM Journal on Applied Mathematics, pp. 1032-1034, November 1969. “A Special Case of the Complementarity Problem,” OPSEARCH, pp. 263268, December 1970. “Sequential Games” (with D. A. Kohler), Operations Research, pp. 270277. May 1971. iii “Optimal Location of Service Centers of Certain Types” (with K.P.K. Nair), Naval Research Logistics Quarterly, pp. 503-510, December 1971. “An Algorithm for Discounted Stochastic Games” (with K.P.K. Nair and S. Subba Rao), Journal of Optimization Theory and Applications, pp. 627-637, July 1973. “Service Partitioning to Minimize Mean Flow Time” (with H. Emmons and S. Subba Rao), Proceedings of the XX th International Meeting of TIMS (refereed), pp. 480-484, 1973. “Order Preserving Allocations of Jobs to Two Machines” (with S. Mehta and H. Emmons), Naval Research Logistics Quarterly, pp. 361-364, 1974. “Row Generalized Linear Program,” OPSEARCH, pp. 28-34, March 1974. “Markov Ratio Decision Processes” (with V. Aggarwal and K.P.K. Nair), Journal of Optimization Theory and Applications, Vol. 21, No. 1, pp. 27-37, 1977. “A Special Case of the Transportation Problem” (with S. Subba Rao), Operations Research, Vol. 25, pp. 525-528, 1977. “Minimal Ratio Spanning Trees,” Networks, Vol. 7, pp. 335-342, 1977. “Optimal Policies for Burn-In Procedures,” OPSEARCH, Vol. 14, pp. 149-160, 1977. “Local Unimodularity of Matrix Vector Pairs” (with K. Truemper), Linear Algebra and Its Applications, Vol. 22, pp. 65-78, 1978. ”Critical Path Problem under Assignment Constraint — An Application of Extreme Point Mathematical Programming Problem” (with S. Kumar and D. Wagner), Journal of Information and Optimization Sciences, Vol 1, pp. 41-51, 1980 “Discounted Stochastic Ratio Games” (with V. Aggarwal and K.P.K. Nair), SIAM Journal on Applied Mathematics: Algebraic and Discrete Methods, Vol. 1, pp. 201-210, 1980. “Nonterminating Stochastic Ratio Games” (with V. Aggarwal and K.P.K. Nair), Revue Automatique Informatique Recherche Operationelle, Vol. 14, pp. 21-30, 1980. “0((n log p)2 ) Algorithms for the Continuous p-Centre Problem on a Tree” (with A. Tamir), SIAM Journal on Applied Mathematics: Algebraic and Discrete Methods, Vol. 1, pp. 370-375, 1980. iv “Weighted Min-Max and Max-Min Location Problems: Finite and Polynomially Bounded Algorithms” (with M.J. A.P. Pacca), OPSEARCH, Vol. 17, pp. 172-180, 1980. “Problems of Location on Trees” (with A. Daughety), Mathematics of Operations Research, Vol. 6, pp. 40-57. 1981. “An 0(n log2 n) Algorithm for the Longest Path in a Tree with Applications to Location Problems” (with N. Megiddo, A. Tamir, and E. Zemel), SIAM Journal on Computing, Vol. 10, pp. 328-337, 1981. “Polynomial Algorithms for Totally Dual Integral Systems and Extensions,” Annals of Discrete Math., Vol. 11, pp. 39-52, (1981). “Minimum Cost to Reliability Ratio Trees” (with Y. Aneja and K.P.K. Nair), Annals of Discrete Math., Vol. 11, pp. 53-60, 1981. “Polynomially Bounded Algorithms for Locating p-Centres on a Tree” ( with A. Tamir), Mathematical Programming, Vol. 22, pp. 304-315, 1982. “Some NP-Complete Problems in Linear Programming” (with S. Kabadi and K.G. Murty), Operations Research Letters, Vol. 1, pp. 101-104, 1982. “The Weighted Euclidean 1-Center Problem,” Operations Research Letters, Vol. 1, pp. 111-112, 1982. “Integer Programming Problems for which a Simple Rounding Type Algorithm Works” (refereed), Proceedings of the Silver Jubilee Conference on Combinatorics, Waterloo (refereed), Ontario, Canada, 1982. “Monotone Optimal Issuing Policies in a Deterministic Inventory Model,” Operations Research, Vol. 31, pp. 591-595, 1983. “Total Weak Unimodularity: Testing and Applications” (with S. Shirali), Discrete Mathematics, Vol. 51, pp. 137-145, 1984. “Production Planning in Assembly Line System” (with Y. Aneja and K.P.K. Nair), Management Science, Vol. 30, pp. 713-719, 1984. “Polynomial Testing of the Query ”Is ab ≥ cd ” with Application to Finding a Minimal Cost Reliability Ratio Spanning Tree” (with A. Tamir), Discrete Applied Mathematics, Vol. 9, pp. 117-123, 1984. “On the Integrality of an Extreme Solution to Pluperfect Graph and Balanced Systems” (with A. Tamir), Operations Research Letters, Vol. 3, pp. 214-248, 1984. v “Optimization Problems with Algebraic Solutions: Quadratic Fractional Programs and Ratio Games” (with A. Tamir), Math. Programming, Vol. 30, pp. 326-339, 1984. “Linear Complementarity Problems Solvable by a Polynomially Bounded Pivoting Algorithm” (with J. S. Pang), Math. Programming Studies, 25, pp. 13-27 1985. “Classes of Linear Programs with Integral Solution” (with Y. Aneja and K.P.K. Nair), Math. Programming Studies, 24, pp. 225-237, 1985. “Optimal Improvements to Bottleneck Systems,” OPSEARCH, Vol. 22, pp. 121-128, 1985. “Recognition of the Gomory-Gilmore Type of Traveling Salesman Problem,” Discrete Applied Mathematics, 14, 1986. “Strongly Polynomial Algorithm for a Class of Combinatorial LCPs” (with S. Kabadi), Operations Research Letters, Vol. 6, No. 2, pp. 91-92, May 1987. “Two Counter Examples on the Polynomial Solvability of the Linear Complementarity problem” (with J.S. Pang and R.E. Stone), Mathematical Programming, 39, pp 21-26, (1987). “Integration of Sample Surveys is NP-Complete” (with S.N. Kabadi and K.P.K. Nair), Sankhya Series B 49(3), (1988). “A Note on the m-Center Problem with Rectilinear Distance” (with K.P.K. Nair and Y. Aneja), Europ. J. of Operations Research, 35, pp 118-123, (1988). “Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic” (with R. Plante and T.J. Lowe), Operations Research 35, pp 772-783, (1988). “Pseudomatroids” (with S.N. Kabadi), Discrete Mathematics, 71, (1988), 205-217. “Open Questions Concerning Weiszfeld’s Algorithm for the Fermat – Weber Location”, (joint with A.Tamir), Mathematical Programming, 44, #3, (1989), 293-296. “On the ǫ-perturbation Method for Avoiding Degeneracy” (with N. Megiddo), O.R. Letters, 8, #6, Dec 1989, 305-308. “Algebraic Optimization: The Fermat – Weber Location Problem,” (joint with A. Tamir), Mathematical Programming, 46, #2, (1990), 219-224. vi “On Totally Dual Integral Systems” (with S. Kabadi), Discrete Applied Mathematics, 26, #1, Jan 1990, 87-104. “Solvable Classes of Generalized Traveling Salesman Problem,” (refereed) Proceedings of DIMACS, pp. 49-60, 1990. “Tree Traveling Salesman Problem” (with S.N. Kabadi) (refereed) Proceedings of the Second Canadian Conference on Computational Geometry, 1990. “A Problem in Computer Vision that is Polynomially Solvable” (with S. Kabadi and S.L. Narasimhan) , OPSEARCH, 28, 1991, pp 125-130. “Integer Solution of Synthesis of Communication Network” (with S. Sridhar). (Refereed) Proceedings of the First Conference on Integer Programming and Combinatorial Optimization; also in Mathematics of Operations Research, August 1992, pp 581-585. “A Rounding Algorithm for Integer Programs” (with S. Lakshminarayanan), Discrete Applied Mathematics, 50, (1994)#3, pp 267-282. “Competitive Location and Entry Deterrence in Hotelling,s Duopoly Model” (with J. Bhadury and V. Padmanabhan), Location Science, Vol. 2, #4 (1994), pp. 259-275. “Stock Cutting of Complicated Designs by Computing Minimal Nested Polygons”, (with J. Bhadury), Engineering Optimization, 25 (1995), pp. 165-178. “Stock Cutting to Minimize Sequence Length” (with J. Bhadury), European Journal of O.R., 88, (1996), pp.69-87. “Tessellation and g-Tessellation of Circulants, Q6 , and Qt6 ” (with S.Lakshminarayanan), Linear Algebra and its Applications, 245, (1996), pp. 191-222. “An Extension of a Theorem of Fulkerson and Gross” (with S. Lakshminarayanan and S.N. Kabadi), Linear Algebra and its Applications, 246 (1996), pp. 23-29. ”Location Problems with Visibility Constraints” (with V. Chandru, J. Bhadury, and A. Maheshwari), Proceedings of Seventh International Symposium on Locational Decisions, ISOLDE VII, University of Alberta, Edmonton, June 1996. “Finding the Set of all Minimal Nested Convex Nested Polygons”, (with J. Bhadury), (Refereed) Proceedings of the Eighth Canadian Conference on Computational Geometry, pp 26-31, Carleton University, Ottawa, August, 1996. vii “Art Gallery Problems for Convex Nested Polygons”, (with J. Bhadury, V. Chandru, and A. Maheshwari), INFORMS Journal of Computing, 9, (1997), #1, pp 100-110. “A Note on On-line Algorithms with a Performance Ratio less than 2 − (1/m)” (with P.R. Narayanan, Bo Chen, Andre van Vliet, G. Woeginger,Gabor Galambos) SIAM Jour. on Computing, 26, (1997), #3, pp. 870-872. “Integral Solutions for the Linear Complementarity Problem” (with S.N. Kabadi, and R. Sridhar), Mathematics of Operations Research, 23, (1998), #2, pp. 390-402. ”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. ”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. ”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. ”Disease Prognosis with an Isotonic Prediction Technique,” (joint with Y.U. Ryu, and V. Jacob) in Proceedings (Refereed) of the 9th Workshop on Information Technologies and Systems, pp. 26-31, 1999; accepted for publication in Management Science. ”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”, (with Y.P. Aneja and K.P.K. Nair), Discrete Applied Mathematics, 127, (2003), pp. 679689. ”Parametric analysis of overall min-cuts and applications in undirected networks” (with Y.P. Aneja and K.P.K. Nair), Information Processing Letters, 85, (2003), pp. 105-109. “Improved Bounds for the On-line Scheduling Problem”, (with John Rudin), SIAM Journal on Computing, 32, (2003), pp. 717-735. viii “Highly Efficient Spare Capacity Planning for Generalized Link Restoration”, (with S. Krishnamurthy, M. Dawande 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”, (with M. Patel and S. Venkatesan), Proceedings of 12th International Conference on Computer Communications and Networks, 2003, IEEE, pp 399—404 (Nominated for the best paper award). “Minimum Cost System Reliability with Discrete Choice Sets for Components” (with K.P.K. Nair and Y.P. Aneja), IEEE Transactions on Reliability 53, (2004), pp. 71 —76. . “Scheduling Multiple Parts in a Robotic Cell Served by a Dual Gripper Robot”, (with C. Sriskandarajah, I. Drobouchevitch, and S.P. Sethi), Operations Research, 52, (2004), pp. 65-82. ”Disease Prognosis Using an Isotonic Prediction Technique”, (with Young Ryu, and Varghese Jacob), Management Science, 50, #6, (June 2004), pp. 777-785. “Multi-path Multi-terminal Flow Synthesis” (with K.P.K. Nair, Y.P. Aneja, and S.N. Kabadi), Discrete Applied Mathematics, 143 (2004), pp. 182-193. ”Efficient Minimum-Cost Bandwidth-Constrained Routing in Wireless Sensor Networks” , (with M. Patel, and S. Venkatesan), Proceedings of International Conference on Wireless Networks, June 2004 “Isotonic Separation”, (with Young Ryu, Varghese Jacob, and Sung-Chul Hong) INFORMS Journal on Computing, 17, (2005), pp. 462-474. ”Multi-Route flows: Cut-trees and realizability” (with S.N. Kabadi and K.P.K. Nair), Discrete Optimization, 2(2005), #3, pp. 229-240. ”The multiroute maximum flow problem revisited” (with D.L. Du), Networks, 47 (2006), pp. 81-92 “Cutting out polygons”, (with 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,”, (with S. Kuppa, S. Krishnamurthy, M. Thoppian, S. Venkatesan, R. Prakash and N. Mittal), Proceedings of IASTED Conference on Parallel and Distributed Computing and Systems (PDCS 2005), Phoenix, AZ, November 2005, Computer Networks, 52 (#4), pp. 831-849, (2008). ix “Energy Efficient Sensor, Relay and Base Station Placements for Coverage, Connectivity and Routing,” , (with M. Patel, and S. Venkatesan), Proceedings of 24th IEEE International Performance, Computing and Communications Conference, Phoenix, AZ, April 2005 “Flows over Edge-Disjoint Mixed Multi-paths and Applications” (with Y.P. Aneja, K.P.K. Nair, and S.N. Kabadi) , Discrete Applied Mathematics, 155, pp. 1979-2000, (2007). “Efficient Minimum-Cost Bandwidth-Constrained Routing in Wireless Sensor Networks” , (with M. Patel, and S. Venkatesan), Special Issue on ”Wireless Networks and Pervasive Computing,” Journal of Pervasive Computing and Communications (JPCC), 2, # 2, 2006. “The Maximum Residual Flow Problem: NP-hardness with Two-arc Destruction”, D.Du and R. Chandrasekaran, Networks, 50, (3), pp. 181182, (2007) “Improved Quasi-path Restoration in Mesh Networks”, M. Patel, R. Chandrasekaran, and S. Venkatesan, IEEE/ACM Transactions on Networking, 16, # 1 (2008), pp 143—155. “MAC-layer Scheduling in Cognitive Radio based Multi-hop Wireless Networks”, Mansi Thoppian, S. Venkatesan, R. Praksah, R. Chandrasekaran, IEEE Symposium on a World of Wireless, Mobile, and Multimedia Networks, 2006 ”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, 156 (November 2008), pp. 3376-3399 . “A Polynomial Time Solution to Minimum Forwarding Set Problem in Wireless Adhoc Networks” (M. Baysan, K. Sarac, R. Chandrasekaran, S. Bereg), IEEE Transactions on Parallel and Distributed Systems, 20 (2009), # 7, pp. 913-924. ”Neighbor discovery in multi-receiver cognitive radio networks,” (S. Krishnamurthy, N. Mittal, R. Chandrasekaran, and S. Venkatesan), International Journal of Computers and Applications, 31 (2009) #1, pp. 50-57. “On Neighbor Discovery in Multi-Channel Cognitive Radio Networks”, Neeraj Mittal, Srinivasan Krishnamurthy, R. Chandrasekaran, S. Venkatesan and Yanyan Zeng , Journal of Parallel and Distributed Computing (JPDC), 69 (2009), #7, pp. 623-637. x “Structural Analysis of a Fractional Matching Problem”, R. Chandrasekaran and M. Dawande, Discrete Applied Mathematics, 157 (2009), #18, pp. 3708-3720. “A Combinatorial Algorithm for Horn Programs”, R. Chandrasekaran and K. Subramani, 20th International Symposium on Algorithms and Computation, 2009, LNCS 5878, Y. Dong et al editors. ”Minimum Energy Strong Bidirectional Topology for Ad Hoc Wireless Sensor Networks”, (with Y.P. Aneja, A. Bari, A. Jaekel, and K.P.K. Nair), ICC 2009: 1-5 ”2-Commodity Integer Network Synthesis Problem”, (with S.N. Kabadi and K.P.K. Nair), Algorithmic Operations Research 4(2), (2009), pp. 117-132. ” A branch-and-cut algorithm for the strong minimum energy topology in wireless sensor networks”, (with Y.P Aneja, X. Li, K.P.K. Nair), EJOR 204, (2010), pp. 604-612. ”Fast Neighborhood Discovery with Lightweight Termination Detection in Heterogeneous Cognitive Radio Networks”, (with Y.Zeng, N. Mittal, S. Venkatesan), ISPDC (2010), pp 149-156. ”Minimal Time Broadcasting in Cognitive Radio Networks”, (with C.L. Arachchige, S. Venkatesan, N. Mittal), ICDCN (2011), pp. 364-375. ”Randomized Distributed Algorithms for Neighbor Discovery in MultiHop Multi-Channel Heterogeneous Wireless Networks”, (with Neeraj Mittal, Yanyan Zeng, S. Venkatesan), ICDCS 2011. ”On Labeling Problems in Graphs” (with M. Dawande and M. Baysan), Discrete Applied Mathematics, 159, (2011), pp.746-759.. “Relay Assignment in AMT-based Multicast Content Distribution”, S. Patel, K. Sarac, N. Mittal, Ninth Annual Conference on Communication Networks and Services Research, 2011 ”Polynomial Time Solution to Minimum Forwarding Set Problem in Wireless Networks under Disk Coverage Model” , (with M. Baysan, K. Sarac), Adhoc Networks, 10, (2012) #7, pp.1253-1266. ”A combinatorial algorithm for Horn Programs”, K. Subramani and R. Chandrasekaran, accepted for publication in Discrete Optimization. US Patents Awarded: US Patent # 7,106,697: “Method for dynamically computing a switching schedule”, R.E. Best, R. Chandrasekaran, J.R. Rudin III, R.Q. Hu, J.L. Watson, L. Tamil, A. Fabri, September 12, 2006 xi US Patent # 7,190,900 B1: “System and Method for Implementing Dynamic Scheduling of Data in a Non-blocking All-Optical Switching Network”, R.E. Best, R. Chandrasekaran, J.R. Rudin III, R.Q. Hu, J.L. Watson, L. Tamil, A. Fabbri, March 13, 2007 US Patent # 7,218,637 B1: “System for Switching Data Using Dynamic Scheduling”, R.E. Best, R. Chandrasekaran, J.R. Rudin III, R.Q. Hu, J.L. Watson, L. Tamil, A. Fabbri, May 15, 2007 Current Work: ”The maximum residual flow problem: NP-hardness with two arc destruction” (with D.L. Du) ”Two commodity multiroute maximum flow problems” (with D.L. Du) “2-Commodity Integer Network Synthesis Problem” (with S.N. Kabadi and K.P.K. Nair), submitted to Algorithmica. “Design of Fault Tolerant Networks” (with R. E. Best). ”On-line Algorithms for Parallel Machine Scheduling” (with John Rudin III) ”Special Multi-commodity Flow Problems” (with Rajesh Jagannathan) ”Half integrality in LP” (joint with G. Appa and S.N. Kabadi) ”Strongly Polynomial Algorithms in General” (with S.N. Kabadi) ”Towards a Farkas type result in integer programming” ”Graph Labeling: Part I: Trees”, (with M. Baysan, and M. Dawande) ”Graph labeling: Part II: General Graphs”, (with M. Baysan and M. Dawande) “Graph Labeling: III” (with M. Dawande) Unpublished Work:. ”SONET Network Design” (with J. Huang and Sri Nathan) “Optimal Ordering Policies for a Capacity Constrained Two-item Inventory System” (with A. Mukhopadhyay and Ping Yang). “Optimal Ordering Policies for a Capacity Constrained Multi-item Inventory System” (with A. Mukhopadhyay and Ping Yang). “Capacity Constrained Multi-item Inventory System with Finite Production Rate” (with A. Mukhopadhyay and Ping Yang). xii “A Polynomial Algorithm for ǫ-optimal Strategies in a Stochastic Game”. “Decision Rule for Uncertainty Resolution and Optimal Ordering with Sources of Imperfect Information” (with K. C. Seal), being revised. ”Optimal On-line Algorithms for Uniform Processor System with m ≥ 3” (with P.R. Narayanan) “Information Acquisition: Models and Algorithms” (with K. C. Seal) “Synthesis of Directed Communication Networks” (with S. Sridhar). “Finding Convex Hulls in 2 − D”. “Synthesis Problems with Degree Based Cost Functions” (with S. Sridhar) “Multilevel Assignment Problem” (with S. Geetha and K.P.K. Nair). “Recognition of Polygons in Two Dimension” (with S.L.Narasimhan). “Scaling of P -matrices to P.D−Matrices”. “Recognition of Convex Polyhedral Objects” (with S.L. Narasimhan). “Associative Storage and Retrieval of Information” (with P. Mukherjee). “A Genuinely Polynomial Algorithm for the Max-Flow Problem on Regular Matroids” (with S. Kabadi), 1985. “On a Class of Quota Restricted Admission Policies” (with R. Oliver), presented as an invited paper at ORSA/TIMS Meeting in San Francisco, November 1969. “A Special Linear Program,” Technical Memo 208, Department of Operations Research, Case Western Reserve University. “On Howard Algorithm for Markov Decision Processes,” Technical Memo 300, Case Western Reserve University. “A Counter Example in Location Theory,” Technical Memo 312, Case Western Reserve University. “A Car Pooling Problem” (with S. Subba Rao), Technical Memo 337, Case Western Reserve University. “Optimal Committee Size” (with S. Mahapatra, M. Kennedy, H. Emmons, and S. Subba Rao), presented at San Juan Meeting of ORSA. “A Class of Generalized Traveling Salesman Problems” (with S.N. Kabadi). xiii PRESENTATIONS: “Forest Fire Fighting by Fire Breaks,” Fourth International Federation of Operations Research Society, MIT, 1966. “On Quota Restricted Admission Policies,” ORSA National Meeting, San Francisco, 1968. “Critical Path Assignment Problem,” Western Regional ORSA Meeting, Monterey, 1968. “A Special Case of the Complementarity Problem,” The Seventh International Symposium on Mathematical Programming, The Hague, 1970. “An Algorithm for Stochastic Games with Semi-Markovian Rewards” (with K.P.K. Nair and S. Subba Rao), TIMS National Meeting, Los Angeles, 1970. “Large Scale LP Formulation of the Traveling Salesman Problem,” ORSA National Meeting, Dallas, 1971. “An Algorithm for Stochastic Games with Discounted Payoffs,” ORSA National Meeting, Dallas, 1971. “On a Faster Algorithm for Stochastic Games” (with K.P.K. Nair and S. Subba Rao), ORSA National Meeting, New Orleans, 1972. “A Non-linear Complementarity Problem” (with A. Tamir), The Eighth International Symposium on Mathematical Programming, Stanford, 1973. “Stochastic Games with Ratio Discounted Criteria” (with A. Aggarwal and K.P.K. Nair), ORSA/TIMS National Meeting, Boston, 1974. “Service Partitioning to Minimize Mean Flow Time” (with H. Emmons and S. Subba Rao), XX th International Meeting of TIMS, Tel Aviv, 1974. “Optimal Committee Size” (with S. Mahapatra, et. al.), ORSA/TIMS National Meeting, San Juan, Puerto Rico, October 1974. “Stochastic Ratio Games” (with V. Aggarwal and K.P.K. Nair), ORSA/TIMS National Meeting, Las Vegas, 1975. “Local Unimodularity of Matrix-Vector Pairs” (with K. Truemper), Symposium Ueber Operations Research, Heidelberg, 1976 (similar to the one given in Atlanta – see below). “Minimal Ratio Spanning Trees,” ORSA/TIMS National Meeting, 1976. xiv “Local Unimodularity of Matrix-Vector Pairs” (with K. Truemper), Discrete Optimization, Vancouver, 1977; also at ORSA/TIMS National Meeting. “Weighted Min-Max and Max-Min Location Problems: A Finite Algorithm,” International Symposium on Extremal Methods and Systems Analysis, Austin, 1977. “Nonterminating Stochastic Ratio Games” (with V. Aggarwal and K.P.K. Nair), ORSA/TIMS National Meeting, San Francisco, 1977. “Location Problems on Trees” (with A. Daugherty), ORSA/TIMS National Meeting, New Orleans, April 30 – May 2, 1979. “Polynomial Algorithms for Locating p-Centres on a Tree” (with A. Tamir), Tenth International Symposium on Mathematical Programming, Montreal, August 1979. “An 0(n log2 n) Algorithm for the Longest Path in a Tree with Applications to Location Problems” (with N. Megiddo, A. Tamir, and E. Zemel), ORSA/TIMS National Meeting, Washington, May 4-7, 1980. “Minimum Cost/Reliability Spanning Tree” (with K.P.K. Nair and Y. Aneja), CORS/ORSA/TIMS National Meeting, Toronto, May 3-6, 1981. “A Characterization of Total Dual Integrality” (with S. Shirali),ORSA/TIMS National Meeting, Houston, October 11-14, 1981. “Production Planning in Assembly Line Systems” (with Y. Aneja and K.P.K. Nair), ORSA/TIMS National Meeting , Houston, October 11-14, 1981. “Integer Programming Problems for which a Simple Rounding Type Algorithm Works,” Silver Jubilee Conference on Combinatorics, Waterloo, Ontario, 1982. “Recognizing Gilmore-Gomory Traveling Salesman Problems,” ORSA/TIMS National Meeting, Orlando, November 7-9, 1983. “Classes of Linear Programs with Integral Solution” (with Y. Aneja and K.P.K. Nair), ORSA/TIMS National Meeting, San Francisco, May 14-16,1984. “Properties and Algorithms for Special Total Dual Integral Systems,” ORSA/TIMS National Meeting, Dallas, November 26-28, 1984. “On Totally Dual Integral Systems” (with S.N. Kabadi), XXI th International Symposium on Mathematical Programming, M.I.T., August 1985. xv “Combinatorial Problems Arising in Automated Manufacturing,” ORSA/TIMS National Meeting, Atlanta, November 4-6, 1985. “Pseudomatroids” (with S.N. Kabadi), ORSA/TIMS National Meeting, Miami Beach, October 27-29, 1986. “Packing Trapezoids and the Gilmore-Gomory Traveling Salesman Problem” (with S.N. Kabadi), SIAM Meeting on Applied Geometry, 1987. “Recognition of Convex Polyhedral Objects” (with S.L. Narasimhan), ORSA/TIMS National meeting at St. Louis, October 25-28, 1987. “Recognition of Nonconvex Polyhedra in 3D” (with S.L. Narasimhan), ORSA/TIMS National Meeting at Washington D.C., April 25-27, 1988. “Simultaneously Processing Jobs on Identical Machines” (with R. Lutz and Z. Hao), ORSA/TIMS National Meeting at Washington D.C., April 25-27, 1988. “Ellipsoidal Methods for LCP and Stochastic Games”, 13th International Symposium on Mathematical Programming (invited), 1988. “Gilmore Gomory Traveling Salesman Problem” (with S.N. Kabadi), 13th International Symposium on Mathematical Programming, 1988. “Computer Vision: Coping with Errors” (with S.L. Narasimhan, S. Sridhar), ORSA/TIMS National Meeting at Denver, October 23-26, 1988. “Associative Storage of Information” (with P. Mukherjee), ORSA/TIMS National Meeting at Denver, October 23-26, 1988. “Structure of Hilbert Basis” (with L. Sambhavi), ORSA/TIMS National Meeting at Denver, October 23-26, 1988. “Integer Programming and Hilbert Bases” (with S. Lakshminarayanan), The National Meeting of ORSA/TIMS, Vancouver, May 8-10, 1989. “Work Related to Flexible Manufacturing Systems: A Survey” (with S. Sridhar), The National meeting of ORSA/TIMS, Vancouver, May 8-10, 1989. (Invited) “On the Perturbation Method for Avoiding Degeneracy” (with N. Megiddo), The National Meeting of ORSA/TIMS, Vancouver, May 8-10, 1989. (Invited Paper) “Rounding Algorithms and Hilbert Bases” (with S. Lakshminarayanan), The Capital City Conference on Combinatorics and Theoretical Computer Science, May 22-26 1989. xvi (Invited Paper) “The Gilmore Gomory Traveling Salesman Problem and Extensions” (with S.N. Kabadi), DIMACS Workshop on Polyhedral Combinatorics, held at Morristown, NJ, June 12-16 1989. (Invited Paper) “Least Elements and Integer Rounding Algorithms,” The 1989 Mathematical Sciences Lecture Series on Lattice Programming, August 7-11, 1989. (Invited Paper) “Integer Programs and a Generalized Rounding Algorithm” (with S. Lakshminarayanan), The National Meeting of ORSA/TIMS held at New York, October 16-18, 1989. (Invited Paper) “Network Synthesis Problem” (with S. Sridhar), The National Meeting of ORSA/TIMS held at New York, October 16-18, 1989. (Invited Paper) “The Gilmore Gomory Traveling Salesman Problem” (with S.N. Kabadi) in the session honoring R.E. Gomory, October 16-18, 1989. “A Problem in Computational Geometry” (with J. Bhadury), The National Meeting of ORSA/TIMS held at Las Vegas, Nevada, May 7-9, 1990. “Generalized Rounding and Hilbert Basis” (with S. Lakshminarayanan), The National Meeting of ORSA/TIMS held at Las Vegas, Nevada, May 7-9, 1990. “The Directed Multiterminal Synthesis Problem” (with S. Sridhar), The National Meeting of ORSA/TIMS held at Las Vegas, Nevada, May 7-9, 1990. “Information Acquisition Process: Models and Algorithms” (with K.C. Seal), The National meeting of ORSA/TIMS held at Las Vegas, Nevada, May 7-9, 1990. “A Problem in Polygon Cutting” (with J. Bhadury) The National Meeting of ORSA/TIMS held at Philadelphia, October 29-31, 1990. “A Problem in Geometry with Application to Facility Location” (with J. Bhadury and V. Padmanabhan) The National Meeting of ORSA/TIMS held at Nashville, May 12-15,1991. “Algorithms that Use Complex Algebraic Operations” The National Meeting of ORSA/TIMS held at Nashville, May 12-15,1991. “Optimal On-line Algorithms” (with P.R. Narayanan) The National Meeting of ORSA/TIMS held at Nashville, May 12-15,1991. xvii “Ordering Policies for Two Commodity Capacity Constrained System” (with A. Mukhopadhyay, The National Meeting of ORSA/TIMS held at Nashville, May 12-15,1991. “Two Commodity Network Synthesis Problem” (with S.N. Kabadi and K.P.K. Nair) XIV th International Symposium on Mathematical Programming, Amsterdam, August 1991. “A Problem in Geometry with Application to Facility Location” (with J. Bhadury and V. Padmanabhan) XIV th International Symposium on Mathematical Programming, Amsterdam, August 1991. “Decision Making Under Imperfect Information: A Model” (with K.C. Seal), ORSA/TIMS National Meeting held at Anaheim, November 1991. “Ordering Policies for a Multicommodity Capacity Constrained Production/Inventory System” (with A. Mukhopadhyay), ORSA/TIMS National Meeting held at Anaheim, November 1991. “Optimal On-line Algorithms for Scheduling” (with P.R. Narayanan), ORSA/TIMS National Meeting held at Anaheim, November 1991. “On-line Algorithms for Optimal Scheduling” (with P.R. Narayanan), ORSA/TIMS National Meeting, Orlando, April 1992. “Computation of Optimal Inventory Policies” (with A. Mukhopadhyay and Ping Yang), ORSA/TIMS National Meeting, Orlando, April 1992. “Art Gallery and Related Problems” (with J. Bhadury), ORSA/TIMS National Meeting, Orlando, April 1992. “A Hierarchy of Properties for Zero-One Matrices,” (with S. Lakshminarayanan), ORSA/TIMS National Meeting, Orlando, April 1992. “A Capacity Constrained Multi-Commodity Inventory Problems” (with A. Mukhopadhyay and Ping Yang), ORSA/TIMS National Meeting, San Francisco, November 1992. “An Extension of a Theorem of Fulkerson and Gross” (with S.N. Kabadi and S. Lakshminarayanan), ORSA/TIMS National Meeting, San Francisco, November 1992. “Tessellation and g-Tessellation of Circulants, Q6 and Qt6 (with S. Lakshminarayanan), ORSA/TIMS National Meeting, Chicago, May 1993. “Finding the set of all Minimal Nested Convex Polygons” (with J. Bhadury), ORSA/TIMS National Meeting, Phoenix, Oct-Nov 1993. xviii “Design of Fault Tolerant Networks”, (with R.E. Best), International Symposium on Mathematical Programming, Ann Arbor, August 1994. “Design of Directed Networks — A preliminary Analysis”, (with Sri Nathan), International Symposium on Mathematical Programming, Ann Arbor, August 1994. “Hilbert Bases of Circulants, Q6 , Qt6 , Node Edge Incidence Matrices, and their Transposes”, (with Sambhavi Lakshminarayanan), International Symposium on Mathematical Programming, Ann Arbor, August 1994. “Multicommodity Flows: A Survey of Recent Results”, Annual Conference of The Operational Society of India, Calcutta, India, Dec 20-22, 1994. “Pairwise Exchange Rearrangement Problem”, (with Z. Wang), INFORMS (Formerly ORSA and TIMS) National Meeting, Los Angeles, April, 1995. ”Integer Solution for Linear Complementarity Problem” (with S.N. Kabadi and R. Sridhar), International Symposium on Mathematical Programming, Lausanne, August 1997. ”Special Case of the Multi-commodity Problem” (with Rajesh Jagannathan), INFORMS National Meeting at Dallas, October 1997. ”Complexity of Integrated Location & Network Design Problems”, (with J. Bhadury and L.P. Gewali), INFORMS National Meeting at Dallas, October 1997. ”SONET Ring Design Methodology”, (with Jennifer Huang, and Sri Nathan)INFORMS Telecommuncations Meeting, Boca Raton, March 1998. ”Preserving Chain Flows Under Arcs Destruction in Single Commodity Networks”, (with Yash P. Aneja, and K. P. K. Nair), INFORMS National Meeting at Montreal, April, 1998. ”Integer Solutions to Linear Systems”, Invited paper at Semi-Annual Meeting of Canadian Mathematical Society, St. John, NB, CANADA, June 1998. ”Strongly Polynomial Algorithms in General” (with S.N. Kabadi), presented at the 50th Year Celebration Meeting of ISI, Madras, India, August 1998. ”Isotonic Separation” (joint with Y. Ryu, V. Jacob, and S.C Hong) Canadian Operations Research Society Meeting at Windsor, June 1999. xix State of the Art (invited) Lecture on Integer Programming at The International Conference on Operations Research and Game Theory, IIT Madras, January 2000. ”Fault Tolerant Network Flows and Design”, (joint work with Y.P. Aneja, K.P.K. Nair and Robert E. Best), (invited), The International Conference on Operations Research and Game Theory, IIT Madras, January 2000. “Hop-Constrained Network Synthesis Problem”, (with S.N. Kabadi, J. Kang, K.P.K. Nair), Canadian Operational Research Society Conference, Halifax, 2005. “Existence of Cut-trees and the Realizability Problem for Multiroute Flows” , (with S. N. Kabadi, K.P.K. Nair), International Network Optimization Conference, Lisbon, Portugal, 2005. “Multi-terminal Multi-path Flows: Synthesis”, (with Y.P. Aneja, K.P.K. Nair, S.N. Kabadi), Canadian Operational Research Society Conference, Banff, Alberta, 2004. “Flows over Edge-Disjoint Mixed Multipaths and Applications, (with Y. Aneja, K.P.K. Nair, S.N. Kabadi), Association of Asian Pacific Operational Research Societies Conference, New Delhi, India, 2003. “Hop-Constrained Network Flow Problem - Analysis and Synthesis”, (with S.N. Kabadi, K.P.K. Nair, J. Kang), Canadian Operational Research Society Conference, Vancouver, British Columbia, 2003. “Multipath Flows and Synthesis” at National Symposium on Recent Advances in Optimization: Theory and Applications, New Delhi, India, October 2006 “Recent Advances in Combinatorial Optimization: Flow Problems and Network synthesis” Indo-US workshop on Computational Optimization and Systems Analysis, IIT Kanpur, February 2007 “A Polynomial Time Solution to Minimum Forwarding Set Problem in Wireless Adhoc Networks”, M. Baysan, K. Sarac, R. Chandrasekaran, S. Bereg, submitted to IEEE Transactions on Parallel and Distributed Systems. “ Graph Labeling: Part I: Trees” at IIT Kanpur Computer Science Department October 2006. “Graph Labeling: Part II: General Graphs” at IIT Kanpur Mathematics Department, February 2007. xx INVITED SERIES OF TALKS: Indian Institute of Science, Bangalore Indian Institute of Technology, Kanpur Indian Institute of Technology, Bombay Indian Institute of Technology, Madras Indian Statistical Institute Indian Institute of Management, Ahmedabad Indian Institute of Management, Bangalore University of Delhi University of Poona, India Operations Research Society of India Stanford University, 1990. University of California, Berkeley University of Michigan, Ann Arbor University of Waterloo Georgia Institute of Technology, AT&T Seminar London School of Economics Northwestern University Purdue University Tel Aviv University New York University Case Western Reserve University SUNY, Buffalo University of New Brunswick University of Oklahoma University of Iowa University of Illinois, Chicago . University of Windsor xxi Ph.D. THESES: Chair of the committee:. M. Brown: “A Systems Approach to Performance Evaluation in Baseball”, June, 1971. A. K. Rao: “On the Linear Complementarity Problem”, Jamuary, 1972. B. Z. Hull: “Results on Matroids, Blocking Systems and Convex Sets”, August, 1972. K. Truemper: “Optimal Flows in Networks with Positive Gains”, June, 1973. A. Tamir: “The Complementarity Problem of Mathematical Programming”, June, 1973. 1 V. Aggarwal: “Bimatrix Markovian Decision Processes and Stochastic Ratio Games”, August, 1973. 2 H. Patel: “Optimal Control of Arrival Processes in Queues with Exponential Servers”, August, 1974. J. Saha: “On Some Problems in Railway Networks”, June 1975. S. Mehta: “Optimal Design of Networks with Node Weighted Functions”, July, 1975. A. Mittal: “Optimal Rearrangement of Objects”, June, 1975. W. Delfino: “Optimal Design of Water Distribution”, June, 1975. L. Costa: “Optimization Models for Offshore Oil Field Development”, August, 1975. M. Pacca: “Some Problems in Location Theory”, August, 1975. 2 P.Darukhanavala: “Economic Lot Size Determination in Multi-Item, MultiLevel Production- Inventory Systems with Acyclic Network Structures”, July, 1975. 2 K.S. Lee: “Antipollution Activities in Input-Output Analysis: An Application to Water Quality Management”, June, 1975. R. Rao: “Optimal Labeling on Trees”, June, 1976. 2 K. Gudapati: “A Multi-Item (and Multi-Stage) Multi- Period Production Scheduling Model with Constraints”, January, 1977. J. Barrer: “A Class of Solvable Permutation Problems”, August, 1978. xxii 1 P. Pantankar: “Optimizing Operating Machines in Scheduling”, December, 1978. S. Shirali: “Characterization of Total Dual Integrality”, June, 1981. C.T. Shueh: “Efficient Algorithm to Rank Order a Set”, December, 1981. L. McCalla: “Griddable Graphs: Properties, Algorithms, and Complexity”, June, 1982. S. Kabadi: “Characterization and Development of Solution Methods for Special Classes of Totally Dual Integral Systems”, December, 1984. S.L. Narasimhan: “Recognition of Polyhedral Objects: Concepts and Algorithms”, August, 1988. 2 Z. Hao: “Some Simultaneous and Preemptive Scheduling Problems”, August, 1988. Sambhavi Lakshminarayanan: “A Rounding Algorithm for Integer Programming and Properties of Hilbert Bases”, August, 1989. P. Mukherjee: “Associative Storage and Retrieval of Information”,August, 1989. S. Sridhar: “Continuous and Integer Solutions for the Network Design Problems”, August, 1990. K. Seal: “Information Acquisition: Models and Algorithms”, August, 1990. J. Bhadury: “Geometric Optimization Problems”, August, 1991. P.R. Narayanan: “Performance Analysis of On Line Algorithms Under Various Scheduling Criteria”, August, 1992. A. Mukhopadhyay: “Capacity Constrained Multiitem Inventory/Production Systems”, August, 1992. R.E. Best: “A Fault Tolerant Network Design Algorithm Minimizing Total Edge Capacities”, August, 1992. Shu-Jen Huang: “On Multicommodity Flows”, May, 1995. Zishun Wang: “Optimal Rearrangement of Objects”, August, 95. Rajesh Jagannathan, ”Special Multicommodity Flow Problemss”, May 1998 John Rudin III, ”Improved Bounds for the On-line Scheduling Problem”, May 2001 Donglei Du: ”Multiroute Flow Problem”, June, 2003 xxiii 2 Srinivasan Krishnamurthy: ”Layer-2 Configuration Algorithms for Cognitive Radio Networks”, December 2006 2 Maulin Patel: ”Efficient Placement and Routing Algorithms for Maximizing the Lifetime of Wireless Sensor Networks”, December 2006 2 Mehmet Baysan: ”Minimum Forwarding set in Wireless Broadcast Networks”, August 2008. Suhel Patel: ”Graph Labeling Algorithms and NP-completeness” Member of the Committee:. J. Hartman: “A Primal Method of Linear Programs with Coupling Rows and Columns”, September, 1970. B. Lev: “Non-Iterative Algorithm for Solving Special Types of Transportation Problems”, September, 1970. R. Frick: “Non-Convex Optimization”, October, 1970. C. Das: “Stockage and Transfer Rules for Multilocation Inventory Control”, September, 1971. A. Daughety: “Some Mathematical Models of Housing Process”, August, 1972. S. Srinivasan: “Markov Decision Model of Portfolio Management”, September, 1972. W. Brown: “Plant Location Problem”, January, 1973. D. Rowland: “Stochastic Processes”, June, 1973. F. Vincentini: “Limiting Distributions of Inventory Processes Induced by Simple Policies”, June, 1973. J. Donahue: “Markov Decision Process in Stochastic Control” K. Tsuji: “Markov Decision Process in Stochastic Control” J. Svestka: “Applications of Operations Research to a Check Processing System”, August, 1974. C.Y. Lin: “Corporate Tax Structures and a Special Class of Set Partitioning Problems”, June, 1975. K. Dadachanji: “Scheduling Intermittently Arriving Jobs to Minimize Weighted Number Tardy”, July, 1975. T. Nunnikhoven: “Scheduling Independent Jobs on Parallel Machines to Minimize Two Objectives Related to Job Tardiness”, August, 1975. xxiv A. Jain: “The Solution of Nonlinear Programs Using the Generalized Reduced Gradient Method”, March, 1976. Y. Soun: “Transformable Multi-Commodity Networks”,August, 1978. E.H. Hamilton: “MRP, Scheduling and Inventory Control”, May, 1978. F.-T. Tseng: “On the Matroids with the Max-Flow Min-Cut Property: A Decomposition/Composition Characterization”, December, 1983. P.S. Ku: “Stochastic Scheduling”, April, 1984. Y.Y. Lin: “Iterative Methods for Large Convex Quadratic Programs”, Decembe, 1985. J.M. Yang: “Parallel Algorithms for LCP”, August, 1987. J. Du: “Complexity of Some Deterministic Scheduling Problems”, May, 1988. J.W. Li: “Sample-Average Analysis of Some Generalizations of the M/G/1 Queue”, November, 1989. V. Padmanabhan: “Issues in Pricing Theory”, December, 1990. Ching-Chin Chern: “Lot-Sizing Problems in an Imperfect Production System”, May, 1995. Chen-Ping Pai, ”Sample Average Anaysis of M/G/1-type Retrial Queueing Systems With Finite Capacity”, May 1996. Madhusudhan Vudali: ”Performance Analysis of Two Classes of Polling Models”, December 1996. Janell Straach: ”Effective Optimzation in Expert Systems”, May 1998 V. Jayakesavan: ”Mixed Chinese Postman Problems”, May 1999 Samit Soni: ”Network Problems in Telecommunications”, May 1999 An Ge: ”Optical Packet Switching Nodes and Networks”, May 2000 Don Montgomery: ”The Low Power Optical Network”, 2003 Jianping Wang: ”QoS-assuring Multicast in WDM Networks”, May 2003 Raja Jothi: ”Approximation Algorithms for Single-Sink Edge Installation Problems and other Graph Problems”, August 2004 Bing Yang: ”On Complexity of Finding Disjoint Paths and Related Problems”, August 2005 xxv Jun Luo: ”On Some Geometric Optimization Problems with Applications in Manufacturing, Graph Visualization, and Structural Biology”, May 2006 Luke E. Simon: ”Extending Logic Programming with Coinduction, August 2006 Prabhakar Gubbala: ”Problems in Graph Connectivity”, December Decemebr 2006 Mansi Thoppian: ”Medium Access Control Protocols for Congnitive Radio Based Multi-hop Wireless Networks”, December 2006 Bhadrachalam Chitturi: ”On Transforming Sequences”, July 2007. Mehmet Hadi Gunes: ”Complex Network Discovery: Router-Level Internet Topology Mapping”, July 2008 Anastasia Kurdia: ”Decision and optimization problems for graphs and geometric graphs” 2009 Lakshmi Kannan: ”Cooperative MAC Protocols for IEEE 802.11 Link Protocol”, 2009 Trac-Ngoc Ngyuen: ”Clustering in Wireless Sensor Networks”, 2009 Yam Ki Cheung: ”Geometric path planning problems” Chanaka J. Liyana: ”Scheduling in a Cognitive radio Network” Yanyan Zeng: ”Distributed Algorithms for Cognitive Radios” 1 Finalist in National Dissertation Contest, Operations Research Society of America 2 Co-Chairman MISCELLANEOUS Invited to act as an external examiner on seven Ph.D. dissertations: four from the University of Delhi, one from the Indian Institute of Technology, Delhi, one from the University of Michigan, Ann Arbor, and one from the Indian Institute of Technology, Kanpur.