Sort by: Order: Results:

  • Arvind, V.; Das, Bireswar; Kobler, Johannes; Toda, Seinosuke (Springer, 2015-01)
    We describe a fixed parameter tractable (fpt) algorithm for Colored Hypergraph Isomorphism, denoted CHI, which has running time (2 b N) O(1), where the parameter b is the maximum size of the color classes of the given ...
  • 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 ...

Search Digital Repository


My Account