Neeldhara Misra

Sort by

Latest

Most popular

Efficient algorithms for hard problems on structured electorates

On the Parameterized Complexity of Party Nominations

Graph Modification Problems: A Modern Perspective

Deleting to Structured Trees

Elicitation for Preferences Single Peaked on Trees

Graph Modification Algorithms

Wg qcolorable

An FPT Algorithm for Maximum Edge Coloring

Research in CS

Cheat Sheets for Hard Problems

EKR for Matchings

Separators with Non-Hereditary Properties

From FVS to F-Deletion

A Kernel for Planar F-deletion: The Connected Case

Kernels for Planar F-Deletion (Restricted Variants)