Pranabendu Misra

Faster parameterized algorithms for deletion to split graphs

An undirected graph is said to be split if its vertex set can be partitioned into two sets such that the subgraph induced on one of them is a complete graph and the subgraph induced on the other is an independent set. We study the problem of deleting the minimum number of vertices or edges from a given input graph so that the resulting graph is split.We initiate a systematic study and give efficient fixed-parameter algorithms and polynomial sized kernels for the problem. More precisely, 1 for Split Vertex Deletion, the problem of determining whether there are k vertices whose deletion results in a split graph, we give an

Deterministic Truncation of Linear Matroids

{\cal O}^*(2^k)

Parameterized algorithms for even cycle transversal

algorithm improving on the previous best bound of

Feedback vertex set inspired kernel for chordal vertex deletion

{\cal O}^*({2.32^k})

Faster exact algorithms for some terminal set problems

. We also give an

Parameterized Algorithms to Preserve Connectivity

{\cal O}(k^3)

Reducing rank of the adjacency matrix by graph modification

-sized kernel for the problem. 2 For Split Edge Deletion, the problem of determining whether there are k edges whose deletion results in a split graph, we give an

Faster Exact Algorithms for Some Terminal Set Problems

{\cal O}^*( 2^{ O(\sqrt{k}\log k) })

Parameterized Approximations via d-Skew-Symmetric Multicut

algorithm. We also prove the existence of an

Parameterized algorithms for survivable network design with uniform demands

{\cal O}(k^2)