We stand with Ukraine  

P. Renjith

Orcid: 0000-0002-4934-4571

According to our database1, P. Renjith authored at least 19 papers between 2014 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On convexity in split graphs: complexity of Steiner tree and domination.
[BibTeX]
[DOI]
A. Mohanapriya
,
P. Renjith
,
N. Sadagopan
J. Comb. Optim., March, 2024

2023
2-Trees: Structural insights and the study of Hamiltonian paths.
[BibTeX]
[DOI]
P. Renjith
,
N. Sadagopan
Discret. Math. Algorithms Appl., May, 2023

Roman k-Domination: Hardness, Approximation and Parameterized Results.
[BibTeX]
[DOI]
A. Mohanapriya
,
P. Renjith
,
N. Sadagopan
Proceedings of the WALCOM: Algorithms and Computation, 2023

Short Cycles Dictate Dichotomy Status of the Steiner Tree Problem on Bisplit Graphs.
[BibTeX]
[DOI]
A. Mohanapriya
,
P. Renjith
,
N. Sadagopan
Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

2022
Steiner tree in k-star caterpillar convex bipartite graphs: a dichotomy.
[BibTeX]
[DOI]
Aneesh D. H
,
A. Mohanapriya
,
P. Renjith
,
N. Sadagopan
J. Comb. Optim., 2022

Hamiltonian Cycle in K1, r-Free Split Graphs - A Dichotomy.
[BibTeX]
[DOI]
P. Renjith
,
N. Sadagopan
Int. J. Found. Comput. Sci., 2022

P Versus NPC: Minimum Steiner Trees in Convex Split Graphs.
[BibTeX]
[DOI]
A. Mohanapriya
,
P. Renjith
,
N. Sadagopan
Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

2021
Hamiltonicity: Variants and Generalization in P<sup>5</sup>-free Chordal Bipartite graphs.
[BibTeX]
[DOI]
S. Aadhavan
,
R. Mahendra Kumar
,
P. Renjith
,
N. Sadagopan
CoRR, 2021

2020
The Steiner tree in K1, r-free split graphs - A Dichotomy.
[BibTeX]
[DOI]
P. Renjith
,
N. Sadagopan
Discret. Appl. Math., 2020

2018
Listing all spanning trees in Halin graphs - sequential and Parallel view.
[BibTeX]
[DOI]
K. Krishna Mohan Reddy
,
P. Renjith
,
N. Sadagopan
Discret. Math. Algorithms Appl., 2018

Hamiltonian Path in K_1, t -free Split Graphs- A Dichotomy.
[BibTeX]
[DOI]
Pazhaniappan Renjith
,
Narasimhan Sadagopan
Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2017
Hamiltonian Path in Split Graphs- a Dichotomy.
[BibTeX]
[DOI]
P. Renjith
,
N. Sadagopan
CoRR, 2017

On P<sub>5</sub>-free Chordal bipartite graphs.
[BibTeX]
[DOI]
S. Aadhavan
,
P. Renjith
,
N. Sadagopan
CoRR, 2017

FO and MSO approach to Some Graph Problems: Approximation and Poly time Results.
[BibTeX]
[DOI]
Kona Harshita
,
Sounaka Mishra
,
P. Renjith
,
N. Sadagopan
CoRR, 2017

Hamiltonicity in Split Graphs - A Dichotomy.
[BibTeX]
[DOI]
P. Renjith
,
N. Sadagopan
Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016
Spanning Trees in 2-trees.
[BibTeX]
[DOI]
P. Renjith
,
N. Sadagopan
,
Douglas B. West
CoRR, 2016

Complexity of Steiner Tree in Split Graphs - Dichotomy Results.
[BibTeX]
[DOI]
Madhu Illuri
,
P. Renjith
,
N. Sadagopan
Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

2015
Hamiltonian Path in 2-Trees.
[BibTeX]
[DOI]
P. Renjith
,
N. Sadagopan
CoRR, 2015

2014
Spanning Tree Enumeration in 2-trees: Sequential and Parallel Perspective.
[BibTeX]
[DOI]
Vandhana C.
,
S. Hima Bindhu
,
P. Renjith
,
N. Sadagopan
,
B. Supraja
CoRR, 2014


  Loading...