Anish Mukherjee

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