Publications

• Succinct Representations of Finite Groups.

            (with Shiv Dutt Sharma and P. R. Vaidyanathan), The Symposium on Fundamentals of Computation Theory, FCT'2019,  229-242 (pdf)          (Best Paper Award)

• Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes.

            (with Shiv Dutt Sharma), The International Computer Science Symposium in Russia, CSR'2019, 80-92 (pdf)

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

            (with Anirban Dasgupta, Murali Krishna Enduri and Vinod Reddy), Information Processing Letters, 139: 64-67, 2018. (Link)

• On Structural Parameterizations of Firefighting.

            (with Murali Krishna Enduri, Neeldhara Misra, and Vinod Reddy), CALDAM 2018, 221-234. (pdf)

• On the Parallel Parameterized Complexity of the Graph Isomorphism Problem.

            (with Murali Krishna Enduri, and Vinod Reddy), WALCOM 2018, 252-264. (pdf)

• CNF and DNF succinct graph encodings

            (with Patrick Scharpfenecker and Jacobo Torán), Information and Computation, 253: 236-447, 2017. (Link)

• Zero knowledge and circuit minimization.

            (with Eric Allender), Information and Computation, 256: 2-8, 2017. (Conference version: MFCS 2014, Best Paper Award) (ECCC version)

• On Structural Parameterizations of Graph Motif and Chromatic Number.

            (with Murali Krishna Enduri, Neeldhara Misra, and Vinod Reddy), CALDAM 2017:118-129. (pdf)

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

            (with Murali Krishna Enduri and Vinod Reddy), Theoretical Computer Science (TCS), 2017 (Conference COCOON'2016) (pdf)

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

           (with Murali Krishna Enduri and Vinod Reddy) WALCOM 2015: 329-334 (pdf)

• Colored Hypergraph Isomorphism is Fixed Parameter Tractable.

            (with V. Arvind,  J. Köbler, S. Toda),  Algorithmica 71(1): 120-138 (2015) (Conference version FSTTCS 2010). (pdf)

• Succinct Encodings of Graph Isomorphism.

            (with Bireswar Das, Patrick Scharpfenecker, Jacobo Torán), LATA 2014: 285-296. (pdf)

• Log-Space Algorithms for Paths and Matchings in k-Trees.

             (with Samir Datta, Prajakta Nimbhorka), Theory Comput. Syst. 53(4): 669-689 (2013), (conference version STACS 2010) (pdf).

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

            (with V. Arvind, J. Köbler, S. Kuhnert)  Inf. Comput. 217: 1-11 (2012) (Few results appeared in the conference ISAAC 2007) (pdf)

• Restricted space algorithms for isomorphism on bounded treewidth graphs.

            (with  Jacobo Torán, Fabian Wagner)  Inf. Comput. 217: 71-83 (2012). (Conference version STACS 2010). (pdf)

• The Entropy Influence Conjecture Revisited.

            (with  Manjish Pal, Vijay Visavaliya),  Electronic Colloquium on Computational Complexity (ECCC) 18: 146 (2011). (pdf)

• Isomorphism and canonization of tournaments and hypertournaments.

            (with V. Arvind and  Partha Mukhopadhyay), J. Comput. Syst. Sci. 76(7): 509-523 (2010) (Conference version ISAAC 2006) (pdf)

• SZK Proofs for Black-Box Group Problems.

            (with V. Arvind) Special Issue Theory Comput. Syst. 43(2): 100-117 (2008) (Conference version CSR 2006) (pdf)

• A Logspace Algorithm for Partial 2-Tree Canonization.

            (with V. Arvind,  Johannes Köbler) CSR 2008: 40-51. (pdf)

• The Complexity of Black-Box Ring Problems.

            (with V. Arvind, Partha Mukhopadhyay) COCOON 2006: 126-135. (pdf)

• Plasmids to Solve #3SAT.

            (with R. Siromoney) Aspects of Molecular Computing 2004: 361-366.

• DNA algorithm for breaking a propositional logic based cryptosystem.

            (with R. Siromoney) Bulletin of the EATCS 79: 170-177 (2003).