Bireswar Das

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 23

Top Topics

Graph Isomorphism

Parameterized Complexity

Top Venues

Theor. Comput. Sci.

Publications

Bireswar Das, Anant Kumar, Shivdutt Sharma, Dhara Thakkar
Linear Space Data Structures for Finite Groups with Constant Query-Time. Algorithmica 86 (6) (2024)
Bireswar Das, Dhara Thakkar
The Minimal Faithful Permutation Degree of Groups without Abelian Normal Subgroups. STOC (2024)
Bireswar Das, Anant Kumar, Shivdutt Sharma, Dhara Thakkar
Linear Space Data Structures for Finite Groups with Constant Query-time. CoRR (2023)
Bireswar Das, Dhara Thakkar
Algorithms for the Minimum Generating Set Problem. CoRR (2023)
Bireswar Das, Jinia Ghosh, Anant Kumar
The Isomorphism Problem of Power Graphs and a Question of Cameron. CoRR (2023)
Bireswar Das, Anant Kumar, Shivdutt Sharma, Dhara Thakkar
Linear Space Data Structures for Finite Groups with Constant Query-Time. STACS (2022)
Bireswar Das, Shivdutt Sharma
Compact Data Structures for Dedekind Groups and Finite Rings. WALCOM (2021)
Bireswar Das, Shivdutt Sharma
Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes. Theory Comput. Syst. 65 (3) (2021)
Bireswar Das, Shivdutt Sharma, P. R. Vaidyanathan
Space Efficient Representations of Finite Groups. CoRR (2020)
Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy
Polynomial-time algorithm for isomorphism of graphs with clique-width at most three. Theor. Comput. Sci. 819 (2020)
Bireswar Das, Shivdutt Sharma, P. R. Vaidyanathan
Space efficient representations of finite groups. J. Comput. Syst. Sci. 114 (2020)
Bireswar Das, Shivdutt Sharma
Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes. CSR (2019)
Bireswar Das, Murali Krishna Enduri, Masashi Kiyomi, Neeldhara Misra, Yota Otachi, I. Vinod Reddy, Shunya Yoshimura
On structural parameterizations of firefighting. Theor. Comput. Sci. 782 (2019)
Bireswar Das, Shivdutt Sharma, P. R. Vaidyanathan
Succinct Representations of Finite Groups. FCT (2019)
Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy
On the Parallel Parameterized Complexity of the Graph Isomorphism Problem. WALCOM (2018)
Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy
On Structural Parameterizations of Firefighting. CALDAM (2018)
Bireswar Das, Anirban Dasgupta, Murali Krishna Enduri, I. Vinod Reddy
On NC algorithms for problems on bounded rank-width graphs. Inf. Process. Lett. 139 (2018)
Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy
On the Parallel Parameterized Complexity of the Graph Isomorphism Problem. CoRR (2017)
Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy
On Structural Parameterizations of Firefighting. CoRR (2017)
Eric Allender, Bireswar Das
Zero knowledge and circuit minimization. Inf. Comput. 256 (2017)
Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy
On Structural Parameterizations of Graph Motif and Chromatic Number. CALDAM (2017)
Bireswar Das, Patrick Scharpfenecker, Jacobo Torán
CNF and DNF succinct graph encodings. Inf. Comput. 253 (2017)
Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy
Polynomial-Time Algorithm for Isomorphism of Graphs with Clique-Width at Most Three. COCOON (2016)
Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy
Polynomial-time Algorithm for Isomorphism of Graphs with Clique-width at most 3. CoRR (2015)
Bireswar Das, Patrick Scharpfenecker, Jacobo Torán
Succinct Encodings of Graph Isomorphism. Electron. Colloquium Comput. Complex. 22 (2015)
Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy
Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs. WALCOM (2015)
Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda
Colored Hypergraph Isomorphism is Fixed Parameter Tractable. Algorithmica 71 (1) (2015)
Eric Allender, Bireswar Das
Zero Knowledge and Circuit Minimization. MFCS (2) (2014)
Eric Allender, Bireswar Das
Zero Knowledge and Circuit Minimization. Electron. Colloquium Comput. Complex. 21 (2014)
Bireswar Das, Patrick Scharpfenecker, Jacobo Torán
Succinct Encodings of Graph Isomorphism. LATA (2014)
Bireswar Das, Samir Datta, Prajakta Nimbhorkar
Log-Space Algorithms for Paths and Matchings in k-Trees. Theory Comput. Syst. 53 (4) (2013)
Bireswar Das, Jacobo Torán, Fabian Wagner
Restricted space algorithms for isomorphism on bounded treewidth graphs. Inf. Comput. 217 (2012)
Vikraman Arvind, Bireswar Das, Johannes Köbler, Sebastian Kuhnert
The isomorphism problem for k-trees is complete for logspace. Inf. Comput. 217 (2012)
Bireswar Das, Manjish Pal, Vijay Visavaliya
The Entropy Influence Conjecture Revisited CoRR (2011)
Bireswar Das, Manjish Pal, Vijay Visavaliya
The Entropy Influence Conjecture Revisited. Electron. Colloquium Comput. Complex. 18 (2011)
Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda
Colored Hypergraph Isomorphism is Fixed Parameter Tractable. FSTTCS (2010)
Bireswar Das, Jacobo Torán, Fabian Wagner
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs CoRR (2010)
Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay
Isomorphism and canonization of tournaments and hypertournaments. J. Comput. Syst. Sci. 76 (7) (2010)
Bireswar Das, Jacobo Torán, Fabian Wagner
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs. STACS (2010)
Bireswar Das, Samir Datta, Prajakta Nimbhorkar
Log-space Algorithms for Paths and Matchings in k-trees. STACS (2010)
Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda
Colored Hypergraph Isomorphism is Fixed Parameter Tractable. Electron. Colloquium Comput. Complex. 16 (2009)
Bireswar Das, Samir Datta, Prajakta Nimbhorkar
Log-space Algorithms for Paths and Matchings in k-trees CoRR (2009)
Bireswar Das, Jacobo Torán, Fabian Wagner
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs. Electron. Colloquium Comput. Complex. 16 (2009)
Vikraman Arvind, Bireswar Das
SZK Proofs for Black-Box Group Problems. Theory Comput. Syst. 43 (2) (2008)
Vikraman Arvind, Bireswar Das, Johannes Köbler
A Logspace Algorithm for Partial 2-Tree Canonization. CSR (2008)
Vikraman Arvind, Bireswar Das, Johannes Köbler
-Tree Isomorphism. ISAAC (2007)
Vikraman Arvind, Bireswar Das
SZK Proofs for Black-Box Group Problems. CSR (2006)
Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay
The Complexity of Black-Box Ring Problems. COCOON (2006)
Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay
On Isomorphism and Canonization of Tournaments and Hypertournaments. ISAAC (2006)
Rani Siromoney, Bireswar Das
Plasmids to Solve #3SAT. Aspects of Molecular Computing (2004)
Rani Siromoney, Bireswar Das
DNA algorithm for breaking a propositional logic based cryptosystem. Bull. EATCS 79 (2003)