Bireswar Das - RankMe

56 papers A* 1A 3B 7C 1Misc 5Journal 33Unranked 6

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