Clyde L. Monma
Chief Scientist

Information & Computer Sciences Laboratory

Professional

Bio for Clyde Monma

Clyde Monma is a Chief Scientist in the Applied Research Area of Telcordia Technologies (formerly Bellcore). His current areas of interest are in optimization methods and applications to E-Commerce and Next Generation Networks. (See his report on the IMA Workshop on "Math and E-Auctions.")

Recent projects include work on optimization algorithms for capacity routing in WDM optical networks, an online CommRules regulatory database, electronic payment mechanisms for digital content, a web site for the mathematical sciences, and a telecommunications web portal.

Clyde has over twenty-two years of R&D experience in the telecommunications industry, including Bell Labs. He has edited five books, has over fifty publications and technical reports, and has presented over a hundred international invited lectures. Clyde has held numerous positions with various professional computing and mathematical organizations.

Academic Degrees

Ph.D.(1978), Operations Research, Cornell University
M.S.(1976), Operations Research, Cornell University
B.S.(1974), Computer Science, Washington State University

Professional Organizations

American Association for the Advancement of Science (AAAS)
Association for Computing Machinery (ACM)
American Mathematical Society (AMS)
Institute for Electronics & Electrical Engineers (IEEE)
Institute for Operations Research & Management Science (InfORMS)
Mathematical Programming Society (MPS)
Society for Applied Mathematics (SIAM)

Patents

U.S. Patent No. 6,160,651, "Optical Layer Survivability and Security System Using Optical Label Switching and High-Speed Optical Header Reinsertion", with G.K. Chang, G. Ellinas and R. F. Graveman, December 12, 2000.

Awards

Leonard G. Abraham Prize Paper Award in the Field of Communications Systems, IEEE Communications Society. (with D. D. Sheng).

Selected Publications

Efficient state-based search algorithms for capacity routing in WDM optical networks, Telcordia Technologies, 2000 (with P. Seymour, D.F. Shallcross)
An overview of existing Internet payment mechanisms, Telcordia Technologies, 1999
Next Generation Networks and the Mathematical Sciences: New Challenges and Research Opportunities, Telcordia Technologies, 1998
Network Routing & Network Modeling, Handbooks in Operations Research and Management Science, Volumes 8-9, Elsevier publisher, 1995. (with M. Ball, T. L. Magnanti and G. L. Nemhauser)
Reliability of Computer and Communication Networks, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 5, AMS/ACM publisher, 1991. (with F. K. Hwang and F. S. Roberts)
Design of survivable communications networks, in Network Models, Chapter 10, Handbook of Management Science and Operations Research, Volume 7, 1995, Ball et.al. (editors), Elsevier, 617-672, 1995. (with M. Grotschel, M. Stoer)
Minimum-weight two-connected spanning networks, Mathematical Programming 46, 153-172, 1990. (with B.S. Munson, W. R. Pulleyblank)
Convex resource allocation problems on directed acyclic graphs: duality, complexity, special cases and extensions, Mathematics of Operations Research 15, 736-748, 1990. (with A. Schrijver, M. J. Todd, V. K. Wei)
On the complexity of embedding planar graphs to minimize certain distance measures, Algorithmica 5, 93-109, 1990. (with D. Bienstock)
An implementation of a primal-dual interior point method for linear programming, ORSA Journal on Computing 1, 70-83, 1989. (with K. A. McShane, D. F. Shanno)
Threshold tolerance graphs, Journal of Graph Theory 12, 343-362, 1988. (with B.A. Reed, W. T. Trotter)
On the complexity of covering vertices by faces in planar graphs, SIAM Journal on Computing 17, 53-76, 1988. (with D. Bienstock)
Send-and-split method for minimum-concave-cost network flows, Mathematics of Operations Research 12, 634-664, 1987. (with R. E. Erickson, A. F. Veinott)
Backbone packet network design and performance analysis, IEEE Selected Areas in Communication 4, 946-965, 1986. (with D. D. Sheng)
Intersection graphs of paths in a tree, Journal of Combinatorial Theory B 41, 141-181, 1986. (with V. K. Wei)
Probabilistic analysis of inter-frame tie requirements for cross-connect systems, Bell System Technical Journal 63, 643-664, 1984. (with D. R. Smith)
On perfect graphs and polyhedra with (0,1)-valued extreme points, Mathematical Programming 17, 239-242, 1979. (with L. E. Trotter)
Sequencing with series-parallel precedence constraints, Mathematics of Operations Research 4, 215-224, 1979. (with J. B. Sidney)
On the computational complexity of integer programming problems, Lecture Notes in Economics and Mathematical Systems 157, 161-172, 1978. (with R. Kannan)