Douglas R. Shier

Research Interests: Operations Research, Network Optimization, Discrete Mathematics, Algorithms.

Recent Publications:

• "Redundancy and reliability of communication networks," College Mathematics Journal 26 (1996), 59-67. With R. P. Grimaldi.
• "A paradigm for listing (s,t)-cuts in graphs," Algorithmica 15 (1996), 351-372. With J. S. Provan.
• "On algorithmic analysis," INFORMS J. Computing 8 (1996), 24-26.
• "An improved algorithm for approximating the performance of stochastic flow networks," INFORMS J. Computing 8 (1996), 355-360. With J.P. Jarvis.
• "A network approach to balanced sampling," Congressus Numerantium 118 (1996), 33-47. With D. Rose.
• "Special sequences" in Handbook of Discrete and Combinatorial Mathematics,CRC Press, 1999, pp. 138-171. With T.A. Dowling.
• "System reliability" in Handbook of Discrete and Combinatorial Mathematics,CRC Press, 1999, pp. 459-468.
• "Matchings" in Handbook of Discrete and Combinatorial Mathematics,CRC Press, 1999, pp. 641-652.
• "Network representations and data structures" in Handbook of Discrete and Combinatorial Mathematics,CRC Press, 1999, pp. 706-711.
• "Graph-theoretic analysis of finite Markov chains" in Applied Mathematical Modeling,CRC Press, 1999, pp. 271-289. With J.P. Jarvis.
• Applied Mathematical Modeling, CRC Press, 1999. With K.T. Wallenius.
• "Spanning trees: let me count the ways," Mathematics Magazine 73 (2000), 376-381.
• "Graph theory," in Encyclopedia of Operations Research and Management Science, 2nd Edition, Kluwer, 2001, pp. 339-342.
• " Discrete mathematics and combinatorics," in Encyclopedia of Physical Science and Technology, 3rd edition, Vol. 4, Academic Press, 2002, pp. 523-534.
• "Cancellation in cyclic consecutive systems," J. Computational and Applied Mathematics 142 (2002), 13-26. With N.J. Calkin, J.D. Edds.
• "Minimax models for diverse routing," INFORMS J. Computing 14 (2002), 81-95. With J. Brumbaugh-Smith.
• "A lattice-based approach to matched pairs tests," Congressus Numerantium 155 (2003), 5-13.
• "Algorithms for the weight distribution of a minimum spanning tree in a stochastic network," Proceedings of the INOC 2003 Conference, 2003, pp. 279-285. With K. R. Hutson.
• "Matchings and Assignments" in Handbook of Graph Theory, CRC Press, 2004, pp. 1103-1116.