Chuck Cusack has been teaching in the Department of Computer Science at Hope since 2005 and began a joint appointment in the Department of Mathematics & Statistics in 2016. 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

Chuck’s research interests include algorithms, graph theory and combinatorics. In recent years he has become very interested and active in creating mathematical and algorithmic art. He has created over 650 programs that have created over 3 million unique works of abstract mathematical art since 2022. He also creates abstract mathematical art using Lego and Pix Brix. He has earned both local and international awards for his art.

His more traditional research area is graph pebbling, a mathematical model that can be used to represent certain network optimization problems and has ties to number theory, as well as to some fundamental questions at the core of computer science. He uses both mathematical and algorithmic approaches in this work. He is particularly interested in something called Lemke graphs, and how they relate to an open problem in graph theory referred to as Graham’s Conjecture. He is one of the world's foremost experts in Lemke graphs, having identified all Lemke graphs with at most 10 vertices and disproved a long-held conjecture related to Lemke graphs.

Education

• 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

Selected Publications

• “Graph Pebbling Algorithms and Lemke Graphs,” with A. Green, M. Powers and A. Bekmetjev, Discrete Applied Mathematics, 262, 2019
• “Two-pebbling and odd-two-pebbling are not equivalent,” with M. Powers and A. Bekmetjev, Discrete Mathematics, 342 (3), 2019
• “Doppelgangers and Lemke graphs,” with M. Powers and A. Bekmetjev, Discrete Mathematics, 341(10), 2018
• “Multidesigns of Complete Graphs for Graph-Triples of Order 6,” with S.E. Edwards and D.B. Parker, Journal of Combinatorial Mathematics and Combinatorial Computing, 94, 2015
• “The complexity of pebbling reachability and solvability in planar and outerplanar graphs,” with T. Lewis and L. Dion, Discrete Applied Mathematics, 172, 2014

View all of Charles Cusack’s published work on Digital Commons.

Recent Exhibitions

• “Make-A-Wish!,” October 2022–ongoing
• “Random Algorithmic Art by Category,” August 2022–ongoing
• “Random Algorithmic Art,” January 2022–ongoing
• “Tulip Time Inspired Art,” https://cusack.hope.edu/art/TulipTime. (November 2022 - ongoing).
• “Tulips, Windmills, and Mondrian,” 2023 First Bloem Festival Artwork Competition Viewer’s Choice Exhibition, Holland, Michigan, May 6–12, 2023
• “Algorithm + You = Art,” ArtPrize, House Rules Lounge, Grand Rapids, Michigan, September 15–October 2, 2022

Outside the college

Chuck is a runner and disc golfer. He is an active member of the Holland Running Club and has served on the board of directors for the club for several years.