Generating DNA Code Words. - Natasa Jonoska; David Kephart; Kalpana Mahalingam (GECCO Late Breaking Papers, 2002)

Languages of DNA Based Code Words. - Natasa Jonoska; Kalpana Mahalingam (DNA, 2003)

Methods for Constructing Coded DNA Languages. - Natasa Jonoska; Kalpana Mahalingam (Aspects of Molecular Computing, 2004)

Involution Codes with Application to DNA Strand Design. - Kalpana Mahalingam (2004)

Involution codes: with application to DNA coded languages. - Natasa Jonoska; Kalpana Mahalingam; Junghuei Chen (Nat. Comput., 2005)

DNA Codes and Their Properties. - Lila Kari; Kalpana Mahalingam (DNA, 2006)

Involution Solid Codes. - Lila Kari; Kalpana Mahalingam (Nanotechnology: Science and Computation, 2006)

Watson-Crick Conjugate and Commutative Words. - Lila Kari; Kalpana Mahalingam (DNA, 2007)

The syntactic monoid of hairpin-free languages. - Lila Kari; Kalpana Mahalingam; Gabriel Thierrin (Acta Informatica, 2007)

Involutively Bordered Words. - Lila Kari; Kalpana Mahalingam (Int. J. Found. Comput. Sci., 2007)

Involution Solid and Join codes. - Natasa Jonoska; Lila Kari; Kalpana Mahalingam (Fundam. Informaticae, 2008)

Watson-Crick Bordered Words and their Syntactic Monoid. - Lila Kari; Kalpana Mahalingam (Int. J. Found. Comput. Sci., 2008)

Twin-roots of words and their properties. - Lila Kari; Kalpana Mahalingam; Shinnosuke Seki 001 (Theor. Comput. Sci., 2009)

Palindromic completion of a word. - Kalpana Mahalingam; K. G. Subramanian 001 (BIC-TA, 2010)

A relation by palindromic subwords. - Mark Daley; Kalpana Mahalingam (Nat. Comput., 2010)

Watson-Crick palindromes in DNA computing. - Lila Kari; Kalpana Mahalingam (Nat. Comput., 2010)

Context-Free Systems with a Complementarity Relation. - K. G. Subramanian 001; Ibrahim Venkat; Kalpana Mahalingam (BIC-TA, 2011)

Binary Images, M -Vectors, and Ambiguity. - K. G. Subramanian 001; Kalpana Mahalingam; Rosni Abdullah; Atulya K. Nagar (IWCIA, 2011)

Theoretical and computational properties of transpositions. - Mark Daley; Ian McQuillan; James M. McQuillan; Kalpana Mahalingam (Nat. Comput., 2011)

Generating DNA Code Words Using Forbidding and Enforcing Systems. - Daniela Genova; Kalpana Mahalingam (TPNC, 2012)

Product of Parikh Matrices and Commutativity. - Kalpana Mahalingam; K. G. Subramanian 001 (Int. J. Found. Comput. Sci., 2012)

Relativized codes. - Mark Daley; Helmut Jürgensen; Lila Kari; Kalpana Mahalingam (Theor. Comput. Sci., 2012)

Two-Dimensional Digitized Picture Arrays and Parikh Matrices. - K. G. Subramanian 001; Kalpana Mahalingam; Rosni Abdullah; Atulya K. Nagar (Int. J. Found. Comput. Sci., 2013)

Morphisms and Weak-Ratio Property. - Adrian Atanasiu; Kalpana Mahalingam; K. G. Subramanian 001 (Discrete Mathematics and Computer Science, 2014)

Pictures and Chomsky Languages in Array P System. - Williams Sureshkumar; Kalpana Mahalingam; Raghavan Rama 001 (Int. Conf. on Membrane Computing, 2015)

Some Algebraic Aspects of Parikh q-Matrices. - Somnath Bera; Kalpana Mahalingam (Int. J. Found. Comput. Sci., 2016)

Structural Properties of Word Representable Graphs. - Somnath Bera; Kalpana Mahalingam (Math. Comput. Sci., 2016)

Derivation Languages of Splicing P Systems. - Kalpana Mahalingam; Prithwineel Paul; Bosheng Song; Linqiang Pan; K. G. Subramanian 001 (BIC-TA, 2017)

Two-Dimensional Palindromes and Their Properties. - Manasi S. Kulkarni; Kalpana Mahalingam (LATA, 2017)

Watson-Crick Partial Words. - Manasi S. Kulkarni; Kalpana Mahalingam; Ananda Chandra Nayak (TPNC, 2017)

Label Languages of 8-directional Array P System. - Williams Sureshkumar; Kalpana Mahalingam; Raghavan Rama 001 (CoRR, 2017)

On Derivation Languages of a Class of Splicing Systems. - Kalpana Mahalingam; Prithwineel Paul; Erkki Mäkinen (Acta Cybern., 2018)

