Diptarka Chakraborty

Diptarka Chakraborty is an Assistant Professor in the Department of Computer Science at the School of Computing, National University of Singapore (NUS). He obtained his PhD from the Indian Institute of Technology Kanpur in 2016 and held postdoctoral positions at Charles University, Prague, and the Weizmann Institute of Science, Israel.

His educational background includes:

• PhD in Computer Science and Engineering, Indian Institute of Technology Kanpur, 2016

Dr. Chakraborty's research lies at the intersection of Theoretical Computer Science and Algorithms, specializing in sublinear algorithms, approximation algorithms, graph algorithms, and data structures for massive datasets. His work addresses computational hardness in edit distance, rank aggregation, and fault-tolerant graph structures, with recent emphasis on algorithmic fairness and streaming applications.

Analysis of his 2020-2025 publications reveals dominant trends in fairness-constrained algorithms (e.g., fair rank aggregation) and scalable techniques for massive data (e.g., clustering permutations in streaming models), alongside foundational contributions to equivalence testing, model counting, and reachability under failures.

His scientific contributions have been recognized with:

• Faculty Teaching Excellence Award 2024
• Google South & Southeast Asia Research Award 2022
• Best Paper Award at FOCS 2018
• IBM Research India Outstanding Ph.D. Student Award 2015-16

Dr. Chakraborty actively mentors two PhD students and multiple research fellows while leading three major research projects: massive data handling under edit metrics, fair rank aggregation, and fault-tolerant graph structures. His Google Research Award supports investigations into computational challenges of fairness.

He maintains an active research group with international collaborations and regular seminar participation across institutions including IITs, TIFR, and UC campuses.