3 citations · 3 across the 1 of their papers we have counts for
6 papers
Decomposable Submodular Function Minimization via Maximum Flow
Kyriakos Axiotis, Adam Karczmarz, Anish Mukherjee +2
This paper bridges discrete and continuous optimization approaches for decomposable submodular function minimization, in both the standard and parametric settings. We provide impro…
Dynamic complexity of Reachability: How many changes can we handle?
Samir Datta, Pankaj Kumar, Anish Mukherjee +3
In 2015, it was shown that reachability for arbitrary directed graphs can be updated by first-order formulas after inserting or deleting single edges. Later, in 2018, this was exte…
Space Efficient Algorithms for Breadth-Depth Search
Sankardeep Chakraborty, Anish Mukherjee, Srinivasa Rao Satti
Continuing the recent trend, in this article we design several space-efficient algorithms for two well-known graph search methods. Both these search methods share the same name {\i…
Reachability and Distances under Multiple Changes
Samir Datta, Anish Mukherjee, Nils Vortmeier +1
Recently it was shown that the transitive closure of a directed graph can be updated using first-order formulas after insertions and deletions of single edges in the dynamic descri…
Shortest -Disjoint Paths via Determinants
Samir Datta, Siddharth Iyer, Raghav Kulkarni +1
The well-known -disjoint path problem (-DPP) asks for pairwise vertex-disjoint paths between specified pairs of vertices in a given graph, if they exist. The…
Frameworks for Designing In-place Graph Algorithms
Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman +1
Read-only memory model is a classical model of computation to study time-space tradeoffs of algorithms. One of the classical results on the ROM model is that any sorting algorithm…