activity
20202025
most citedAlgorithms and complexity for geodetic sets on planar and chordal graphs

3 citations · 3 across the 6 of their papers we have counts for

collaborators

7 papers

cs.CG2025

Partial Domination in Some Geometric Intersection Graphs and Some Complexity Results

Madhura Dutta, Anil Maheshwari, Subhas C. Nandy +1

{\em Partial domination problem} is a generalization of the {\em minimum dominating set problem} on graphs. Here, instead of dominating all the nodes, one asks to dominate at least…

cs.CC2025

Deciding if a DAG is Interesting is Hard

Jean-Lou De Carufel, Anil Maheshwari, Saeed Odak +3

The \emph{interestingness score} of a directed path in an edge-weighted directed graph is defined as $\texttt{score}(Π) := \sum_{i=1}^\ell w(e…

cs.DS2025

Algorithms and Hardness Results for the -Cover Problem

Amirali Madani, Anil Maheshwari, Babak Miraftab +1

A connected graph has a -cover if each of its edges is contained in at least cliques of order . Motivated by recent advances in extremal combinatorics and the l…

cs.DS2024

Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network

Bubai Manna, Bodhayan Roy, Vorapong Suppakitpaisarn

In this research, we examine the minsum flow problem in dynamic path networks where flows are represented as discrete and weighted sets. The minsum flow problem has been widely stu…

cs.DS2024

On Approximating the Dynamic and Discrete Network Flow Problem

Bubai Manna, Bodhayan Roy, Vorapong Suppakitpaisarn

We examine the dynamic network flow problem under the assumption that the flow consists of discrete units. The dynamic network flow problem is commonly addressed in the context of…

cs.CG2024

New Complexity and Algorithmic Bounds for Minimum Consistent Subsets

Aritra Banik, Sayani Das, Anil Maheshwari +6

In the Minimum Consistent Subset (MCS) problem, we are presented with a connected simple undirected graph , consisting of a vertex set of size and an edge set .…

cs.DM2020★ 3 cited

Algorithms and complexity for geodetic sets on planar and chordal graphs

Dibyayan Chakraborty, Harmender Gahlawat, Bodhayan Roy

A set of vertices of a graph is a \emph{geodetic set} if every vertex of lies in a shortest path between some pair of vertices of . The \textsc{Minimum Geodetic Set…