A. Agrawal

activity

20142026

most citedClustering What Matters: Optimal Approximation for Clustering with Outliers

2 citations · 8 across the 13 of their papers we have counts for

collaborators

Showing 2020Show all

2 papers · 1 filter

cs.DM2020

Parameterized Complexity of Maximum Edge Colorable Subgraph

Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu +2

A graph $H$ is {\em $p$ -edge colorable} if there is a coloring $ψ : E (H) \to {1, 2, \dots, p}$ , such that for distinct $uv, v w \in E (H)$ , we have $ψ (uv) \neq = ψ (v w)$ . The {\sc…

cs.CG2020★ 2 cited

The Parameterized Complexity of Guarding Almost Convex Polygons

Akanksha Agrawal, Kristine V. K. Knudsen, Daniel Lokshtanov +2

Art Gallery is a fundamental visibility problem in Computational Geometry. The input consists of a simple polygon P, (possibly infinite) sets G and C of points within P, and an int…