Computing a Rectilinear Shortest Path amid Splinegons in Plane. - Tameem Choudhury; R. Inkulu (COCOA, 2018)

Maintaining the Visibility Graph of a Dynamic Simple Polygon. - Tameem Choudhury; R. Inkulu (CALDAM, 2019)

Computing an L1 shortest path among splinegonal obstacles in the plane. - Tameem Choudhury; R. Inkulu (J. Comb. Optim., 2022)

Depth-3 Circuit Lower Bounds for k-OV. - Tameem Choudhury; Karteek Sreenivasaiah (Electron. Colloquium Comput. Complex., 2023)