Fahad Panolan | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/fahad-panolan/Fahad PanolanHugo Blox Builder (https://hugoblox.com)en-usFri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngFahad Panolanhttps://ac.tuwien.ac.at/team/fahad-panolan/EPTAS for \emphk-means Clustering of Affine Subspaceshttps://ac.tuwien.ac.at/publication/eptas-for-emphk-means-clustering-of-affine-subspaces/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/eptas-for-emphk-means-clustering-of-affine-subspaces/Low-Rank Binary Matrix Approximation in Column-Sum Normhttps://ac.tuwien.ac.at/publication/low-rank-binary-matrix-approximation-in-column-sum-norm/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/low-rank-binary-matrix-approximation-in-column-sum-norm/Manipulating Districts to Win Elections: Fine-Grained Complexityhttps://ac.tuwien.ac.at/publication/manipulating-districts-to-win-elections-fine-grained-complexity/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/manipulating-districts-to-win-elections-fine-grained-complexity/Refined Complexity of PCA with Outliershttps://ac.tuwien.ac.at/publication/refined-complexity-of-pca-with-outliers/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/refined-complexity-of-pca-with-outliers/Linear Representation of Transversal Matroids and Gammoids parameterized by rankhttps://ac.tuwien.ac.at/publication/linear-representation-of-transversal-matroids-and-gammoids-parameterized-by-rank/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/linear-representation-of-transversal-matroids-and-gammoids-parameterized-by-rank/Lossy kernelizationhttps://ac.tuwien.ac.at/publication/lossy-kernelization/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/lossy-kernelization/Faster Parameterized Algorithms for Deletion to Split Graphshttps://ac.tuwien.ac.at/publication/faster-parameterized-algorithms-for-deletion-to-split-graphs/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/faster-parameterized-algorithms-for-deletion-to-split-graphs/On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroidshttps://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-girth-and-connectivity-problems-on-linear-matroids/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-girth-and-connectivity-problems-on-linear-matroids/Reconfiguration on Sparse Graphshttps://ac.tuwien.ac.at/publication/reconfiguration-on-sparse-graphs/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/reconfiguration-on-sparse-graphs/On the Kernelization Complexity of String Problemshttps://ac.tuwien.ac.at/publication/on-the-kernelization-complexity-of-string-problems/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-kernelization-complexity-of-string-problems/