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 2015Show all

2 papers · 1 filter

cs.DS2015

A faster FPT Algorithm and a smaller Kernel for Block Graph Vertex Deletion

Akanksha Agrawal, Sudeshna Kolay, Daniel Lokshtanov +1

A graph is called a \emph{block graph} if each maximal -connected component of is a clique. In this paper we study the Block Graph Vertex Deletion from the perspective o…

cs.DS2015★ 2 cited

Simultaneous Feedback Vertex Set: A Parameterized Perspective

Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad +1

Given a family of graphs , a graph , and a positive integer , the -Deletion problem asks whether we can delete at most vertices from to obta…