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

3 papers · 1 filter

cs.CG2022

A Framework for Approximation Schemes on Disk Graphs

Daniel Lokshtanov, Fahad Panolan, Saket Saurabh +2

We initiate a systematic study of approximation schemes for fundamental optimization problems on disk graphs, a common generalization of both planar graphs and unit-disk graphs. Ou…

cs.LG2022

Boolean and $F_{p}$ -Matrix Factorization: From Theory to Practice

Fedor Fomin, Fahad Panolan, Anurag Patil +1

Boolean Matrix Factorization (BMF) aims to find an approximation of a given binary matrix as the Boolean product of two low-rank binary matrices. Binary data is ubiquitous in many…

cs.DS2022

Partial Vertex Cover on Graphs of Bounded Degeneracy

Fahad Panolan, Hannane Yaghoubizade

In the Partial Vertex Cover (PVC) problem, we are given an $n$ -vertex graph $G$ and a positive integer $k$ , and the objective is to find a vertex subset $S$ of size $k$ maximizing…

A Framework for Approximation Schemes on Disk Graphs

Boolean and Fp​-Matrix Factorization: From Theory to Practice

Partial Vertex Cover on Graphs of Bounded Degeneracy

Boolean and $F_{p}$ -Matrix Factorization: From Theory to Practice