Anish Mukherjee

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 38

Top Topics

Feature Importance

Maximum Matching

Top Venues

Publications

Mathieu Mari, Anish Mukherjee, Runtian Ren, Piotr Sankowski
Modeling Online Paging in Multi-Core Systems. CoRR (2024)
Samir Datta, Asif Khan, Anish Mukherjee, Felix Tschirbs, Nils Vortmeier, Thomas Zeume
Query maintenance under batch changes with small-depth circuits. CoRR (2024)
Artur Czumaj, Gopinath Mishra, Anish Mukherjee
Streaming Graph Algorithms in the Massively Parallel Computation Model. PODC (2024)
Mathieu Mari, Anish Mukherjee, Michal Pilipczuk, Piotr Sankowski
Shortest Disjoint Paths on a Grid. SODA (2024)
Samir Datta, Asif Khan, Anish Mukherjee, Felix Tschirbs, Nils Vortmeier, Thomas Zeume
Query Maintenance Under Batch Changes with Small-Depth Circuits. MFCS (2024)
Sam Coy, Artur Czumaj, Gopinath Mishra, Anish Mukherjee
Log Diameter Rounds MST Verification and Sensitivity in MPC. SPAA (2024)
Samir Datta, Asif Khan, Anish Mukherjee
Dynamic Planar Embedding is in DynFO. CoRR (2023)
Tomasz Kociumaka, Anish Mukherjee, Barna Saha
Approximating Edit Distance in the Fully Dynamic Model. FOCS (2023)
Samir Datta, Asif Khan, Anish Mukherjee
Dynamic Planar Embedding Is in DynFO. MFCS (2023)
Adam Karczmarz, Anish Mukherjee, Piotr Sankowski
Subquadratic dynamic path reporting in directed graphs against an adaptive adversary. STOC (2022)
Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari
Dynamic Meta-Theorems for Distance and Matching. ICALP (2022)
Adam Karczmarz, Tomasz P. Michalak, Anish Mukherjee, Piotr Sankowski, Piotr Wygocki
Improved feature importance computation for tree models based on the Banzhaf value. UAI (2022)
Adam Karczmarz, Anish Mukherjee, Piotr Sankowski
Subquadratic Dynamic Path Reporting in Directed Graphs Against an Adaptive Adversary. CoRR (2022)
Andreas Emil Feldmann, Anish Mukherjee, Erik Jan van Leeuwen
The Parameterized Complexity of the Survivable Network Design Problem. SOSA (2022)
Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti
Frameworks for designing in-place graph algorithms. J. Comput. Syst. Sci. 123 (2022)
Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari
Reachability and Matching in Single Crossing Minor Free Graphs. CoRR (2021)
Kyriakos Axiotis, Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Adrian Vladu
Decomposable Submodular Function Minimization via Maximum Flow. ICML (2021)
Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari
Reachability and Matching in Single Crossing Minor Free Graphs. FSTTCS (2021)
Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Piotr Wygocki
Improved Feature Importance Computations for Tree Models: Shapley vs. Banzhaf. CoRR (2021)
Kyriakos Axiotis, Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Adrian Vladu
Decomposable Submodular Function Minimization via Maximum Flow. CoRR (2021)
Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari
Dynamic Meta-theorems for Distance and Matching. CoRR (2021)
Samir Datta, Pankaj Kumar, Anish Mukherjee, Anuj Tawari, Nils Vortmeier, Thomas Zeume
Dynamic complexity of Reachability: How many changes can we handle? CoRR (2020)
Samir Datta, Pankaj Kumar, Anish Mukherjee, Anuj Tawari, Nils Vortmeier, Thomas Zeume
Dynamic Complexity of Reachability: How Many Changes Can We Handle? ICALP (2020)
Sankardeep Chakraborty, Anish Mukherjee, Srinivasa Rao Satti
Space Efficient Algorithms for Breadth-Depth Search. FCT (2019)
Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier, Thomas Zeume
A Strategy for Dynamic Programs: Start over and Muddle through. Log. Methods Comput. Sci. 15 (2) (2019)
Sankardeep Chakraborty, Anish Mukherjee, Srinivasa Rao Satti
Space Efficient Algorithms for Breadth-Depth Search. CoRR (2019)
Eric Allender, Archit Chauhan, Samir Datta, Anish Mukherjee
Planarity, Exclusivity, and Unambiguity. Electron. Colloquium Comput. Complex. 26 (2019)
Samir Datta, Raghav Kulkarni, Ashish Kumar, Anish Mukherjee
Planar Maximum Matching: Towards a Parallel Algorithm. ISAAC (2018)
Samir Datta, Anish Mukherjee, Nils Vortmeier, Thomas Zeume
Reachability and Distances under Multiple Changes. ICALP (2018)
Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume
Reachability Is in DynFO. J. ACM 65 (5) (2018)
Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti
A Framework for In-place Graph Algorithms. ESA (2018)
Samir Datta, Anish Mukherjee, Nils Vortmeier, Thomas Zeume
Reachability and Distances under Multiple Changes. CoRR (2018)
Samir Datta, Siddharth Iyer, Raghav Kulkarni, Anish Mukherjee
Shortest k-Disjoint Paths via Determinants. FSTTCS (2018)
Samir Datta, Siddharth Iyer, Raghav Kulkarni, Anish Mukherjee
Shortest k-Disjoint Paths via Determinants. CoRR (2018)
Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier, Thomas Zeume
A Strategy for Dynamic Programs: Start over and Muddle Through. ICALP (2017)
Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier, Thomas Zeume
A Strategy for Dynamic Programs: Start over and Muddle through. CoRR (2017)
Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti
Frameworks for Designing In-place Graph Algorithms. CoRR (2017)
Samir Datta, Raghav Kulkarni, Anish Mukherjee
Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs. MFCS (2016)
Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume
Reachability is in DynFO. CoRR (2015)
Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume
Reachability is in DynFO. ICALP (2) (2015)