Professional Bio

Clyde Monma ( =Mon="gate", =Ma="horse") "retired" as Chief Scientist in the Applied Research Area of Telcordia Technologies (formerly Bellcore) in July 2002. He is currently pursuing several interests as a self-employed consultant in the areas of College Search Consulting, technology integration in secondary schools, and algorithm design.

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

Clyde has a long-time interest in youth education issues. He is currently a Board member of the South Whidbey Commons (SWC) and is heavily involved in the South Whidbey public school sysem. Prior to moving to Washington, he was associated with the Rutgers Preparatory School for over 10 years including two terms on the Board of Trustees.

• Capacity routing in WDM optical networks, Telcordia Technologies, 2001 (with P. Rao, P.D. Seymour, D.F. Shallcross)  [PDF]
• 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) [PDF]
• Convex resource allocation problems on directed acyclic graphs, Mathematics of Operations Research 15, 736-748, 1990. (with A. Schrijver, M. J. Todd, V. K. Wei)
• 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)
• 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)