Calin Anton

Dr. Calin Anton is an Associate Professor in the Department of Computer Science at MacEwan University, where he has taught since 2008. He holds a PhD from the University of Alberta, specializing in computing science, and previously served as an Assistant Professor at Augustana Faculty (University of Alberta) from 2005 to 2007. His research focuses on generating hard satisfiable instances of the satisfiability problem using random subgraph isomorphism and exploring empirical algorithms and artificial intelligence.

Education:

• B.Sc. in Computing Science (1996), University of Bucharest
• M.Sc. in Computing Science (1997), University of Bucharest
• PhD in Computing Science (2005), University of Alberta

His research interests include satisfiability problem analysis, heuristic search, and computational complexity. Recent work involves transitioning towards computer security. He has collaborated with undergraduate students on instance generators used in SAT solver competitions.

Awards & Funding:

• NSERC Discovery Grant (2006–2010)
• MacEwan University Research Funds (2010–2012)
• Conference Travel Support (2010–2011)

Teaching & Advising:

Teaches courses in algorithmics, artificial intelligence, and foundational computer science. Available to supervise senior independent study projects.