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鈥檚 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鈥檚 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鈥揕incoln, 2000
• M.S., computer science, University of Nebraska鈥揕incoln, 1998
• M.S., discrete mathematics, Michigan Technological University, 1994
• B.S., pure mathematics, Michigan Technological University, 1992

Selected Publications

• 鈥淕raph Pebbling Algorithms and Lemke Graphs,鈥� with A. Green, M. Powers and A. Bekmetjev, Discrete Applied Mathematics, 262, 2019
• 鈥淭wo-pebbling and odd-two-pebbling are not equivalent,鈥� with M. Powers and A. Bekmetjev, Discrete Mathematics, 342 (3), 2019
• 鈥淒oppelgangers and Lemke graphs,鈥� with M. Powers and A. Bekmetjev, Discrete Mathematics, 341(10), 2018
• 鈥淢ultidesigns 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
• 鈥淭he 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鈥檚 published work on Digital Commons.

Recent Exhibitions

• 鈥�Make-A-Wish!,鈥� October 2022鈥搊ngoing
• 鈥�Random Algorithmic Art by Category,鈥� August 2022鈥搊ngoing
• 鈥�Random Algorithmic Art,鈥� January 2022鈥搊ngoing
• 鈥�Tulip Time Inspired Art,鈥� https://cusack.hope.edu/art/TulipTime. (November 2022 - ongoing).
• 鈥淭ulips, Windmills, and Mondrian,鈥� 2023 First Bloem Festival Artwork Competition Viewer鈥檚 Choice Exhibition, Holland, Michigan, May 6鈥�12, 2023
• 鈥�Algorithm + You = Art,鈥� ArtPrize, House Rules Lounge, Grand Rapids, Michigan, September 15鈥揙ctober 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.