On Generating Trees by P Systems with Active Membranes. - Raghavan Rama 001; H. Ramesh 001 (SYNASC, 2005)

Further Results on Contextual and Rewriting P Systems. - Shankara Narayanan Krishna; Raghavan Rama 001; H. Ramesh 001 (Fundam. Informaticae, 2005)

On the Power of Bio-Turing Machines. - H. Ramesh 001; Shankara Narayanan Krishna; Raghavan Rama 001 (UC, 2006)

Rewriting P Systems with Conditional Communication: Improved Hierarchies. - H. Ramesh 001; Raghavan Rama 001 (Comput. Informatics, 2008)

Further Results on Languages of Membrane Structures - Raghavan Rama 001; H. Ramesh 001; Marian Gheorghe 001; Shankara Narayanan Krishna (CoRR, 2011)

On Restricted Bio-Turing Machines. - Rama Raghavan 001; H. Ramesh 001; Marian Gheorghe 001; Shankara Narayanan Krishna (Fundam. Informaticae, 2011)

Fault-Tolerant Gathering of Mobile Robots with Weak Multiplicity Detection. - Debasish Pattanayak; Kaushik Mondal 001; H. Ramesh 001; Partha Sarathi Mandal 001 (ICDCN, 2017)

Evacuating Two Robots from Two Unknown Exits on the Perimeter of a Disk. - Debasish Pattanayak; H. Ramesh 001; Partha Sarathi Mandal 001; Stefan Schmid 001 (CoRR, 2017)

Evacuating Two Robots from Two Unknown Exits on the Perimeter of a Disk with Wireless Communication. - Debasish Pattanayak; H. Ramesh 001; Partha Sarathi Mandal 001; Stefan Schmid 001 (ICDCN, 2018)

Chauffeuring a Crashed Robot from a Disk. - Debasish Pattanayak; H. Ramesh 001; Partha Sarathi Mandal 001 (ALGOSENSORS, 2019)

Gathering of mobile robots with weak multiplicity detection in presence of crash-faults. - Debasish Pattanayak; Kaushik Mondal 001; H. Ramesh 001; Partha Sarathi Mandal 001 (J. Parallel Distributed Comput., 2019)

Collaborative Evacuation of Mobile Robots. - Debasish Pattanayak; H. Ramesh 001; Partha Sarathi Mandal 001 (ICDCN, 2020)

Minimum length word-representants of graph products. - Eshwar Srinivasan; Ramesh Hariharasubramanian (Discret. Appl. Math., 2024)

Minimum length word-representants of word-representable graphs. - Eshwar Srinivasan; Ramesh Hariharasubramanian (Discret. Appl. Math., 2024)

On semi-transitive orientability of circulant graphs. - Eshwar Srinivasan; Ramesh Hariharasubramanian (Discret. Appl. Math., 2025)

p-complete square-free Word-representation of Word-representable Graphs. - Biswajit Das; Ramesh Hariharasubramanian (CoRR, 2025)

Word-Representability of Split Graphs with Independent Set of Size 4. - Suchanda Roy; Ramesh Hariharasubramanian (CoRR, 2025)