Follow
Jasine Babu
Jasine Babu
Computer Science and Engineering, IIT Palakkad
Verified email at iitpkd.ac.in - Homepage
Title
Cited by
Cited by
Year
Every property of outerplanar graphs is testable
J Babu, A Khoury, I Newman
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2016
182016
An improvement to Chvátal and Thomassen’s upper bound for oriented diameter
J Babu, D Benson, D Rajendraprasad, SN Vaka
Discrete Applied Mathematics 304, 432-440, 2021
122021
Fixed-orientation equilateral triangle matching of point sets
J Babu, A Biniaz, A Maheshwari, M Smid
Theoretical Computer Science 555, 55-70, 2014
122014
Rainbow matchings in strongly edge-colored graphs
J Babu, LS Chandran, K Vaidyanathan
Discrete Mathematics 338 (7), 1191-1196, 2015
112015
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
Sublinear approximation algorithms for boxicity and related problems
A Adiga, J Babu, LS Chandran
Discrete Applied Mathematics 236, 7-22, 2018
10*2018
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
2-connecting outerplanar graphs without blowing up the pathwidth
J Babu, M Basavaraju, LS Chandran, D Rajendraprasad
Theoretical Computer Science 554, 119-134, 2014
82014
On induced colourful paths in triangle-free graphs
J Babu, M Basavaraju, LS Chandran, MC Francis
Discrete Applied Mathematics 255, 109-116, 2019
72019
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
Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs
J Babu, LS Chandran, D Rajendraprasad
European Journal of Combinatorics 48, 110-126, 2015
52015
Eternal vertex cover on bipartite graphs
J Babu, N Misra, SG Nanoti
International Computer Science Symposium in Russia, 64-76, 2022
42022
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 constant factor approximation algorithm for boxicity of circular arc graphs
A Adiga, J Babu, LS Chandran
Discrete Applied Mathematics 178, 1-18, 2014
32014
Approximating the cubicity of trees
J Babu, M Basavaraju, LS Chandran, D Rajendraprasad, N Sivadasan
arXiv preprint arXiv:1402.6310, 2014
32014
A new lower bound for eternal vertex cover number
J Babu, V Prabhakaran
arXiv preprint arXiv:1910.05042, 2019
22019
Packing arc-disjoint cycles in oriented graphs
J Babu, AS Jacob, R Krithika, D Rajendraprasad
Journal of Computer and System Sciences 143, 103530, 2024
12024
Improved bounds for the oriented radius of mixed multigraphs
J Babu, D Benson, D Rajendraprasad
Journal of Graph Theory 103 (4), 674-689, 2023
12023
Eternal vertex cover on bipartite and co-bipartite graphs
J Babu, N Misra, SG Nanoti
12022
The system can't perform the operation now. Try again later.
Articles 1–20