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 cs.DMShow all

2 papers · 1 filter

cs.DM2024

Parameterized Saga of First-Fit and Last-Fit Coloring

Akanksha Agrawal, Daniel Lokshtanov, Fahad Panolan +2

The classic greedy coloring (first-fit) algorithm considers the vertices of an input graph $G$ in a given order and assigns the first available color to each vertex $v$ in $G$ . In…

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…