3 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…