Anish Mukherjee

According to our database, Anish Mukherjee authored at least 26 papers between 2016 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

The parameterized complexity of the survivable network design problem.

Andreas Emil Feldmann, Anish Mukherjee, Erik Jan van Leeuwen

J. Comput. Syst. Sci., 2025

2024

Faster Semi-streaming Matchings via Alternating Trees.

Slobodan Mitrovic, Anish Mukherjee, Piotr Sankowski, Wen-Horng Sheu

CoRR, 2024

Modeling Online Paging in Multi-Core Systems.

Mathieu Mari, Anish Mukherjee, Runtian Ren, Piotr Sankowski

CoRR, 2024

Log Diameter Rounds MST Verification and Sensitivity in MPC.

Sam Coy, Artur Czumaj, Gopinath Mishra, Anish Mukherjee

Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

Shortest Disjoint Paths on a Grid.

Mathieu Mari, Anish Mukherjee, Michal Pilipczuk, Piotr Sankowski

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Streaming Graph Algorithms in the Massively Parallel Computation Model.

Artur Czumaj, Gopinath Mishra, Anish Mukherjee

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

Query Maintenance Under Batch Changes with Small-Depth Circuits.

Samir Datta, Asif Khan, Anish Mukherjee, Felix Tschirbs, Nils Vortmeier, Thomas Zeume

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2023

Dynamic Planar Embedding Is in DynFO.

Samir Datta, Asif Khan, Anish Mukherjee

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Approximating Edit Distance in the Fully Dynamic Model.

Tomasz Kociumaka, Anish Mukherjee, Barna Saha

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

Frameworks for designing in-place graph algorithms.

Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti

J. Comput. Syst. Sci., 2022

Improved feature importance computation for tree models based on the Banzhaf value.

Adam Karczmarz, Tomasz P. Michalak, Anish Mukherjee, Piotr Sankowski, Piotr Wygocki

Proceedings of the Uncertainty in Artificial Intelligence, 2022

Subquadratic dynamic path reporting in directed graphs against an adaptive adversary.

Adam Karczmarz, Anish Mukherjee, Piotr Sankowski

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Dynamic Meta-Theorems for Distance and Matching.

Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Improved Feature Importance Computations for Tree Models: Shapley vs. Banzhaf.

Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Piotr Wygocki

CoRR, 2021

Decomposable Submodular Function Minimization via Maximum Flow.

Kyriakos Axiotis, Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Adrian Vladu

Proceedings of the 38th International Conference on Machine Learning, 2021

Reachability and Matching in Single Crossing Minor Free Graphs.

Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2020

Dynamic Complexity of Reachability: How Many Changes Can We Handle?

Samir Datta, Pankaj Kumar, Anish Mukherjee, Anuj Tawari, Nils Vortmeier, Thomas Zeume

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

A Strategy for Dynamic Programs: Start over and Muddle through.

Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier, Thomas Zeume

Log. Methods Comput. Sci., 2019

Planarity, Exclusivity, and Unambiguity.

Eric Allender, Archit Chauhan, Samir Datta, Anish Mukherjee

Electron. Colloquium Comput. Complex., 2019

Space Efficient Algorithms for Breadth-Depth Search.

Sankardeep Chakraborty, Anish Mukherjee, Srinivasa Rao Satti

Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

2018

Reachability Is in DynFO.

Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume

J. ACM, 2018

Planar Maximum Matching: Towards a Parallel Algorithm.

Samir Datta, Raghav Kulkarni, Ashish Kumar, Anish Mukherjee

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Reachability and Distances under Multiple Changes.

Samir Datta, Anish Mukherjee, Nils Vortmeier, Thomas Zeume

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Shortest k-Disjoint Paths via Determinants.

Samir Datta, Siddharth Iyer, Raghav Kulkarni, Anish Mukherjee

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

A Framework for In-place Graph Algorithms.

Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2016

Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs.

Samir Datta, Raghav Kulkarni, Anish Mukherjee

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016