Properties of Parikh Matrices of Binary Words Obtained by an Extension of a Restricted Shuffle Operator. - Somnath Bera; Kalpana Mahalingam; K. G. Subramanian 001 (Int. J. Found. Comput. Sci., 2018)

Labelled graph rules in P systems. - Williams Sureshkumar; Kalpana Mahalingam; Raghavan Rama 001 (Iran J. Comput. Sci., 2018)

Relative Watson-Crick Primitivity of Words. - Lila Kari; Manasi S. Kulkarni; Kalpana Mahalingam (J. Autom. Lang. Comb., 2018)

On m-Bonacci-Sum Graphs. - Kalpana Mahalingam; Helda Princy Rajendran (CALDAM, 2019)

On the Maximum Number of Distinct Palindromic Sub-arrays. - Kalpana Mahalingam; Palak Pandoh (LATA, 2019)

Combinatorial Properties of Fibonacci Arrays. - Manasi S. Kulkarni; Kalpana Mahalingam; Sivasankar Mohankumar (TAMC, 2019)

Operation Insertion on the Conjugacy and Commutativity of Words. - Kalpana Mahalingam; Hirapra Ravi (TPNC, 2019)

Palindromes in two-dimensional Words. - Kalpana Mahalingam; Palak Pandoh (CoRR, 2019)

Theta Palindromes in Theta Conjugates. - Kalpana Mahalingam; Palak Pandoh; Anuran Maity (TPNC, 2020)

On Commuting Parikh q-Matrices. - Somnath Bera; Kalpana Mahalingam (Fundam. Informaticae, 2020)

Parikh q-Matrices and q-Ambiguous Words. - Somnath Bera; Rodica Ceterchi; Kalpana Mahalingam; K. G. Subramanian 001 (Int. J. Found. Comput. Sci., 2020)

Watson-Crick Jumping Finite Automata. - Kalpana Mahalingam; Ujjwal Kumar Mishra; Rama Raghavan 001 (Int. J. Found. Comput. Sci., 2020)

On Szilard Languages of InsDel Systems. - Kalpana Mahalingam; Prithwineel Paul (J. Autom. Lang. Comb., 2020)

On the least number of palindromes in two-dimensional words. - Kalpana Mahalingam; Palak Pandoh; Kamala Krithivasan (Theor. Comput. Sci., 2020)

m-Bonacci graceful labeling. - Kalpana Mahalingam; Helda Princy Rajendran (AKCE Int. J. Graphs Comb., 2021)

Generalized Linear One-Way Jumping Finite Automata. - Ujjwal Kumar Mishra; Kalpana Mahalingam; Rama Raghavan 001 (CoRR, 2021)

Generalized Circular One-Way Jumping Finite Automata. - Ujjwal Kumar Mishra; Kalpana Mahalingam; Rama Raghavan 001 (CoRR, 2021)

Counting scattered palindromes in a finite word. - Kalpana Mahalingam; Palak Pandoh (CoRR, 2021)

Involutive Fibonacci Words. - Lila Kari; Manasi S. Kulkarni; Kalpana Mahalingam; Zihao Wang (J. Autom. Lang. Comb., 2021)

Time Varying Splicing Recognizers. - Kalpana Mahalingam; Prithwineel Paul (SN Comput. Sci., 2021)

Block reversal on finite words. - Kalpana Mahalingam; Anuran Maity; Palak Pandoh; Rama Raghavan 001 (Theor. Comput. Sci., 2021)

Watson-Crick Powers of a Word. - Lila Kari; Kalpana Mahalingam (CAI, 2022)

Watson-Crick Jumping Finite Automata: Combination, Comparison and Closure. - Ujjwal Kumar Mishra; Kalpana Mahalingam; Raghavan Rama 001 (Comput. J., 2022)

Watson-Crick conjugates of words and languages. - Kalpana Mahalingam; Anuran Maity (CoRR, 2022)

Properties of m-bonacci-sum graphs. - Kalpana Mahalingam; Helda Princy Rajendran (Discret. Appl. Math., 2022)

Counting (Watson-Crick) palindromes in Watson-Crick conjugates. - Kalpana Mahalingam; Anuran Maity; Palak Pandoh (Inf. Comput., 2022)

Enumeration of two dimensional palindromes. - Kalpana Mahalingam; Palak Pandoh (Inf. Comput., 2022)

HV-Palindromes in Two-Dimensional Words. - Kalpana Mahalingam; Palak Pandoh (Int. J. Found. Comput. Sci., 2022)

Primitivity of Atom Watson-Crick Fibonacci Words. - Lila Kari; Kalpana Mahalingam; Palak Pandoh; Zihao Wang (J. Autom. Lang. Comb., 2022)

Rich words in the block reversal of a word. - Kalpana Mahalingam; Anuran Maity; Palak Pandoh (Discret. Appl. Math., 2023)