On embedding subclasses of height-balanced trees in hypercubes. - Sheshayya A. Choudum; Indhumathi Raman (Inf. Sci., 2009)

On Embedding of Certain Recursive Trees and Stars into Hypercube. - Indhumathi Raman (WALCOM, 2013)

Embedding certain height-balanced trees and complete pm-ary trees into hypercubes. - Indhumathi Raman; Sheshayya A. Choudum (J. Discrete Algorithms, 2013)

Edge-Disjoint Fibonacci Trees in Hypercube. - Indhumathi Raman; Lakshmanan Kuppusamy (J. Comput. Networks Commun., 2014)

Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (DCFS, 2016)

Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (UCNC, 2016)

Certain height-balanced subtrees of hypercubes. - Indhumathi Raman (Int. J. Comput. Math. Comput. Syst. Theory, 2016)

On Succinct Description of Certain Context-Free Languages by Ins-Del and Matrix Ins-Del Systems. - Lakshmanan Kuppusamy; Indhumathi Raman; Kamala Krithivasan (Int. J. Found. Comput. Sci., 2016)

Graph-Controlled Insertion-Deletion Systems Generating Language Classes Beyond Linearity. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (DCFS, 2017)

Computational Completeness of Path-Structured Graph-Controlled Insertion-Deletion Systems. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (CIAA, 2017)

On the Generative Power of Graph-Controlled Insertion-Deletion Systems with Small Sizes. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (J. Autom. Lang. Comb., 2017)

On the computational completeness of graph-controlled insertion-deletion systems with binary sizes. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (Theor. Comput. Sci., 2017)

Minimizing Rules and Nonterminals in Semi-conditional Grammars: Non-trivial for the Simple Case. - Henning Fernau; Lakshmanan Kuppusamy; Rufus O. Oladele; Indhumathi Raman (MCU, 2018)

Computational Completeness of Simple Semi-conditional Insertion-Deletion Systems. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (UCNC, 2018)

On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (RAIRO Theor. Informatics Appl., 2018)

Properties of Language Classes Between Linear and Context-Free. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (J. Autom. Lang. Comb., 2018)

Investigations on the power of matrix insertion-deletion systems with small sizes. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (Nat. Comput., 2018)

Descriptional Complexity of Matrix Simple Semi-conditional Grammars. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (DCFS, 2019)

On Matrix Ins-Del Systems of Small Sum-Norm. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (SOFSEM, 2019)

On path-controlled insertion-deletion systems. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (Acta Informatica, 2019)

Computational completeness of simple semi-conditional insertion-deletion systems of degree (2, 1). - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (Nat. Comput., 2019)

On the Power of Generalized Forbidding Insertion-Deletion Systems. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (DCFS, 2020)

Generalized Forbidding Matrix Grammars and Their Membrane Computing Perspective. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (Int. Conf. on Membrane Computing, 2020)

Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars. - Henning Fernau; Lakshmanan Kuppusamy; Rufus O. Oladele; Indhumathi Raman (Fundam. Informaticae, 2021)

On the generative capacity of matrix insertion-deletion systems of small sum-norm. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (Nat. Comput., 2021)

Improved descriptional complexity results on generalized forbidding grammars. - Henning Fernau; Lakshmanan Kuppusamy; Rufus O. Oladele; Indhumathi Raman (Discret. Appl. Math., 2022)

On the computational completeness of matrix simple semi-conditional grammars. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (Inf. Comput., 2022)

When Stars Control a Grammar's Work. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (AFL, 2023)

Counting Simple Rules in Semi-conditional Grammars is not Simple. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (CiE, 2024)

Succinct Star-Controlled Insertion-Deletion Systems Using Space Separating Normal Forms. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (MCU, 2024)

Chromatic numbers of certain hypercube variants. - Indhumathi Raman (Int. J. Comput. Math. Comput. Syst. Theory, 2024)

On the computational completeness of generalized forbidding matrix grammars. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (Theor. Comput. Sci., 2024)

Generalized Lettericity of Graphs. - Zhidan Feng 002; Henning Fernau; Kevin Mann; Indhumathi Raman; Silas Cato Sacher (CALDAM, 2025)

Matrix Forbidding Grammars. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman; György Vaszil (DCFS, 2025)

On Computational Completeness of Semi-Conditional Matrix Grammars. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (SOFSEM (1), 2025)