Obserwuj
VEENA PRABHAKARAN
VEENA PRABHAKARAN
Indian Institute of Technology, Palakkad
Zweryfikowany adres z smail.iitpkd.ac.in
Tytuł
Cytowane przez
Cytowane przez
Rok
On graphs whose eternal vertex cover number and vertex cover number coincide
J Babu, LS Chandran, M Francis, V Prabhakaran, D Rajendraprasad, ...
Discrete Applied Mathematics 319, 171-182, 2022
102022
A new lower bound for the eternal vertex cover number of graphs
J Babu, V Prabhakaran
Journal of Combinatorial Optimization 44 (4), 2482-2498, 2022
92022
A substructure based lower bound for eternal vertex cover number
J Babu, V Prabhakaran, A Sharma
Theoretical Computer Science 890, 87-104, 2021
82021
On graphs with minimal eternal vertex cover number
J Babu, LS Chandran, M Francis, V Prabhakaran, D Rajendraprasad, ...
Conference on Algorithms and Discrete Applied Mathematics, 263-273, 2019
72019
A linear time algorithm for computing the eternal vertex cover number of cactus graphs
J Babu, V Prabhakaran, A Sharma
arXiv preprint arXiv:2005.08058, 2020
32020
A new lower bound for eternal vertex cover number
J Babu, V Prabhakaran
arXiv preprint arXiv:1910.05042, 2019
22019
Eternal vertex cover number of maximal outerplanar graphs
J Babu, KM Krishnan, V Prabhakaran, NJ Warrier
arXiv preprint arXiv:2201.06577, 2022
2022
Computing Eternal Vertex Cover Number on Maximal Outerplanar Graphs in Linear Time.
J Babu, KM Krishnan, V Prabhakaran, NJ Warrier
ICTCS, 21-33, 2022
2022
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–8