 |
Kevin HutsonAssistant ProfessorDepartment of Mathematics Furman University Greenville, SC 29613 Office: 205-C Riley Hall Phone: Fax: (864) 294-3641 Email: kevin.hutson@furman.edu |
Courses Taught at Furman
FYS 1129 -- The Heart of Mathematics
Math 110 -- Finite Mathematics
Math 140/141 -- Integrated Caluclus and Precalculus I
Math 151 -- Calculus II
Math 160 -- Matrices and Vectors
Math 260 -- Intro. to Discrete Mathematics
Math 330 -- Combinatorics and Graph Theory
Math 340 -- Probability
Other Courses Taught
Operations Research
Linear Algebra
Applied Statistics
Research Interests
Operations research, network and combinatorial optimization, and graph theory.
Publications
- Hedetniemi, S., K. Hutson, and R. Laskar, et al. “Gallai Theorems for Domination Parameters,”
Congressus Numerantium, Vol. 57, 2002, pp. 149-157.
- Hutson, K. and D. Shier. "Algorithms for the Weight Distribution of a Minimum Spanning
Tree in a Stochastic Network," in Proceedings of the International Network Optimization
Conference (INOC 2003), Ben-Ameur, W. and A. Petrowski (eds.), 2003, Paris, pp. 279-285.
- Buchanan, T., K. Hutson, and D. Shier. "On Distributed Shortest Paths,” in Proceedings of
the International Network Optimization Conference (INOC 2005), Ben-Ameur, W. and
A. Petrowski (eds.), 2005, Lisbon, pp. 449-454.
- Hutson, K. and D. Shier. “Bounding Distributions for the Weight of a Minimum Spanning
Tree in Stochastic Networks,” Operations Research, Vol. 53, no. 5, 2005, pp. 879-886.
- Feil, T., K. Hutson, and R. M. Kretchmar. “Tree Traversals and Permutations,”
Congressus Numerantium, Vol. 172, 2005, pp. 201-221.
- Hutson, K. and D. Shier. “Minimum Spanning Trees in Networks with Varying Edge
Weights,” Annals of Operations Research, Vol. 146(1), 2006, pp. 3-18.
- Bucantanschi, D., B. Hoffman, K. Hutson, and R. M. Kretchmar. “A Neighborhood Search
Technique for the Freeze Tag Problem,” in Extending the Gap: Advances in Computing,
Optimization, and Decision Technologies, E. Baker, A. Joseph, A. Mehrotra, and M. Trick (eds.),
Springer, 2007, pp. 97-113.
- Hutson, K. and T. Lewis. “The Expected Length of a Minimum Spanning Tree of a Cylinder
Graph,” Combinatorics, Probability, and Computing, Vol. 16, no. 1, 2007, pp. 63-83.
- Hutson, K., T. Schlosser, and D. Shier. "On the Distributed Bellman-Ford Algorithm and the Looping Problem,"
INFORMS Journal on Computing, Vol. 19 (4), Fall 2007, pp. 542-551.
- Hutson, K. and D. Shier. "Extended Dominance and a Stochastic Shortest Path Problem," Computers & Operations Research, Vol. 36, 2009, pp. 584-596.
- Havill, J. and K. Hutson. "Optimal Online Ring Routing," submitted.
Education
- Ph.D. in Mathematical Sciences, Clemson University, 2002.
- M.S. in Mathematical Sciences, Clemson University, 1997.
- B.A. in Mathematics, Hendrix College, 1995.