The generalized towers of Hanoi. - M. S. Krishnamoorthy; Somenath Biswas (SIGACT News, 1979)

On Certain Bandwidth Restricted Versions of the Satisfaiability Problem of Propositional CNF Formulas. - Vikraman Arvind; Somenath Biswas (FSTTCS, 1987)

Expressibility of First Order Logic with a Nondeterministic Inductive Operator. - Vikraman Arvind; Somenath Biswas (STACS, 1987)

An O(n²) Algorithm for the Satisfiability Problem of a Subset of Propositional Sentences in CNF That Includes All Horn Sentences. - Vikraman Arvind; Somenath Biswas (Inf. Process. Lett., 1987)

An Algorithm to Decide Feasibility of Linear Integer Constraints Occurring in Decision Tables. - Somenath Biswas; V. Rajaraman (IEEE Trans. Software Eng., 1987)

On Some Bandwidth Restricted Versions of the Satisfiability Problem of Propositional CNF Formulas. - Vikraman Arvind; Somenath Biswas (Theor. Comput. Sci., 1989)

Edge-Deletion Graph Problems with First-Order Expressible Subgraph Properties. - Vikraman Arvind; Somenath Biswas (Int. J. Found. Comput. Sci., 1991)

Padding, Commitment and Self-Reducibility. - Sanjeev N. Khadilkar; Somenath Biswas (Theor. Comput. Sci., 1991)

Universal Relations. - Manindra Agrawal; Somenath Biswas (SCT, 1992)

Polynomial Isomorphism of 1-L-Complete Sets. - Manindra Agrawal; Somenath Biswas (SCT, 1993)

Polynomial-Time Isomorphism of 1-L-Complete Sets. - Manindra Agrawal; Somenath Biswas (J. Comput. Syst. Sci., 1996)

NP-Creative Sets: A New Class of Creative Sets in NP. - Manindra Agrawal; Somenath Biswas (Math. Syst. Theory, 1996)

Approximation Algorithms for 3-D Commom Substructure Identification in Drug and Protein Molecules. - Samarjit Chakraborty; Somenath Biswas (WADS, 1999)

Reducing Randomness via Chinese Remaindering - Manindra Agrawal; Somenath Biswas (Electron. Colloquium Comput. Complex., 1999)

Primality and identity testing via Chinese remaindering. - Manindra Agrawal; Somenath Biswas (J. ACM, 2003)

Modeling Gene Regulatory Network in Fission Yeast Cell Cycle Using Hybrid Petri Nets. - Ranjith Vasireddy; Somenath Biswas (ICONIP, 2004)

Universality for Nondeterministic Logspace. - Vinay Choudhary; Anand Kumar Sinha; Somenath Biswas (LATA, 2007)

RAM Simulation of BGS Model of Abstract-state Machines. - Seshadhri Comandur; Anil Seth; Somenath Biswas (Fundam. Informaticae, 2007)

Computing single source shortest paths using single-objective fitness. - Surender Baswana; Somenath Biswas; Benjamin Doerr; Tobias Friedrich 001; Piyush P. Kurur; Frank Neumann 001 (FOGA, 2009)

Necessary and sufficient conditions for success of the metropolis algorithm for optimization. - Swagato Sanyal; Raja S 001; Somenath Biswas (GECCO, 2010)

Metropolis algorithm for solving shortest lattice vector problem (SVP). - Ajitha Shenoy K. B; Somenath Biswas; Piyush P. Kurur (HIS, 2011)

Effect of increasing the energy gap between the two lowest energy states on the mixing time of the Metropolis algorithm. - Apurv Nakade; Somenath Biswas (Inf. Process. Lett., 2012)

Performance of metropolis algorithm for the minimum weight code word problem. - Ajitha Shenoy K. B; Somenath Biswas; Piyush P. Kurur (GECCO, 2014)

A note on faithful coupling of Markov chains. - Debojyoti Dey; Pranjal Dutta; Somenath Biswas (CoRR, 2017)

Efficacy of the Metropolis Algorithm for the Minimum-Weight Codeword Problem Using Codeword and Generator Search Spaces. - Ajitha Shenoy K. B; Somenath Biswas; Piyush P. Kurur (IEEE Trans. Evol. Comput., 2020)

Various proofs of the Fundamental Theorem of Markov Chains. - Somenath Biswas (CoRR, 2022)