The conference will consist of plenary talks, invited lectures,
mini-symposia and poster sessions, encompassing all areas of Discrete
Mathematics and its applications.
A mini-symposium will involve three speakers, each delivering a
talk for 45 minutes, on a single chosen theme.
The topics for the mini-symposia include:
Domination Theory
Graph Colouring
Spectral Graph Theory
Graph Decompositions
Design Theory
Coding Theory and Cryptography
Approximation and Randomized Algorithms
Combinatorial Optimization
Discrete Mathematics in other sciences |
Proposals for conduct of mini-symposia in other topics are also being
planned.
All poster session papers will be reviewed.
The following experts have agreed to coordinate mini-symposia in the topics noted against their names:
| S. Arumugam |
Domination Theory |
| P. Paulraja |
Graph Decompositions |
| Andre Raspaud |
Graph Coloring |
| H.B.Walikar |
Spectral Graph Theory |
| Mike Fellows |
Combinatorial Extremal Structure theory
and its Algorithmic Applications |
To see the Information on Plenary & Invited Speakers , please click on the link. |
