Search

Filters

Use filters to refine the search results.

Now showing items 1-10 of 10

The isomorphism problem for k-trees is complete for logspace

Arvind, V.; Das, Bireswar; Köbler, Johannes; Kuhnert, Sebastian (Elsevier, 2012-08)
Restricted space algorithms for isomorphism on bounded treewidth graphs

Das, Bireswar; Toran, Jacobo; Wagner, Fabian (Elsevier, 2012-08)
Log-Space Algorithms for Paths and Matchings in k-Trees

Das, Bireswar; Datta, Samir; Prajakta, Nimbhorkar (Springer Link, 2013-11)
Succinct Encodings of Graph Isomorphism

Das, Bireswar (Springer, 2014)
Colored Hypergraph Isomorphism is Fixed Parameter Tractable

Arvind, V.; Das, Bireswar; Köbler, Johannes; Seinosuke, Toda (2010)
The Entropy Influence Conjecture Revisited

Das, Bireswar; Pal, Manjish; Visavaliya, Vijay (arXiv, Cornell University Library, 2011-10)
Colored hypergraph isomorphism is fixed parameter tractable

Arvind, V.; Das, Bireswar; Kobler, Johannes; Toda, Seinosuke (Springer, 2013-04)
Zero knowledge and circuit minimization

Allender, Eric; Das, Bireswar (2014-08-25)
Logspace and FPT algorithms for graph isomorphism for subclasses of bounded tree-width graphs

Das, Bireswar; Enduri, Murali Krishna; Reddy, I. Vinod (Springer, 2015-02)
Polynomial-time algorithm for Isomorphism of graphs with clique-width at most 3

Das, Bireswar; Enduri, Murali Krishna; Reddy, I. Vinod (Cornell University Library, 2015-06)

Now showing items 1-10 of 10