We learn from our alumni in this interaction series, often technically, sometimes semi-technically.

G Ramakrishna IIT Tirupati

Dr. G. Ramakrishna is working as an Assistant Professor in the Computer Science and Engineering Department at IIT Tirupati. Prior to this, he has worked at IIIT Sri City and Microsoft Private Limited, Hyderabad. He has finished his MS by Research, and Ph.D. from IIT Madras. He works broadly on Graph Algorithms, and Parallel Computing.

    1. 	How to find cut vertices of an unweighted graph in the serial setting?
	Tarjan's algorithm, which is based on a Depth-First Search (DFS) tree.

    2. 	How to find cut vertices of an unweighted graph in the parallel setting? 
	Slot's algorithm, which is based on a Breadth-First Search (BFS) tree [HiPC 2014].

    3.	How to update the cut vertices of an unweighted graph in the parallel setting, when a batch of edges are added/deleted? 
	Our multi-core algorithm, which is based on a spanning tree, need not be a BFS or DFS tree [IPDPS 2022]. 

Organizers