Diptendu Chatterjee has worked on the topic "Hardness and Approximation of Some Graph Theoretic Problems" during his Ph.D. at ISI, Kolkata. His research interests include Combinatorics, Graph Theory, Algorithms and Combinatorial Optimization. He is also interested in application of graph theoretic problems in different fields like Blockchain Technologies, etc. Prior to joining BITS Pilani, Diptendu worked as a Visiting Scientist at R C Bose Centre for Cryptology and Security in ISI, Kolkata for a brief period of time.