Dr. Charles CusackAssociate Professor of Computer Science
Charles Cusack has been teaching in the Department of Computer Science at Hope since 2005. His favorite classes are theoretical/mathematical ones, especially those related to discrete mathematics, data structures and algorithms.
He is in charge of the Computer Science Help Center.
Areas of expertise
Charles’ current research interests include algorithms, graph theory and combinatorics. In recent years, his focus has been on problems related to graph pebbling, which can be used to model certain network optimization problems and has ties to number theory, as well as to some fundamental questions at the core of computer science.
He also specializes in graph theory, combinatorics, discrete mathematics, algorithms and human computing, especially human computing games.
- Ph.D., computer science, University of Nebraska–Lincoln, 2000
- M.S., computer science, University of Nebraska–Lincoln, 1998
- M.S., discrete mathematics, Michigan Technological University, 1994
- B.S., pure mathematics, Michigan Technological University, 1992
- “Multidesigns of Complete Graphs for Graph-Triples of Order 6,” Journal of Combinatorial Mathematics and Combinatorial Computing, to appear
- “The complexity of pebbling reachability and solvability in planar and outerplanar graphs,” Discrete Applied Mathematics, 2014
- “The Complexity of Pebbling in Diameter Two Graphs,” SIAM Journal on Discrete Mathematics, 2012
- “Ray Tracing as an Object-Oriented Example for CS 1,” The Journal of Computing Sciences in Colleges, 2010
View all of Charles Cusack’s published work on Digital Commons.
Outside the college
Charles is a Lego artist, a disc golfer and a runner (for health, not because he particularly enjoys it).