DISCRETE MATHEMATICS FOR COMPUTER SCIENCE

Discrete mathematics is the branch of mathematics that studies the underlying principles which govern discrete structures and the binary universe. It has become popular in recent decades because of its applications to computer science and its bridging role between mathematics and communications and computing. Theory and techniques in discrete mathematics are well-coupled with applications and implementations. They also have the remarkable feature of being versatile and applicable to many disparate problems in computational biology, information retrieval, network design.


Research topics
ALGORITHMICS

Analysis of algorithms; problem complexity; approximation algorithms for network reliability and covering; graph drawing; combinatorial algorithms for physics.


COMBINATORICS AND GRAPH THEORY

Design theory; combinatorics on words; edge and vertex colouring; stable sets; dominating sets; flow and connectivity (cuts and cycles); matching (assignment).


TEACHING MATHEMATICS

Educational technology.


- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -