Search

Filters

Use filters to refine the search results.

Now showing items 1-5 of 5

Colored Hypergraph Isomorphism is Fixed Parameter Tractable

Arvind, V.; Das, Bireswar; Köbler, Johannes; Seinosuke, Toda (2010)
Colored hypergraph isomorphism is fixed parameter tractable

Arvind, V.; Das, Bireswar; Kobler, Johannes; Toda, Seinosuke (Springer, 2015-01)
The Entropy Influence Conjecture Revisited

Das, Bireswar; Pal, Manjish; Visavaliya, Vijay (arXiv, Cornell University Library, 2011-10)
Complexity of manipulation with partial information in voting

Deya, Palash; Misra, Neeldhara; Narahari, Y. (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)