Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs. - Samir Datta; Raghav Kulkarni; Anish Mukherjee 001 (MFCS, 2016)

A Framework for In-place Graph Algorithms. - Sankardeep Chakraborty; Anish Mukherjee 001; Venkatesh Raman 001; Srinivasa Rao Satti (ESA, 2018)

Shortest k-Disjoint Paths via Determinants. - Samir Datta; Siddharth Iyer; Raghav Kulkarni; Anish Mukherjee 001 (FSTTCS, 2018)

Reachability and Distances under Multiple Changes. - Samir Datta; Anish Mukherjee 001; Nils Vortmeier; Thomas Zeume (ICALP, 2018)

Planar Maximum Matching: Towards a Parallel Algorithm. - Samir Datta; Raghav Kulkarni; Ashish Kumar; Anish Mukherjee 001 (ISAAC, 2018)

Reachability Is in DynFO. - Samir Datta; Raghav Kulkarni; Anish Mukherjee 001; Thomas Schwentick; Thomas Zeume (J. ACM, 2018)

Space Efficient Algorithms for Breadth-Depth Search. - Sankardeep Chakraborty; Anish Mukherjee 001; Srinivasa Rao Satti (FCT, 2019)

Planarity, Exclusivity, and Unambiguity. - Eric Allender; Archit Chauhan; Samir Datta; Anish Mukherjee 001 (Electron. Colloquium Comput. Complex., 2019)

A Strategy for Dynamic Programs: Start over and Muddle through. - Samir Datta; Anish Mukherjee 001; Thomas Schwentick; Nils Vortmeier; Thomas Zeume (Log. Methods Comput. Sci., 2019)

Dynamic Complexity of Reachability: How Many Changes Can We Handle? - Samir Datta; Pankaj Kumar; Anish Mukherjee 001; Anuj Tawari; Nils Vortmeier; Thomas Zeume (ICALP, 2020)

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)

Decomposable Submodular Function Minimization via Maximum Flow. - Kyriakos Axiotis; Adam Karczmarz; Anish Mukherjee 001; Piotr Sankowski; Adrian Vladu (ICML, 2021)

Improved Feature Importance Computations for Tree Models: Shapley vs. Banzhaf. - Adam Karczmarz; Anish Mukherjee 001; Piotr Sankowski; Piotr Wygocki (CoRR, 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)

Subquadratic dynamic path reporting in directed graphs against an adaptive adversary. - Adam Karczmarz; Anish Mukherjee 001; Piotr Sankowski (STOC, 2022)

Improved feature importance computation for tree models based on the Banzhaf value. - Adam Karczmarz; Tomasz P. Michalak; Anish Mukherjee 001; Piotr Sankowski; Piotr Wygocki (UAI, 2022)

Frameworks for designing in-place graph algorithms. - Sankardeep Chakraborty; Anish Mukherjee 001; Venkatesh Raman 001; Srinivasa Rao Satti (J. Comput. Syst. Sci., 2022)

Approximating Edit Distance in the Fully Dynamic Model. - Tomasz Kociumaka; Anish Mukherjee 001; Barna Saha (FOCS, 2023)

Dynamic Planar Embedding Is in DynFO. - Samir Datta; Asif Khan 009; Anish Mukherjee 001 (MFCS, 2023)

Query Maintenance Under Batch Changes with Small-Depth Circuits. - Samir Datta; Asif Khan 009; Anish Mukherjee 001; Felix Tschirbs; Nils Vortmeier; Thomas Zeume (MFCS, 2024)

Streaming Graph Algorithms in the Massively Parallel Computation Model. - Artur Czumaj; Gopinath Mishra; Anish Mukherjee 001 (PODC, 2024)

Shortest Disjoint Paths on a Grid. - Mathieu Mari; Anish Mukherjee 001; Michal Pilipczuk; Piotr Sankowski (SODA, 2024)

Log Diameter Rounds MST Verification and Sensitivity in MPC. - Sam Coy; Artur Czumaj; Gopinath Mishra; Anish Mukherjee 001 (SPAA, 2024)

Modeling Online Paging in Multi-Core Systems. - Mathieu Mari; Anish Mukherjee 001; Runtian Ren; Piotr Sankowski (CoRR, 2024)

Faster Semi-Streaming Matchings via Alternating Trees. - Slobodan Mitrovic; Anish Mukherjee 001; Piotr Sankowski; Wen-Horng Sheu (ICALP, 2025)

The parameterized complexity of the survivable network design problem. - Andreas Emil Feldmann; Anish Mukherjee 001; Erik Jan van Leeuwen (J. Comput. Syst. Sci., 2025)