Author

Author

Sort by: Order: Results:

  • 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 ...
  • 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 ...
  • 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 ...
  • Sonar, Chinmay; Dey, Palash; Misra, Neeldhara (Cornell University Library, 2020-04)
  • Misra, Neeldhara; Reddy, I. Vinod (Cornell University Library, 2017-08)
    Consider a graph G=(V,E) and a coloring c of vertices with colors from [ℓ]. A vertex v is said to be happy with respect to c if c(v)=c(u) for all neighbors u of v. Further, an edge (u,v) is happy if c(u)=c(v). Given a ...
  • Gowda, Kishen N.; Misra, Neeldhara; Patel, Vraj (Cornell University Library, 2020-05)
    We consider the problem of protecting and manipulating elections by recounting and changing ballots, respectively. Our setting involves a plurality-based election held across multiple districts, and the problem formulations ...
  • Dey, Palash; Misra, Neeldhara; Nath, Swaprava; Shakya, Garima (Cornell University Library, 2019-05)
    We study the parameterized complexity of the optimal defense and optimal attack problems in voting. In both the problems, the input is a set of voter groups (every voter group is a set of votes) and two integers $k_a$ and ...
  • Dey, Palash; Misra, Neeldhara (Cornell University Library, 2016-04)
    Eliciting the preferences of a set of agents over a set of alternatives is a problem of fundamental importance in social choice theory. Prior work on this problem has studied the query complexity of preference elicitation ...
  • Misra, Neeldhara; Mittal, Harshil; Sethia, Aditi (Cornell University Library, 2020-05)
    Given a set R of red points and a set B of blue points in the plane, the Red-Blue point separation problem asks if there are at most k lines that separate R from B, that is, each cell induced by the lines of the solution ...
  • Choudhari, Jayesh; Dasgupta, Anirban; Misra, Neeldhara; Ramanujan, M. S. (Cornell University Library, 2017-05)

Search Digital Repository


Browse

My Account