default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnish Mukherjee 0001
Person information
- affiliation: University of Warsaw, Poland
- affiliation (former): Charles University, Prague, Czech Republic
- affiliation (former): Chennai Mathematical Institute, India
Other persons with the same name
- Anish Mukherjee 0002
![[0000-0002-4875-4157]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0002-4875-4157")
— Indian Statistical Institute, Kolkata, India - Anish Mukherjee 0003 — VIT University, School of Electronic Engineering, Chennai, India
- Anish Mukherjee 0004 — Indian Institute of Technology Roorkee, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c21]Samir Datta, Asif Khan, Anish Mukherjee, Felix Tschirbs, Nils Vortmeier, Thomas Zeume:
Query Maintenance Under Batch Changes with Small-Depth Circuits. MFCS 2024: 46:1-46:16- [c20]Artur Czumaj, Gopinath Mishra, Anish Mukherjee:
Streaming Graph Algorithms in the Massively Parallel Computation Model. PODC 2024: 496-507 - [c19]Mathieu Mari, Anish Mukherjee, Michal Pilipczuk, Piotr Sankowski:
Shortest Disjoint Paths on a Grid. SODA 2024: 346-365 - [c18]Sam Coy, Artur Czumaj, Gopinath Mishra, Anish Mukherjee:
Log Diameter Rounds MST Verification and Sensitivity in MPC. SPAA 2024: 269-280 - [i19]Mathieu Mari, Anish Mukherjee, Runtian Ren, Piotr Sankowski:
Modeling Online Paging in Multi-Core Systems. CoRR abs/2401.05834 (2024) - [i18]Samir Datta, Asif Khan, Anish Mukherjee, Felix Tschirbs, Nils Vortmeier, Thomas Zeume:
Query maintenance under batch changes with small-depth circuits. CoRR abs/2407.20031 (2024) - [i17]Sam Coy, Artur Czumaj, Gopinath Mishra, Anish Mukherjee:
Log Diameter Rounds MST Verification and Sensitivity in MPC. CoRR abs/2408.00398 (2024) - 2023
- [c17]Tomasz Kociumaka, Anish Mukherjee, Barna Saha:
Approximating Edit Distance in the Fully Dynamic Model. FOCS 2023: 1628-1638 - [c16]Samir Datta, Asif Khan, Anish Mukherjee:
Dynamic Planar Embedding Is in DynFO. MFCS 2023: 39:1-39:15 - [i16]Tomasz Kociumaka, Anish Mukherjee, Barna Saha:
Approximating Edit Distance in the Fully Dynamic Model. CoRR abs/2307.07175 (2023) - [i15]Samir Datta, Asif Khan, Anish Mukherjee:
Dynamic Planar Embedding is in DynFO. CoRR abs/2307.09473 (2023) - 2022
- [j3]Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti:
Frameworks for designing in-place graph algorithms. J. Comput. Syst. Sci. 123: 1-19 (2022) - [c15]Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari:
Dynamic Meta-Theorems for Distance and Matching. ICALP 2022: 118:1-118:20 - [c14]Andreas Emil Feldmann, Anish Mukherjee, Erik Jan van Leeuwen:
The Parameterized Complexity of the Survivable Network Design Problem. SOSA 2022: 37-56 - [c13]Adam Karczmarz, Anish Mukherjee, Piotr Sankowski:
Subquadratic dynamic path reporting in directed graphs against an adaptive adversary. STOC 2022: 1643-1656 - [c12]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: 969-979 - [i14]Adam Karczmarz, Anish Mukherjee, Piotr Sankowski:
Subquadratic Dynamic Path Reporting in Directed Graphs Against an Adaptive Adversary. CoRR abs/2203.16992 (2022) - 2021
- [c11]Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari:
Reachability and Matching in Single Crossing Minor Free Graphs. FSTTCS 2021: 16:1-16:16 - [c10]Kyriakos Axiotis, Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Adrian Vladu:
Decomposable Submodular Function Minimization via Maximum Flow. ICML 2021: 446-456 - [i13]Kyriakos Axiotis, Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Adrian Vladu:
Decomposable Submodular Function Minimization via Maximum Flow. CoRR abs/2103.03868 (2021) - [i12]Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari:
Reachability and Matching in Single Crossing Minor Free Graphs. CoRR abs/2103.13940 (2021) - [i11]Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Piotr Wygocki:
Improved Feature Importance Computations for Tree Models: Shapley vs. Banzhaf. CoRR abs/2108.04126 (2021) - [i10]Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari:
Dynamic Meta-theorems for Distance and Matching. CoRR abs/2109.01875 (2021) - [i9]Andreas Emil Feldmann, Anish Mukherjee, Erik Jan van Leeuwen:
The Parameterized Complexity of the Survivable Network Design Problem. CoRR abs/2111.02295 (2021) - 2020
- [c9]Samir Datta, Pankaj Kumar, Anish Mukherjee, Anuj Tawari, Nils Vortmeier, Thomas Zeume:
Dynamic Complexity of Reachability: How Many Changes Can We Handle? ICALP 2020: 122:1-122:19 - [i8]Samir Datta, Pankaj Kumar, Anish Mukherjee, Anuj Tawari, Nils Vortmeier, Thomas Zeume:
Dynamic complexity of Reachability: How many changes can we handle? CoRR abs/2004.12739 (2020)
2010 – 2019
- 2019
- [j2]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) - [c8]Sankardeep Chakraborty, Anish Mukherjee, Srinivasa Rao Satti:
Space Efficient Algorithms for Breadth-Depth Search. FCT 2019: 201-212 - [i7]Sankardeep Chakraborty, Anish Mukherjee, Srinivasa Rao Satti:
Space Efficient Algorithms for Breadth-Depth Search. CoRR abs/1906.07874 (2019) - [i6]Eric Allender, Archit Chauhan, Samir Datta, Anish Mukherjee:
Planarity, Exclusivity, and Unambiguity. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j1]Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume:
Reachability Is in DynFO. J. ACM 65(5): 33:1-33:24 (2018) - [c7]Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti:
A Framework for In-place Graph Algorithms. ESA 2018: 13:1-13:16 - [c6]Samir Datta, Siddharth Iyer, Raghav Kulkarni, Anish Mukherjee:
Shortest k-Disjoint Paths via Determinants. FSTTCS 2018: 19:1-19:21 - [c5]Samir Datta, Anish Mukherjee, Nils Vortmeier, Thomas Zeume:
Reachability and Distances under Multiple Changes. ICALP 2018: 120:1-120:14 - [c4]Samir Datta, Raghav Kulkarni, Ashish Kumar, Anish Mukherjee:
Planar Maximum Matching: Towards a Parallel Algorithm. ISAAC 2018: 21:1-21:13 - [i5]Samir Datta, Siddharth Iyer, Raghav Kulkarni, Anish Mukherjee:
Shortest k-Disjoint Paths via Determinants. CoRR abs/1802.01338 (2018) - [i4]Samir Datta, Anish Mukherjee, Nils Vortmeier, Thomas Zeume:
Reachability and Distances under Multiple Changes. CoRR abs/1804.08555 (2018) - 2017
- [c3]Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
A Strategy for Dynamic Programs: Start over and Muddle Through. ICALP 2017: 98:1-98:14 - [i3]Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
A Strategy for Dynamic Programs: Start over and Muddle through. CoRR abs/1704.07998 (2017) - [i2]Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti:
Frameworks for Designing In-place Graph Algorithms. CoRR abs/1711.09859 (2017) - 2016
- [c2]Samir Datta, Raghav Kulkarni, Anish Mukherjee:
Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs. MFCS 2016: 28:1-28:12 - 2015
- [c1]Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume:
Reachability is in DynFO. ICALP (2) 2015: 159-170 - [i1]Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume:
Reachability is in DynFO. CoRR abs/1502.07467 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
