Combinatorial Algorithms involves the study of problems and structures that lend themselves to a solutions with a combinatoric flavour (i.e., combinations of objects belonging to a finite set). These may involve generating all the possible structures of a certain type, enumerating (counting) the number of different structures of a different type, or searching for at least one example of a structure of a particular type. The research group focuses on theoretical and algorithmic issues involving such problems.

The Combinatorial Algorithms Group is a collaboration between the Departments of Computer Science, Mathematics and Statistics, and Electrical and Computer Engineering at the University of Victoria. Research interests of the group span a wide range of topics: Graph Theory and Graph Algorithms, Computational Geometry, Randomized Algorithms, Computational Complexity, Network Reliability, Topological Graph Theory, Computational Biology, Cryptography and Design Theory.