Every property of outerplanar graphs is testable J Babu, A Khoury, I Newman Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2016 | 18 | 2016 |

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 | 12 | 2021 |

Fixed-orientation equilateral triangle matching of point sets J Babu, A Biniaz, A Maheshwari, M Smid Theoretical Computer Science 555, 55-70, 2014 | 12 | 2014 |

Rainbow matchings in strongly edge-colored graphs J Babu, LS Chandran, K Vaidyanathan Discrete Mathematics 338 (7), 1191-1196, 2015 | 11 | 2015 |

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 | 10 | 2022 |

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 | 9 | 2022 |

A substructure based lower bound for eternal vertex cover number J Babu, V Prabhakaran, A Sharma Theoretical Computer Science 890, 87-104, 2021 | 8 | 2021 |

2-connecting outerplanar graphs without blowing up the pathwidth J Babu, M Basavaraju, LS Chandran, D Rajendraprasad Theoretical Computer Science 554, 119-134, 2014 | 8 | 2014 |

On induced colourful paths in triangle-free graphs J Babu, M Basavaraju, LS Chandran, MC Francis Discrete Applied Mathematics 255, 109-116, 2019 | 7 | 2019 |

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 | 7 | 2019 |

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 | 5 | 2015 |

Eternal vertex cover on bipartite graphs J Babu, N Misra, SG Nanoti International Computer Science Symposium in Russia, 64-76, 2022 | 4 | 2022 |

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 | 3 | 2020 |

A constant factor approximation algorithm for boxicity of circular arc graphs A Adiga, J Babu, LS Chandran Discrete Applied Mathematics 178, 1-18, 2014 | 3 | 2014 |

Approximating the cubicity of trees J Babu, M Basavaraju, LS Chandran, D Rajendraprasad, N Sivadasan arXiv preprint arXiv:1402.6310, 2014 | 3 | 2014 |

A new lower bound for eternal vertex cover number J Babu, V Prabhakaran arXiv preprint arXiv:1910.05042, 2019 | 2 | 2019 |

Packing arc-disjoint cycles in oriented graphs J Babu, AS Jacob, R Krithika, D Rajendraprasad Journal of Computer and System Sciences 143, 103530, 2024 | 1 | 2024 |

Improved bounds for the oriented radius of mixed multigraphs J Babu, D Benson, D Rajendraprasad Journal of Graph Theory 103 (4), 674-689, 2023 | 1 | 2023 |

Eternal vertex cover on bipartite and co-bipartite graphs J Babu, N Misra, SG Nanoti | 1 | 2022 |