1. Theoretical Computer Science, Combinatorics

1. Algorithms

2. Combinatorial Optimization

3. Graph Theory and Combinatorics

Research

1. IMSc Chennai

2. Anna University Chennai

3. IISER Pune

1. MAT104T Calculus

2. MAT105T Differential Equations

3. MAT204T Linear Algebra

4. MAT205T Probability Theory

5. MAT502T Randomization and Approximation

1. M. Mahajan, R. Rama, S. Vijayakumar: On sorting by 3-bounded transpositions: Discrete Mathematics 306(14): 1569-1585 (2006)

2. M. Mahajan, R. Rama, V. Raman, S. Vijayakumar: Approximate block sorting: International Journal of Foundations of Computer Science 17(2): 337-355 (2006)

3. M. Mahajan, R. Rama, S. Vijayakumar: Block sorting: a characterization and some heuristics: Nordic Journal of Computing 14: 126-150 (2007)

1. M. Mahajan, R. Rama, S. Vijayakumar: On sorting by 3-bounded transpositions: R.C. Bose Centenary Symposium on Discrete Mathematics and Applications, 2002, ISI Kolkata. Electronic Notes in Discrete Mathematics 15: 117-120 (2002)

2. M. Mahajan, R. Rama, V. Raman, S. Vijayakumar: Merging and Sorting By Strip Moves. FSTTCS 2003: 314-325

3. M. Mahajan, R. Rama, S. Vijayakumar: Towards Constructing Optimal Strip Move Sequences. COCOON 2004: 33-42

4. M. A. Shalu, S. Vijayakumar, T. P. Sandhya: A Lower Bound of the cd-Chromatic Number and Its Complexity. CALDAM 2017: 344-355