Polynomial Time and Parameterized Approximation Algorithms for Boxicity. - Abhijin Adiga; Jasine Babu; L. Sunil Chandran (IPEC, 2012)

Parameterized and Approximation Algorithms for Boxicity - Abhijin Adiga; Jasine Babu; L. Sunil Chandran (CoRR, 2012)

Approximating the Cubicity of Trees. - Jasine Babu; Manu Basavaraju; L. Sunil Chandran; Deepak Rajendraprasad; Naveen Sivadasan (CoRR, 2014)

A constant factor approximation algorithm for boxicity of circular arc graphs. - Abhijin Adiga; Jasine Babu; L. Sunil Chandran (Discret. Appl. Math., 2014)

2-Connecting outerplanar graphs without blowing up the pathwidth. - Jasine Babu; Manu Basavaraju; L. Sunil Chandran; Deepak Rajendraprasad (Theor. Comput. Sci., 2014)

Fixed-orientation equilateral triangle matching of point sets. - Jasine Babu; Ahmad Biniaz; Anil Maheshwari; Michiel H. M. Smid (Theor. Comput. Sci., 2014)

Rainbow matchings in strongly edge-colored graphs. - Jasine Babu; L. Sunil Chandran; Krishna Vaidyanathan (Discret. Math., 2015)

Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs. - Jasine Babu; L. Sunil Chandran; Deepak Rajendraprasad (Eur. J. Comb., 2015)

Every Property of Outerplanar Graphs is Testable. - Jasine Babu; Areej Khoury; Ilan Newman (APPROX-RANDOM, 2016)

Sublinear approximation algorithms for boxicity and related problems. - Abhijin Adiga; Jasine Babu; L. Sunil Chandran (Discret. Appl. Math., 2018)

On Graphs with Minimal Eternal Vertex Cover Number. - Jasine Babu; L. Sunil Chandran; Mathew C. Francis; Veena Prabhakaran; Deepak Rajendraprasad; J. Nandini Warrier (CALDAM, 2019)

A Fix-Point Characterization of Herbrand Equivalence of Expressions in Data Flow Frameworks. - Jasine Babu; Karunakaran Murali Krishnan; Vineeth Paleri (ICLA, 2019)

A new lower bound for eternal vertex cover number. - Jasine Babu; Veena Prabhakaran (CoRR, 2019)

On induced colourful paths in triangle-free graphs. - Jasine Babu; Manu Basavaraju; L. Sunil Chandran; Mathew C. Francis (Discret. Appl. Math., 2019)

A Note on Arc-Disjoint Cycles in Bipartite Tournaments. - Jasine Babu; Ajay Saju Jacob; R. Krithika 001; Deepak Rajendraprasad (CoRR, 2020)

A Linear Time Algorithm for Computing the Eternal Vertex Cover Number of Cactus Graphs. - Jasine Babu; Veena Prabhakaran; Arko Sharma (CoRR, 2020)

A local characterization for perfect plane near-triangulations. - Sameera Muhamed Salam; Jasine Babu; K. Murali Krishnan 001 (Theor. Comput. Sci., 2020)

An improvement to Chvátal and Thomassen's upper bound for oriented diameter. - Jasine Babu; Deepu Benson; Deepak Rajendraprasad; Sai Nishant Vaka (Discret. Appl. Math., 2021)

A substructure based lower bound for eternal vertex cover number. - Jasine Babu; Veena Prabhakaran; Arko Sharma (Theor. Comput. Sci., 2021)

Eternal Vertex Cover on Bipartite Graphs. - Jasine Babu; Neeldhara Misra; Saraswati Nanoti (CSR, 2022)

Packing Arc-Disjoint 4-Cycles in Oriented Graphs. - Jasine Babu; R. Krithika 001; Deepak Rajendraprasad (FSTTCS, 2022)

Eternal vertex cover number of maximal outerplanar graphs. - Jasine Babu; K. Murali Krishnan 001; Veena Prabhakaran; J. Nandini Warrier (CoRR, 2022)

On graphs whose eternal vertex cover number and vertex cover number coincide. - Jasine Babu; L. Sunil Chandran; Mathew C. Francis; Veena Prabhakaran; Deepak Rajendraprasad; J. Nandini Warrier (Discret. Appl. Math., 2022)

A new lower bound for the eternal vertex cover number of graphs. - Jasine Babu; Veena Prabhakaran (J. Comb. Optim., 2022)

Improved bounds for the oriented radius of mixed multigraphs. - Jasine Babu; Deepu Benson; Deepak Rajendraprasad (J. Graph Theory, 2023)

Packing arc-disjoint cycles in oriented graphs. - Jasine Babu; Ajay Saju Jacob; R. Krithika 001; Deepak Rajendraprasad (J. Comput. Syst. Sci., 2024)

Arborescences and shortest path trees when colors matter. - P. S. Ardra; Jasine Babu; Kritika Kashyap; R. Krithika 001; Sreejith K. Pallathumadam; Deepak Rajendraprasad (Theor. Comput. Sci., 2025)

Computing eternal vertex cover number of maximal outerplanar graphs in linear time. - Jasine Babu; K. Murali Krishnan 001; Veena Prabhakaran; Nandini J. Warrier (Theor. Comput. Sci., 2025)

Color-Constrained Arborescences in Edge-Colored Digraphs. - P. S. Ardra; Jasine Babu; R. Krithika 001; Deepak Rajendraprasad (CoRR, 2025)