
Elimination Distance to Topologicalminorfree Graphs is FPT
In the literature on parameterized graph problems, there has been an inc...
read it

Gerrymandering on graphs: Computational complexity and parameterized algorithms
Partitioning a region into districts to favor a particular candidate or ...
read it

Diverse Collections in Matroids and Graphs
We investigate the parameterized complexity of finding diverse sets of s...
read it

EPTAS for kmeans Clustering of Affine Subspaces
We consider a generalization of the fundamental kmeans clustering for d...
read it

Improved FPT Algorithms for Deletion to Forestlike Structures
The Feedback Vertex Set problem is undoubtedly one of the most wellstud...
read it

ETHTight Algorithms for Long Path and Cycle on Unit Disk Graphs
We present an algorithm for the extensively studied Long Path and Long C...
read it

Structural Parameterizations with Modulator Oblivion
It is known that problems like Vertex Cover, Feedback Vertex Set and Odd...
read it

Manipulating Districts to Win Elections: FineGrained Complexity
Gerrymandering is a practice of manipulating district boundaries and loc...
read it

On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets
In a reconfiguration version of an optimization problem Q the input is a...
read it

Refined Complexity of PCA with Outliers
Principal component analysis (PCA) is one of the most fundamental proced...
read it

Lowrank binary matrix approximation in columnsum norm
We consider ℓ_1Rankr Approximation over GF(2), where for a binary m× n...
read it

Reducing Topological Minor Containment to the Unique Linkage Theorem
In the Topological Minor Containment problem (TMC) problem two undirecte...
read it

Decomposition of Map Graphs with Applications
Bidimensionality is the most common technique to design subexponentialt...
read it

Going Far From Degeneracy
An undirected graph G is ddegenerate if every subgraph of G has a verte...
read it

A 2Approximation Algorithm for Feedback Vertex Set in Tournaments
A tournament is a directed graph T such that every pair of vertices is ...
read it

Approximation Schemes for LowRank Binary Matrix Approximation Problems
We provide a randomized linear time approximation scheme for a generic p...
read it

Parameterized LowRank Binary Matrix Approximation
We provide a number of algorithmic results for the following family of p...
read it

Complexity of the Steiner Network Problem with Respect to the Number of Terminals
In the Directed Steiner Network problem we are given an arcweighted dig...
read it
Fahad Panolan
is this you? claim profile