DNA algorithm for breaking a propositional logic based cryptosystem. - Rani Siromoney; Bireswar Das (Bull. EATCS, 2003)

Plasmids to Solve #3SAT. - Rani Siromoney; Bireswar Das (Aspects of Molecular Computing, 2004)

The Complexity of Black-Box Ring Problems. - Vikraman Arvind; Bireswar Das; Partha Mukhopadhyay (COCOON, 2006)

The Space Complexity of k -Tree Isomorphism. - Vikraman Arvind; Bireswar Das; Johannes Köbler (ISAAC, 2007)

A Logspace Algorithm for Partial 2-Tree Canonization. - Vikraman Arvind; Bireswar Das; Johannes Köbler (CSR, 2008)

SZK Proofs for Black-Box Group Problems. - Vikraman Arvind; Bireswar Das (Theory Comput. Syst., 2008)

Colored Hypergraph Isomorphism is Fixed Parameter Tractable. - Vikraman Arvind; Bireswar Das; Johannes Köbler; Seinosuke Toda (Electron. Colloquium Comput. Complex., 2009)

Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs. - Bireswar Das; Jacobo Torán; Fabian Wagner (Electron. Colloquium Comput. Complex., 2009)

Isomorphism and canonization of tournaments and hypertournaments. - Vikraman Arvind; Bireswar Das; Partha Mukhopadhyay (J. Comput. Syst. Sci., 2010)

The Entropy Influence Conjecture Revisited. - Bireswar Das; Manjish Pal; Vijay Visavaliya (Electron. Colloquium Comput. Complex., 2011)

The isomorphism problem for k-trees is complete for logspace. - Vikraman Arvind; Bireswar Das; Johannes Köbler; Sebastian Kuhnert (Inf. Comput., 2012)

Log-Space Algorithms for Paths and Matchings in k-Trees. - Bireswar Das; Samir Datta; Prajakta Nimbhorkar (Theory Comput. Syst., 2013)

Zero Knowledge and Circuit Minimization. - Eric Allender; Bireswar Das (Electron. Colloquium Comput. Complex., 2014)

Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs. - Bireswar Das; Murali Krishna Enduri; I. Vinod Reddy (WALCOM, 2015)

Polynomial-time Algorithm for Isomorphism of Graphs with Clique-width at most 3. - Bireswar Das; Murali Krishna Enduri; I. Vinod Reddy (CoRR, 2015)

Succinct Encodings of Graph Isomorphism. - Bireswar Das; Patrick Scharpfenecker; Jacobo Torán (Electron. Colloquium Comput. Complex., 2015)

On Structural Parameterizations of Graph Motif and Chromatic Number. - Bireswar Das; Murali Krishna Enduri; Neeldhara Misra; I. Vinod Reddy (CALDAM, 2017)

CNF and DNF succinct graph encodings. - Bireswar Das; Patrick Scharpfenecker; Jacobo Torán (Inf. Comput., 2017)

On Structural Parameterizations of Firefighting. - Bireswar Das; Murali Krishna Enduri; Neeldhara Misra; I. Vinod Reddy (CALDAM, 2018)

On the Parallel Parameterized Complexity of the Graph Isomorphism Problem. - Bireswar Das; Murali Krishna Enduri; I. Vinod Reddy (WALCOM, 2018)

On NC algorithms for problems on bounded rank-width graphs. - Bireswar Das; Anirban Dasgupta 001; Murali Krishna Enduri; I. Vinod Reddy (Inf. Process. Lett., 2018)

Succinct Representations of Finite Groups. - Bireswar Das; Shivdutt Sharma; P. R. Vaidyanathan (FCT, 2019)

On structural parameterizations of firefighting. - Bireswar Das; Murali Krishna Enduri; Masashi Kiyomi; Neeldhara Misra; Yota Otachi; I. Vinod Reddy; Shunya Yoshimura (Theor. Comput. Sci., 2019)

Space efficient representations of finite groups. - Bireswar Das; Shivdutt Sharma; P. R. Vaidyanathan (J. Comput. Syst. Sci., 2020)

Polynomial-time algorithm for isomorphism of graphs with clique-width at most three. - Bireswar Das; Murali Krishna Enduri; I. Vinod Reddy (Theor. Comput. Sci., 2020)

Compact Data Structures for Dedekind Groups and Finite Rings. - Bireswar Das; Shivdutt Sharma (WALCOM, 2021)

Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes. - Bireswar Das; Shivdutt Sharma (Theory Comput. Syst., 2021)

Algorithms for the Minimum Generating Set Problem. - Bireswar Das; Dhara Thakkar (CoRR, 2023)

The Isomorphism Problem of Power Graphs and a Question of Cameron. - Bireswar Das; Jinia Ghosh; Anant Kumar (FSTTCS, 2024)

The Minimal Faithful Permutation Degree of Groups without Abelian Normal Subgroups. - Bireswar Das; Dhara Thakkar (STOC, 2024)

On Oriented Diameter of Power Graphs. - Deepu Benson; Bireswar Das; Dipan Dey; Jinia Ghosh (CoRR, 2024)

Linear Space Data Structures for Finite Groups with Constant Query-Time. - Bireswar Das; Anant Kumar; Shivdutt Sharma; Dhara Thakkar (Algorithmica, 2024)

On the Complexity of Problems on Graphs Defined on Groups. - Bireswar Das; Dipan Dey; Jinia Ghosh (CoRR, 2025)