
A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs
Subexponential parameterized algorithms are known for a wide range of na...
read it

An Exponential Time Parameterized Algorithm for Planar Disjoint Paths
In the Disjoint Paths problem, the input is an undirected graph G on n v...
read it

Improving EFX Guarantees through Rainbow Cycle Number
We study the problem of fairly allocating a set of indivisible goods amo...
read it

On Fault Tolerant Feedback Vertex Set
The study of faulttolerant data structures for various network design p...
read it

A Brief Note on Single Source Fault Tolerant Reachability
Let G be a directed graph with n vertices and m edges, and let s ∈ V(G) ...
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

Popular Matching in Roommates Setting is NPhard
An input to the Popular Matching problem, in the roommates setting, cons...
read it
Pranabendu Misra
is this you? claim profile