Sort by: Order: Results:

  • 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 ...
  • Tinna, Pallav; Karlapalem, Kamalakar (Society for Imaging Science and Technology, 2016-02-14)
    Interactive visualization and analysis of the class boundaries is important because it tells us how and why the classes differ. However, the problem of modeling the boundary of classes of arbitrary size, shape and density ...
  • 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 ...
  • Das, Bireswar; Enduri, Murali Krishna; Reddy, I. Vinod (Elsevier, 2020-06)
    The clique-width is a measure of complexity of decomposing graphs into certain tree-like structures. The class of graphs with bounded clique-width contains bounded tree-width graphs. We give a polynomial time graph isomorphism ...
  • Kalyanakrishnan, Shivaram; Misra, Neeldhara; Gopalan, Aditya (AAAI, 2016-02-12)

Search Digital Repository


My Account