Research Scholar

P. Renjith

Ph.D - Computer Engineering 2014

E-mail: coe14d002@iiitdm.ac.in

Career Objective

My research mainly focuses on scrutinizing "Hard" problems in graph theory.

Area of Research

Graph Algorithms Graph Theory

Education

Indian Institute of Information Technology, Design and Manufacturing, Kancheepuram

Chennai

Graph Algorithms

2014 - 2018

College of Engineering Trivandrum

Trivandrum

Computer Science

2011 - 2013

College of Engineering Perumon (CUSAT)

Kollam

Computer Science

2006 - 2010

Work Experience

Heera College of Engineering and Technology

Trivandrum

Asst. Professor

2013 - 2014

Publications

Hamiltonicity in split graphs - a dichotomy

February, 2017

In proceedings of Conference on Algorithm and Discrete Applied Mathematics, CALDAM 2017, LNCS vol. 10156, pp. 320-331, Springer.

Complexity of Steiner Tree in Split Graphs - Dichotomy Results

June, 2016

Submitted to Discrete Applied Mathematics

Complexity of Steiner Tree in Split Graphs - Dichotomy Results

February, 2016

In proceedings of Conference on Algorithm and Discrete Applied Mathematics, CALDAM 2016, LNCS vol. 9602, pp. 308-325, Springer, DOI 10.1007/978-3-319-29221-2.

Spanning Tree enumeration without repetitions in Halin graph: Sequential and parallel view.

June, 2016

In 31st Annual Conference of the Ramanujan Mathematical Society, Tiruchirapalli.

Spanning tree enumeration in 2-trees: Sequential and Parallel perspective

December, 2015

In ICGTA 2015, Amrita School of Engineering, Coimbatore.

Institute Login
© IIITDM Kancheepuram 2017
Best viewed in Safari, Chrome and Firefox.