Fahad Panolan

activity

20132026

most citedRefined Complexity of PCA with Outliers

6 citations · 14 across the 31 of their papers we have counts for

collaborators

Showing 2015Show all

3 papers · 1 filter

cs.DS2015

Parameterized Algorithms on Perfect Graphs for deletion to $(r, ℓ)$ -graphs

Sudeshna Kolay, Fahad Panolan, Venkatesh Raman +1

For fixed integers $r, ℓ \geq 0$ , a graph $G$ is called an {\em $(r, ℓ)$ -graph} if the vertex set $V (G)$ can be partitioned into $r$ independent sets and $ℓ$ cliques. The cl…

cs.CC2015★ 3 cited

Parameterized Algorithms for Deletion to (r,l)-graphs

Sudeshna Kolay, Fahad Panolan

For fixed integers $r, ℓ \geq 0$ , a graph $G$ is called an {\em $(r, ℓ)$ -graph} if the vertex set $V (G)$ can be partitioned into $r$ independent sets and $ℓ$ cliques. This b…

cs.CC2015

Reconfiguration on sparse graphs

Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan +2

A vertex-subset graph problem Q defines which subsets of the vertices of an input graph are feasible solutions. A reconfiguration variant of a vertex-subset problem asks, given two…

Parameterized Algorithms on Perfect Graphs for deletion to (r,ℓ)-graphs

Parameterized Algorithms for Deletion to (r,l)-graphs

Reconfiguration on sparse graphs

Parameterized Algorithms on Perfect Graphs for deletion to $(r, ℓ)$ -graphs