Algorithms & Data group
This group is dedicated to the study of theoretical and applied algorithms. The study on theoretical algorithms focuses on the design and analysis of combinatorial algorithms and approximation algorithms for graph and other application domain problems, while the study of applied algorithms focuses on devising cost-efficient algorithms for emerging applications arisen from Internet, bioinformatics, wireless ad hoc mobile and/or sensor networks, and WDM optical networks, in-network information processing on sensor networks (query optimization and data gathering etc), social networks, etc.
Staff & students
Research areas
- Energy-efficient routing protocol design and analysis for wireless ad hoc/sensor networks (Liang and McKay; also 3rd year student Yuzhen Liu)
- Query optimization for energy-constrained sensor networks (Liang; also 1st year student Baichen Chen)
- Protein sequence analysis [bio-informatics] (Liang and McKay)
- Data gathering and sensing coverage in wireless sensor networks (Liang)
- Approximation algorithms design for combinatorial problems (Liang and McKay)
- Structure enumeration (McKay)
- Isomorphism of linear codes (McKay and Monteith)
- Asymptotic enumeration (McKay)
- Random graphs (McKay)
Available student projects
Projects with Emeritus Professor Richard Brent (1 available) »
Projects with Assoc Professor Weifa Liang (4 available) »
» More projects at CECS
