Graph cover problems form a critical area within discrete optimisation and theoretical computer science, addressing the challenge of selecting subsets of vertices (or edges) that satisfy predetermined ...

A puzzle that has long flummoxed computers and the scientists who program them has suddenly become far more manageable. A new algorithm efficiently solves the graph isomorphism problem, computer ...

Graph algorithms and spanners have emerged as a critical area of research in computer science, underpinning both theoretical advances and practical applications such as network design, routing ...

Back in the hazy olden days of the pre-2000s, navigating between two locations generally required someone to whip out a paper map and painstakingly figure out the most optimal route between those ...

*Note: This course description is only applicable for the Computer Science Post-Baccalaureate program. Additionally, students must always refer to course syllabus for the most up to date information.

How would you feel if you saw demand for your favorite topic — which also happens to be your line of business — grow 1,000% in just two years’ time? Vindicated, overjoyed, and a bit overstretched in ...