We are one of the largest and oldest discrete math groups in Canada. Our group has a wide variety of expertise in pure and applied discrete math and combinatorics. Our research themes include ...

Graph Domination Theory is a fundamental area in combinatorial optimisation and theoretical computer science that examines dominating sets and their diverse extensions. At its core, a dominating set ...

MacDonald, Lori, Paul S. Wenger, and Scott Wright. "Total Acquisition on Grids." The Australasian Journal of Combinatorics 58. 1 (2014): 137-156. Web. * Wenger, Paul S. "A Note on the Saturation ...

This course will discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications to computer science. Example topics include logic and Boolean circuits; sets, ...

Jason Williford joined the University of Wyoming faculty in 2009. He came to the University of Wyoming from the University of Colorado at Denver. His mathematical interests center around the interplay ...

Join one of the most vibrant and forward-looking graduate Mathematics programs in Canada. Mathematics is a vital human endeavour that has important outcomes and applications in almost any field. The ...

The Department has a strong faculty working in various topics in discrete mathematics, especially algorithmic aspects. The interface between Theoretical Computer Science and Discrete Mathematics has ...