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

3 papers · 1 filter

cs.DS2014

Finding Even Subgraphs Even Faster

Prachi Goyal, Pranabendu Misra, Fahad Panolan +2

Problems of the following kind have been the focus of much recent research in the realm of parameterized complexity: Given an input graph (digraph) on $n$ vertices and a positive i…

cs.DS2014

Deterministic Truncation of Linear Matroids

Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan +1

Let $M = (E, I)$ be a matroid. A {\em $k$ -truncation} of $M$ is a matroid { $M^{'} = (E, I^{'})$ } such that for any $A \subseteq E$ , $A \in I^{'}$ if and only if $∣ A ∣ \leq k$ and…

cs.DS2014

Representative Sets of Product Families

Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan +1

A subfamily $F^{'}$ of a set family $F$ is said to $q$ -{\em represent} $F$ if for every $A \in F$ and $B$ of size $q$ such that $A \cap B = \emptyset$ ther…