Mohit Daga

Hi! I am pursuing my Ph.D. at the Theoretical Computer Science Division in the Computer Science Department at the EECS  School. Previously, I was a Masters student at IIT Madras.

My research revolves around Graph Algorithms.

During the year 2020, I was the Vice Chairperson of the PhD Chapter at KTH (Doktorandsektionen vid THS) and a member of KTH Faculty Council.

News:

• New article: Edge-Cuts and Spanning Trees. (preprint)

• Invited participant at Shonan Meeting on Distributed Graph Algorithms, held at Shonan Village Center, Tokyo in November, 2019.

• Received a grant of 700USD from ACM-SIG to attend ACM Symposium on Theory of Computing (STOC 2019), Phoenix, AZ, USA.

• I attended Highlights of Algorithms in June'19 held at Copenhagen.

• Distributed Edge Connectivity in Sublinear Time[pdf]with Danupon Nanongkai, Monika Henzinger and Thatchaphol Saranurak accepted to be published at 51st ACM Symposium on Theory of Computing (STOC 2019).

• I attended Highlights of Algorithms in June'18 held at Amsterdam and FOCS'18 held at Paris.

• Interview given to Chennai-36, the alumni blog of Indian Institute of Technology - Madras, India.

• I was invited to participate at Hawaiin Workshop on Parallel Algorithms and Data Structures, held at UH, Mānoa, Hawaii, USA in December, 2017.