I am an assistant professor in the Department of Computer Science and Engineering at Indian Institute of Information Technology, Guwahati. I did Ph.D. from Indian Institute of Technology, Delhi under Prof B. S. Panda. After that, I joined Advanced Computing and Microelectronics Unit at Indian Statistical Institute Kolkata for my postdoc.
Research Interests:
My broad research interests span the area of Discrete Mathematics and Theoretical Computer Science. In my Ph.D. thesis, I have worked on liar's domination problem, a variant of classical domination problem. I addressed algorithmic questions, both exact and approximation algorithms, of minimum liar's domination problems and its variants. Currently, I am interested in other areas of theoretical computer science, like parameterized complexity, randomized algorithms, random graphs, etc. I am currently working in the following areas:
- The probabilistic method
- Random graphs
- Graph drawing
- Clustering and related sampling question
- NP-hard problems in the semi-streaming model
Teaching:
I have taught the following courses at IIIT Guwahati so far:
- CS402: Advanced graph algorithms, Monsoon semester:2016-2017
- CS362: Topics in algorithms, Winter semester: 2016-2017
Selected Publications:
- Algorithmic aspects of disjunctive domination in graphs,
with B. S. Panda and Arti Pandey,
accepted in Journal of Combinatorial Optimization, 2017.
[A part of this worked appeared in COCOON 2015.] - Linear kernels for $k$-tuple and liar's domination in bounded genus graphs,
with Arijit Bishnu and Arijit Ghosh,
accepted in Discrete Applied Mathematics, 2016. -
(1,j)-set problem in graphs,
with Arijit Bishnu, Kunal Dutta and Arijit Ghosh,
Discrete Mathematics, 339: 2515--2525, 2016. - Hardness results, approximation and exact algorithms for liar's domination problem in graphs,
with B. S. Panda and D. Pradhan,
Theoretical Computer Science, 573: 26--42, 2015. - Liar's domination in graphs: complexity and algorithm,
with B. S. Panda,
Discrete Applied Mathematics, 161: 1085--1092, 2013.