Publications

Color-Constrained Arborescences in Edge-Colored Digraphs
P. S. Ardra and Jasine Babu and R. Krithika and Deepak Rajendraprasad
Electron. J. Comb. 33 (1) (2026)
Computing eternal vertex cover number of maximal outerplanar graphs in linear time
Jasine Babu and K. Murali Krishnan and Veena Prabhakaran and Nandini J. Warrier
Theor. Comput. Sci. 1056 115530 (2025)
A Correct by Construction Fault Tolerant Voter for Input Selection of a Control System
Arif Ali AP and Jasine Babu and Deepa Sara John
LIPIcs 45th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2025 LIPIcs 6:1--6:20 (2025)
Arborescences and Shortest Path Trees when Colors Matter
P. S. Ardra and Jasine Babu and Kritika Kashyap and R. Krithika and Sreejith K. Pallathumadam and Deepak Rajendraprasad
Theor. Comput. Sci. 1055 115486 (2025)
Packing arc-disjoint cycles in oriented graphs
Jasine Babu and Ajay Saju Jacob and R. Krithika and Deepak Rajendraprasad
J. Comput. Syst. Sci. 143 103530 (2024)
Improved bounds for the oriented radius of mixed multigraphs
Jasine Babu and Deepu Benson and Deepak Rajendraprasad
J. Graph Theory 103 (4) 674--689 (2023)
Eternal Vertex Cover on Bipartite Graphs.
Jasine Babu, Neeldhara Misra, Saraswati Nanoti
Computer Science Symposium in Russia (CSR 2022) 64-76 (2022)
A new lower bound for the eternal vertex cover number of graphs.
Jasine Babu, Veena Prabhakaran
J. Comb. Optim. 44 (4) 2482-2498 (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 and J. Nandini Warrier
Discrete Applied Mathematics 319 171-182 (2022)
An improvement to Chvátal and Thomassen's upper bound for oriented diameter.
Jasine Babu, Deepu Benson, Deepak Rajendraprasad, Sai Nishant Vaka
Discrete Applied Mathematics 304 432-440 (2021)
A substructure based lower bound for eternal vertex cover number
Jasine Babu, Veena Prabhakaran, Arko Sharma
Theoretical Computer Science 890 87-104 (2021)
A Local Characterization for Perfect Plane Near-triangulations
Sameera Muhamed Salam, Jasine Babu, K. Murali Krishnan
Theor. Comput. Sci. 840 45--58 (2020)
A New Lower Bound for the Eternal Vertex Cover Number of Graphs
Jasine Babu, Veena Prabhakaran
Proceedings of the 26th International Conference on Computing and Combinatorics (COCOON 2020), Springer Lecture Notes in Computer Scinece Series 12273 27--39 (2020)
A Substructure based Lower Bound for Eternal Vertex Cover Number
Jasine Babu, Veena Prabhakaran, Arko Sharma
Proceedings of the 21st Italian Conference on Theoretical Computer Science (ICTCS 2020), CEUR Workshop Proceedings Series 2756 1--14 (2020)
An Improvement to Chvátal and Thomassen's Upper Bound for Oriented Diameter
Jasine Babu, Deepu Benson, Deepak Rajendraprasad, Sai Nishant Vaka
Proceedings of the 15th International Computer Science Symposium in Russia (CSR 2020), Springer Lecture Notes in Computer Science Series 12159 117--129 (2020)
On induced colourful paths in triangle-free graphs.
Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis
Discrete Applied Mathematics 255 109-116 (2019)
On Graphs with Minimal Eternal Vertex Cover Number
Jasine Babu, L. Sunil Chandran, Mathew C. Francis, Veena Prabhakaran, Deepak Rajendraprasad, J. Nandini Warrier
Springer Lecture Notes in Computer Science, Proceedings of CALDAM 2019 11394) 263-273 (2019)
A Fix-Point Characterization of Herbrand Equivalence of Expressions in Data Flow Frameworks
Jasine Babu, Karunakaran Murali Krishnan, Vineeth Paleri
Springer Lecture Notes in Computer Science, Proceedings of ICLA 2019 11600 160--172 (2019)
Sublinear approximation algorithms for boxicity and related problems
Abhijin Adiga, Jasine Babu, L. Sunil Chandran
Discrete Applied Mathematics 236 7-22 (2018)
On Induced Colourful Paths in Triangle-free Graphs
Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis
The European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'17) 61 69-75 (2017)