معرفی
Charles Cusack is a Professor of Computer Science at Hope College, where he has taught since 2005, with a joint appointment in the Department of Mathematics & Statistics since 2016. His expertise spans theoretical and algorithmic domains, particularly in discrete mathematics, graph theory, and algorithmic art.
- Ph.D. in Computer Science (2000), University of Nebraska–Lincoln
- M.S. in Computer Science (1998), University of Nebraska–Lincoln
- M.S. in Discrete Mathematics (1994), Michigan Technological University
- B.S. in Pure Mathematics (1992), Michigan Technological University
His research focuses on graph pebbling, Lemke graphs, and their connections to network optimization, number theory, and computational complexity. He has also pioneered algorithmic art creation using mathematical principles and Lego/Pix Brix since 2022, generating over 3 million unique works through custom programs.
Recent publications highlight his work in graph algorithms, combinatorial design, computational complexity, and innovative applications of gaming to distributed computing. While specific scientific awards are not named, his algorithmic art has been recognized in local and international exhibitions.
Outside academia, he is an active runner and disc golfer, contributing to community engagement through the Holland Running Club.
