3 citations · 3 across the 1 of their papers we have counts for
5 papers
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…
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 .…
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…
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…
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…