Reachability in O(log n) Genus Graphs is in Unambiguous. - Chetan Gupta 002; Vimalraj Sharma; Raghunath Tewari (Electron. Colloquium Comput. Complex., 2018)

Reachability in O(log n) Genus Graphs is in Unambiguous Logspace. - Chetan Gupta 002; Vimal Raj Sharma; Raghunath Tewari (STACS, 2019)

Unambiguous Catalytic Computation. - Chetan Gupta 002; Rahul Jain 015; Vimal Raj Sharma; Raghunath Tewari (Electron. Colloquium Comput. Complex., 2019)

Randomized and Symmetric Catalytic Computation. - Samir Datta; Chetan Gupta 002; Rahul Jain 015; Vimal Raj Sharma; Raghunath Tewari (Electron. Colloquium Comput. Complex., 2020)

Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs. - Chetan Gupta 002; Vimal Raj Sharma; Raghunath Tewari (Electron. Colloquium Comput. Complex., 2020)

Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs. - Chetan Gupta 002; Rahul Jain 015; Raghunath Tewari (FSTTCS, 2021)

Reachability and Matching in Single Crossing Minor Free Graphs. - Samir Datta; Chetan Gupta 002; Rahul Jain 015; Anish Mukherjee 001; Vimal Raj Sharma; Raghunath Tewari (FSTTCS, 2021)

Dynamic Meta-Theorems for Distance and Matching. - Samir Datta; Chetan Gupta 002; Rahul Jain 015; Anish Mukherjee 001; Vimal Raj Sharma; Raghunath Tewari (ICALP, 2022)

Sparse Matrix Multiplication in the Low-Bandwidth Model. - Chetan Gupta 002; Juho Hirvonen; Janne H. Korhonen; Jan Studený; Jukka Suomela (SPAA, 2022)

Evaluating Monotone Circuits on Surfaces. - Samir Datta; Chetan Gupta 002 (Electron. Colloquium Comput. Complex., 2022)

Fast Dynamic Programming in Trees in the MPC Model. - Chetan Gupta 002; Rustam Latypov; Yannic Maus; Shreyas Pai; Simo Särkkä; Jan Studený; Jukka Suomela; Jara Uitto; Hossein Vahidi 001 (SPAA, 2023)

The Even-Path Problem in Directed Single-Crossing-Minor-Free Graphs. - Archit Chauhan; Samir Datta; Chetan Gupta 002; Vimal Raj Sharma (MFCS, 2024)

Brief Announcement: Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity. - Chetan Gupta 002; Janne H. Korhonen; Jan Studený; Jukka Suomela; Hossein Vahidi 001 (SPAA, 2024)

Lossy Catalytic Computation. - Chetan Gupta 002; Rahul Jain 015; Vimal Raj Sharma; Raghunath Tewari (CoRR, 2024)

Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity. - Chetan Gupta 002; Janne H. Korhonen; Jan Studený; Jukka Suomela; Hossein Vahidi 001 (SIROCCO, 2025)