Anil Maheshwari

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2025

Triangle-Covered Graphs: Algorithms, Complexity, and Structure

Amirali Madani, Anil Maheshwari, Babak Miraftab +1

The widely studied edge modification problems ask how to minimally alter a graph to satisfy certain structural properties. In this paper, we introduce and study a new edge modifica…

cs.DS2025

Algorithms and Hardness Results for the $(k, ℓ)$ -Cover Problem

Amirali Madani, Anil Maheshwari, Babak Miraftab +1

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

Triangle-Covered Graphs: Algorithms, Complexity, and Structure

Algorithms and Hardness Results for the (k,ℓ)-Cover Problem

Algorithms and Hardness Results for the $(k, ℓ)$ -Cover Problem