Bireswar Das

According to our database, Bireswar Das authored at least 33 papers between 2003 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

On the Complexity of Problems on Graphs Defined on Groups.

Bireswar Das, Dipan Dey, Jinia Ghosh

Proceedings of the Fundamentals of Computation Theory - 25th International Symposium, 2025

2024

On Oriented Diameter of Power Graphs.

Deepu Benson, Bireswar Das, Dipan Dey, Jinia Ghosh

CoRR, 2024

The Minimal Faithful Permutation Degree of Groups without Abelian Normal Subgroups.

Bireswar Das, Dhara Thakkar

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

The Isomorphism Problem of Power Graphs and a Question of Cameron.

Bireswar Das, Jinia Ghosh, Anant Kumar

Proceedings of the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2024

2023

Algorithms for the Minimum Generating Set Problem.

Bireswar Das, Dhara Thakkar

CoRR, 2023

2022

Linear Space Data Structures for Finite Groups with Constant Query-Time.

Bireswar Das, Anant Kumar, Shivdutt Sharma, Dhara Thakkar

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

2021

Compact Data Structures for Dedekind Groups and Finite Rings.

Bireswar Das, Shivdutt Sharma

Proceedings of the WALCOM: Algorithms and Computation, 2021

2020

Space efficient representations of finite groups.

Bireswar Das, Shivdutt Sharma, P. R. Vaidyanathan

J. Comput. Syst. Sci., 2020

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

Succinct Representations of Finite Groups.

Bireswar Das, Shivdutt Sharma, P. R. Vaidyanathan

Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes.

Bireswar Das, Shivdutt Sharma

Proceedings of the Computer Science - Theory and Applications, 2019

2018

On NC algorithms for problems on bounded rank-width graphs.

Bireswar Das, Anirban Dasgupta, Murali Krishna Enduri, I. Vinod Reddy

Inf. Process. Lett., 2018

On the Parallel Parameterized Complexity of the Graph Isomorphism Problem.

Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy

Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018

On Structural Parameterizations of Firefighting.

Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2017

CNF and DNF succinct graph encodings.

Bireswar Das, Patrick Scharpfenecker, Jacobo Torán

Inf. Comput., 2017

On Structural Parameterizations of Graph Motif and Chromatic Number.

Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy

Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016

Polynomial-Time Algorithm for Isomorphism of Graphs with Clique-Width at Most Three.

Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015

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

Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy

CoRR, 2015

Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs.

Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy

Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

2014

Zero Knowledge and Circuit Minimization.

Eric Allender, Bireswar Das

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Succinct Encodings of Graph Isomorphism.

Bireswar Das, Patrick Scharpfenecker, Jacobo Torán

Proceedings of the Language and Automata Theory and Applications, 2014

2012

The isomorphism problem for k-trees is complete for logspace.

Vikraman Arvind, Bireswar Das, Johannes Köbler, Sebastian Kuhnert

Inf. Comput., 2012

2011

The Entropy Influence Conjecture Revisited.

Bireswar Das, Manjish Pal, Vijay Visavaliya

Electron. Colloquium Comput. Complex., 2011

2010

Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs.

Bireswar Das, Jacobo Torán, Fabian Wagner

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Log-space Algorithms for Paths and Matchings in k-trees.

Bireswar Das, Samir Datta, Prajakta Nimbhorkar

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Colored Hypergraph Isomorphism is Fixed Parameter Tractable.

Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2008

A Logspace Algorithm for Partial 2-Tree Canonization.

Vikraman Arvind, Bireswar Das, Johannes Köbler

Proceedings of the Computer Science, 2008

2007

The Space Complexity of <i>k</i> -Tree Isomorphism.

Vikraman Arvind, Bireswar Das, Johannes Köbler

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006

On Isomorphism and Canonization of Tournaments and Hypertournaments.

Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

SZK Proofs for Black-Box Group Problems.

Vikraman Arvind, Bireswar Das

Proceedings of the Computer Science, 2006

The Complexity of Black-Box Ring Problems.

Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay

Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2004

Plasmids to Solve #3SAT.

Rani Siromoney, Bireswar Das

Proceedings of the Aspects of Molecular Computing, 2004

2003

DNA algorithm for breaking a propositional logic based cryptosystem.

Rani Siromoney, Bireswar Das

Bull. EATCS, 2003