Author

Author

Sort by: Order: Results:

  • Banerjee, Sandip; Misra, Neeldhara; Nandy, Subhas C. (Springer, 2016-02-08)
    In this paper, we study the Shortest Color Spanning Intervals problem, and related generalizations, namely Smallest Color Spanning t Squares and Smallest Color Spanning t Circles. The generic setting is the following: we ...
  • Banerjee, Sandip; Misra, Neeldhara; Nandy, Subhas C. (Elsevier, 2018-03)
    In this paper, we study the Shortest Color Spanning - Intervals problem, and related generalizations, namely Smallest Color Spanning - Squares and Smallest Color Spanning - Circles. The generic setting is the following: ...
  • Dey, Palash; Misra, Neeldhara (Cornell University Library, 2016-04)
    The Coalitional Manipulation problem has been studied extensively in the literature for many voting rules. However, most studies have focused on the complete information setting, wherein the manipulators know the votes of ...
  • Deya, Palash; Misra, Neeldhara; Narahari, Y. (Elsevier, 2018-03)
    The Coalitional Manipulation problem has been studied extensively in the literature for many voting rules. However, most studies have focused on the complete information setting, wherein the manipulators know the votes of ...
  • Dayal, Pratyush; Misra, Neeldhara (2019-07-29)
  • Dey, Palash; Misra, Neeldhara (New York Hilton Midtown, 2016-07)
  • Misra, Neeldhara; Sonar, Chinmay; Vaidyanathan, P. R.; Vaish, Rohit (Cornell University Library, 2021-01)
    We study fair resource allocation under a connectedness constraint wherein a set of indivisible items are arranged on a path and only connected subsets of items may be allocated to the agents. An allocation is deemed fair ...
  • Misra, Neeldhara; Sethia, Aditi (2020-09-14)
  • Dey, Palash; Misra, Neeldhara; Narahari, Y. (AAAI, 2016-02-12)
  • Dey, Palash; Misra, Neeldhara; Narahari, Y. (Elsevier, 2017-05)
    Bribery in elections is an important problem in computational social choice theory. We introduce and study two important special cases of the classical $Bribery problem, namely, Frugal-bribery and Frugal-$bribery where the ...
  • Misra, Neeldhara; Mittal, Harshil (Cornell University Library, 2020-05)
    We study the problem of Imbalance parameterized by the twin cover of a graph. We show that Imbalance is XP parameterized by twin cover, and FPT when parameterized by the twin cover and the size of the largest clique outside ...
  • Misra, Neeldhara; Mittal, Harshil (29-08-20)
  • Dey, Palash; Misra, Neeldhara; Narahari, Y. (Elsevier, 2016-02)
    In the Possible winner problem in computational social choice theory, we are given a set of partial preferences and the question is whether a distinguished candidate could be made winner by extending the partial preferences ...
  • Das, Bireswar; Enduri, Murali Krishna; Misra, Neeldhara; Reddy, I. Vinod (Cornell University Library, 2017-11)
    The Firefighting problem is defined as follows. At time t=0, a fire breaks out at a vertex of a graph. At each time step t?0, a firefighter permanently defends (protects) an unburned vertex, and the fire then spread to all ...
  • Das, Bireswar; Enduri, Murali Krishna; Misra, Neeldhara; Reddy, I. Vinod (Springer, 2018-02-15)
    The Firefighting problem is defined as follows. At time Open image in new window , a fire breaks out at a vertex of a graph. At each time step Open image in new window , a firefighter permanently defends (protects) an ...
  • Das, Bireswar; Enduri, Murali Krishna; Kiyomi, Masashi; Misra, Neeldhara; Otachi, Yota; Reddy, I. Vinod; Yoshimura, Shunya (Elsevier, 2019-03)
    he Firefighting problem is defined as follows. At time , a fire breaks out at a vertex of a graph. At each time step, a firefighter permanently defends (protects) an unburned vertex, and the fire then spreads to all ...
  • Das, Bireswar; Enduri, Murali Krishna; Misra, Neeldhara; Vinod Reddy, I. (Springer International Publishing, 2017)
    Structural parameterizations for hard problems have proven to be a promising venture for discovering scenarios where the problem is tractable. In particular, when a problem is already known to be polynomially solvable for ...
  • Gupta, Manoj; Kumar, Hitesh; Misra, Neeldhara (27-01-2019)
  • Sonar, Chinmay; Dey, Palash; Misra, Neeldhara (Cornell University Library, 2020-04)
  • Vaish, Rohit; Misra, Neeldhara; Agarwal, Shivani; Blum, Avrim (AAMAS, 2016-05-09)
    Standard voting rules usually assume that the preferences of voters are provided in the form of complete rankings over a xed set of alternatives. This assumption does not hold in applications like recommendation ...

Search Digital Repository


Browse

My Account