Follow
Anish Mukherjee
Anish Mukherjee
Postdoctoral Fellow, University of Warwick
Verified email at warwick.ac.uk - Homepage
Title
Cited by
Cited by
Year
Reachability is in DynFO
S Datta, R Kulkarni, A Mukherjee, T Schwentick, T Zeume
Journal of the ACM (JACM) 65 (5), 1-24, 2018
472018
Frameworks for designing in-place graph algorithms
S Chakraborty, A Mukherjee, V Raman, SR Satti
Journal of Computer and System Sciences 123, 1-19, 2022
21*2022
A strategy for dynamic programs: Start over and muddle through
S Datta, A Mukherjee, T Schwentick, N Vortmeier, T Zeume
Logical Methods in Computer Science 15, 2019
182019
Reachability and Distances under Multiple Changes
S Datta, A Mukherjee, N Vortmeier, T Zeume
45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018
15*2018
Shortest -Disjoint Paths via Determinants
S Datta, S Iyer, R Kulkarni, A Mukherjee
38th IARCS Annual Conference on Foundations of Software Technology and …, 2018
132018
Improved feature importance computation for tree models based on the Banzhaf value
A Karczmarz, T Michalak, A Mukherjee, P Sankowski, P Wygocki
Uncertainty in Artificial Intelligence, 969-979, 2022
12*2022
The parameterized complexity of the survivable network design problem
AE Feldmann, A Mukherjee, EJ van Leeuwen
Symposium on Simplicity in Algorithms (SOSA), 37-56, 2022
122022
Decomposable submodular function minimization via maximum flow
K Axiotis, A Karczmarz, A Mukherjee, P Sankowski, A Vladu
International Conference on Machine Learning, 446-456, 2021
122021
Subquadratic dynamic path reporting in directed graphs against an adaptive adversary
A Karczmarz, A Mukherjee, P Sankowski
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
102022
Space-efficient approximation scheme for maximum matching in sparse graphs
S Datta, R Kulkarni, A Mukherjee
41st International Symposium on Mathematical Foundations of Computer Science …, 2016
92016
Dynamic Complexity of Reachability: How Many Changes Can We Handle?
S Datta, P Kumar, A Mukherjee, A Tawari, N Vortmeier, T Zeume
47th International Colloquium on Automata, Languages, and Programming (ICALP …, 2020
82020
Space efficient algorithms for breadth-depth search
S Chakraborty, A Mukherjee, SR Satti
International Symposium on Fundamentals of Computation Theory, 201-212, 2019
42019
Planar maximum matching: Towards a parallel algorithm
S Datta, R Kulkarni, A Kumar, A Mukherjee
29th International Symposium on Algorithms and Computation (ISAAC 2018), 2018
42018
Approximating edit distance in the fully dynamic model
T Kociumaka, A Mukherjee, B Saha
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023
32023
Static and Dynamic Complexity of Reachability, Matching and Related Problems
A Mukherjee
PhD thesis, CMI, 2019
32019
Reachability and Matching in Single Crossing Minor Free Graphs
S Datta, C Gupta, R Jain, A Mukherjee, VR Sharma, R Tewari
41st IARCS Annual Conference on Foundations of Software Technology and …, 2021
22021
Planarity, exclusivity, and unambiguity
E Allender, A Chauhan, S Datta, A Mukherjee
Electron. Colloq. Comput. Complex. ECCC 26, 39, 2019
22019
Dynamic Meta-Theorems for Distance and Matching
S Datta, C Gupta, R Jain, A Mukherjee, VR Sharma, R Tewari
49th International Colloquium on Automata, Languages, and Programming (ICALP …, 2021
12021
Log Diameter Rounds MST Verification and Sensitivity in MPC
S Coy, A Czumaj, G Mishra, A Mukherjee
Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and …, 2024
2024
Modeling Online Paging in Multi-Core Systems
M Mari, A Mukherjee, R Ren, P Sankowski
arXiv preprint arXiv:2401.05834, 2024
2024
The system can't perform the operation now. Try again later.
Articles 1–20