| Embedding height balanced trees and Fibonacci trees in hypercubes SA Choudum, I Raman Journal of Applied Mathematics and Computing 30 (1), 39-52, 2009 | 19 | 2009 |
| On embedding subclasses of height-balanced trees in hypercubes SA Choudum, R Indhumathi Information Sciences 179 (9), 1333-1347, 2009 | 15 | 2009 |
| On the computational completeness of graph-controlled insertion–deletion systems with binary sizes H Fernau, L Kuppusamy, I Raman Theoretical Computer Science 682, 100-121, 2017 | 12 | 2017 |
| On path-controlled insertion–deletion systems H Fernau, L Kuppusamy, I Raman Acta Informatica 56, 35-59, 2019 | 11 | 2019 |
| Investigations on the power of matrix insertion-deletion systems with small sizes H Fernau, L Kuppusamy, I Raman Natural Computing 17, 249-269, 2018 | 11 | 2018 |
| Graph-controlled insertion-deletion systems generating language classes beyond linearity H Fernau, L Kuppusamy, I Raman International Conference on Descriptional Complexity of Formal Systems, 128-139, 2017 | 11 | 2017 |
| On the Generative Power of Graph-Controlled Insertion-Deletion Systems with Small Sizes. H Fernau, L Kuppusamy, I Raman J. Autom. Lang. Comb. 22 (1-3), 61-92, 2017 | 10 | 2017 |
| Descriptional complexity of graph-controlled insertion-deletion systems H Fernau, L Kuppusamy, I Raman International Conference on Descriptional Complexity of Formal Systems, 111-125, 2016 | 10 | 2016 |
| Improved descriptional complexity results on generalized forbidding grammars H Fernau, L Kuppusamy, RO Oladele, I Raman Discrete Applied Mathematics 319, 2-18, 2022 | 8 | 2022 |
| Properties of Language Classes Between Linear and Context-Free. H Fernau, L Kuppusamy, I Raman J. Autom. Lang. Comb. 23 (4), 329-360, 2018 | 8 | 2018 |
| Generative power of matrix insertion-deletion systems with context-free insertion or deletion H Fernau, L Kuppusamy, I Raman Unconventional Computation and Natural Computation: 15th International …, 2016 | 8 | 2016 |
| On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems H Fernau, L Kuppusamy, I Raman RAIRO-Theoretical Informatics and Applications 52 (1), 1-21, 2018 | 7 | 2018 |
| Computational completeness of simple semi-conditional insertion-deletion systems H Fernau, L Kuppusamy, I Raman Unconventional Computation and Natural Computation: 17th International …, 2018 | 7 | 2018 |
| Computational completeness of path-structured graph-controlled insertion-deletion systems H Fernau, L Kuppusamy, I Raman Implementation and Application of Automata: 22nd International Conference …, 2017 | 7 | 2017 |
| Embedding certain height-balanced trees and complete pm-ary trees into hypercubes R Indhumathi, SA Choudum Journal of Discrete Algorithms 22, 53-65, 2013 | 7 | 2013 |
| Improved descriptional complexity results for simple semi-conditional grammars H Fernau, L Kuppusamy, RO Oladele, I Raman Fundamenta Informaticae 181 (2-3), 189-211, 2021 | 4 | 2021 |
| On succinct description of certain context-free languages by ins-del and matrix ins-del systems L Kuppusamy, I Raman, K Krithivasan International Journal of Foundations of Computer Science 27 (07), 775-786, 2016 | 4 | 2016 |
| Computational Intelligence, Cyber Security and Computational Models. Recent Trends in Computational Models, Intelligent and Secure Systems: 5th International Conference, ICC3 … I Raman, P Ganesan, V Sureshkumar, L Ranganathan Springer Nature, 2022 | 3 | 2022 |
| On the power of generalized forbidding insertion-deletion systems H Fernau, L Kuppusamy, I Raman International Conference on Descriptional Complexity of Formal Systems, 52-63, 2020 | 3 | 2020 |
| Computational completeness of simple semi-conditional insertion–deletion systems of degree (2, 1) H Fernau, L Kuppusamy, I Raman Natural Computing 18, 563-577, 2019 | 3 | 2019 |
