Search

Filters

Use filters to refine the search results.

Now showing items 1-8 of 8

Color Spanning Objects - Algorithms and Hardness Results

Banerjee, Sandip; Misra, Neeldhara; Nandy, Subhas C. (Springer, 2016-02-08)
Kernelization complexity of possible winner and coalitional manipulation problems in voting

Dey, Palash; Misra, Neeldhara; Narahari, Y. (Elsevier, 2016-02)
On the parameterized complexity of manipulating pairwise voting rules

Vaish, Rohit; Misra, Neeldhara (EXPLORE, 2016-05)
Parameterized algorithms for conflict-free colorings of graphs

Reddy, I. Vinod (Elsevier, 2018-05)
Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers

Dey, Palash; Misra, Neeldhara; Narahari, Y. (Elsevier, 2019-04)
On structural parameterizations of firefighting

Das, Bireswar; Enduri, Murali Krishna; Kiyomi, Masashi; Misra, Neeldhara; Otachi, Yota; Reddy, I. Vinod; Yoshimura, Shunya (Elsevier, 2019-03)
Color spanning objects: algorithms and hardness results

Banerjee, Sandip; Misra, Neeldhara; Nandy, Subhas C. (Elsevier, 2018-03)
Parameterized complexity of happy coloring problems

Agrawal, Akanksha; Aravind, N.R.; Kalyanasundaram, Subrahmanyam; Kare, Anjeneya Swami; Lauri, Juho; Misra, Neeldhara; Reddy, I. Vinod (Elsevier, 2020-10)

Now showing items 1-8 of 8