Bireswar Das

According to our database1, Bireswar Das authored at least 30 papers between 2003 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
The Isomorphism Problem of Power Graphs and a Question of Cameron.
CoRR, 2023

Algorithms for the Minimum Generating Set Problem.
CoRR, 2023

2022
Linear Space Data Structures for Finite Groups with Constant Query-Time.
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

2021
Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes.
Theory Comput. Syst., 2021

Compact Data Structures for Dedekind Groups and Finite Rings.
Proceedings of the WALCOM: Algorithms and Computation, 2021

2020
Polynomial-time algorithm for isomorphism of graphs with clique-width at most three.
Theor. Comput. Sci., 2020

Space efficient representations of finite groups.
J. Comput. Syst. Sci., 2020

2019
On structural parameterizations of firefighting.
Theor. Comput. Sci., 2019

Succinct Representations of Finite Groups.
Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

2018
On NC algorithms for problems on bounded rank-width graphs.
Inf. Process. Lett., 2018

On the Parallel Parameterized Complexity of the Graph Isomorphism Problem.
Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018

On Structural Parameterizations of Firefighting.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2017
CNF and DNF succinct graph encodings.
Inf. Comput., 2017

On Structural Parameterizations of Graph Motif and Chromatic Number.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2015
Succinct Encodings of Graph Isomorphism.
Electron. Colloquium Comput. Complex., 2015

Polynomial-time Algorithm for Isomorphism of Graphs with Clique-width at most 3.
CoRR, 2015

Colored Hypergraph Isomorphism is Fixed Parameter Tractable.
Algorithmica, 2015

Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs.
Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

2014
Zero Knowledge and Circuit Minimization.
Electron. Colloquium Comput. Complex., 2014

2013
Log-Space Algorithms for Paths and Matchings in k-Trees.
Theory Comput. Syst., 2013

2012
The isomorphism problem for k-trees is complete for logspace.
Inf. Comput., 2012

2011
The Entropy Influence Conjecture Revisited.
Electron. Colloquium Comput. Complex., 2011

2010
Isomorphism and canonization of tournaments and hypertournaments.
J. Comput. Syst. Sci., 2010

2009
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs.
Electron. Colloquium Comput. Complex., 2009

2008
SZK Proofs for Black-Box Group Problems.
Theory Comput. Syst., 2008

A Logspace Algorithm for Partial 2-Tree Canonization.
Proceedings of the Computer Science, 2008

2007
The Space Complexity of <i>k</i> -Tree Isomorphism.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006
The Complexity of Black-Box Ring Problems.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2004
Plasmids to Solve #3SAT.
Proceedings of the Aspects of Molecular Computing, 2004

2003
DNA algorithm for breaking a propositional logic based cryptosystem.
Bull. EATCS, 2003


  Loading...