Neeldhara Misra

119 Followers

20 SlideShares 119 Followers 118 Followings

algorithms graph theory kernelization theoretical computer science lower bounds theoretical comupter science q-expansion colorful motifs ipec hardness ekr combinatorics complexity-theory np-hardness research career edge coloring fpt

Activity
About

Connected Dominating Set and Short Cycles

14 years ago • 961 Views

Lower Bounds In Kernelization

14 years ago • 2496 Views

Expansions for Reductions

14 years ago • 464 Views

Kernelization Complexity of Colorful Motifs

14 years ago • 711 Views

Efficient Simplification: The (im)possibilities

14 years ago • 4977 Views

Kernels for Planar F-Deletion (Restricted Variants)

12 years ago • 5404 Views

A Kernel for Planar F-deletion: The Connected Case

12 years ago • 2960 Views

From FVS to F-Deletion

12 years ago • 3138 Views

Separators with Non-Hereditary Properties

12 years ago • 2954 Views

EKR for Matchings

12 years ago • 3072 Views

Cheat Sheets for Hard Problems

12 years ago • 2239 Views

Research in CS

12 years ago • 428 Views

An FPT Algorithm for Maximum Edge Coloring

12 years ago • 1894 Views

Wg qcolorable

12 years ago • 477 Views

Graph Modification Algorithms

10 years ago • 2589 Views

Elicitation for Preferences Single Peaked on Trees

5 years ago • 718 Views

Deleting to Structured Trees

5 years ago • 728 Views

Graph Modification Problems: A Modern Perspective

5 years ago • 746 Views

On the Parameterized Complexity of Party Nominations

5 years ago • 734 Views

Efficient algorithms for hard problems on structured electorates

5 years ago • 1373 Views

Neeldhara Misra

Presentations