Jasine Babu

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 32

Top Topics

Constant Factor Approximation Algorithm

Top Venues

Discret. Appl. Math.

Theor. Comput. Sci.

Publications

P. S. Ardra, Jasine Babu, Kritika Kashyap, R. Krithika, Sreejith K. Pallathumadam, Deepak Rajendraprasad
Arborescences and Shortest Path Trees when Colors Matter. CoRR (2024)
Jasine Babu, Ajay Saju Jacob, R. Krithika, Deepak Rajendraprasad
Packing arc-disjoint cycles in oriented graphs. J. Comput. Syst. Sci. 143 (2024)
Jasine Babu, Deepu Benson, Deepak Rajendraprasad
Improved bounds for the oriented radius of mixed multigraphs. J. Graph Theory 103 (4) (2023)
Jasine Babu, Veena Prabhakaran
A new lower bound for the eternal vertex cover number of graphs. J. Comb. Optim. 44 (4) (2022)
Jasine Babu, R. Krithika, Deepak Rajendraprasad
Packing Arc-Disjoint 4-Cycles in Oriented Graphs. FSTTCS (2022)
Jasine Babu, K. Murali Krishnan, Veena Prabhakaran, J. Nandini Warrier
Eternal vertex cover number of maximal outerplanar graphs. CoRR (2022)
Jasine Babu, L. Sunil Chandran, Mathew C. Francis, Veena Prabhakaran, Deepak Rajendraprasad, J. Nandini Warrier
On graphs whose eternal vertex cover number and vertex cover number coincide. Discret. Appl. Math. 319 (2022)
Jasine Babu, Neeldhara Misra, Saraswati Nanoti
Eternal Vertex Cover on Bipartite Graphs. CSR (2022)
Jasine Babu, Karunakaran Murali Krishnan, Veena Prabhakaran, Nandini J. Warrier
Computing Eternal Vertex Cover Number on Maximal Outerplanar Graphs in Linear Time. ICTCS (2022)
Jasine Babu, Deepu Benson, Deepak Rajendraprasad, Sai Nishant Vaka
An improvement to Chvátal and Thomassen's upper bound for oriented diameter. Discret. Appl. Math. 304 (2021)
Jasine Babu, Veena Prabhakaran, Arko Sharma
A substructure based lower bound for eternal vertex cover number. Theor. Comput. Sci. 890 (2021)
Jasine Babu, Deepu Benson, Deepak Rajendraprasad
Improved Bounds for the Oriented Radius of Mixed Multigraphs. CoRR (2021)
Jasine Babu, Veena Prabhakaran, Arko Sharma
A Linear Time Algorithm for Computing the Eternal Vertex Cover Number of Cactus Graphs. CoRR (2020)
Jasine Babu, Deepu Benson, Deepak Rajendraprasad, Sai Nishant Vaka
An Improvement to Chvátal and Thomassen's Upper Bound for Oriented Diameter. CoRR (2020)
Jasine Babu, Veena Prabhakaran, Arko Sharma
A Substructure based Lower Bound for Eternal Vertex Cover Number. ICTCS (2020)
Jasine Babu, Deepu Benson, Deepak Rajendraprasad, Sai Nishant Vaka
An Improvement to Chvátal and Thomassen's Upper Bound for Oriented Diameter. CSR (2020)
Jasine Babu, Veena Prabhakaran
A New Lower Bound for the Eternal Vertex Cover Number of Graphs. COCOON (2020)
Jasine Babu, Ajay Saju Jacob, R. Krithika, Deepak Rajendraprasad
A Note on Arc-Disjoint Cycles in Bipartite Tournaments. CoRR (2020)
Sameera Muhamed Salam, Jasine Babu, K. Murali Krishnan
A local characterization for perfect plane near-triangulations. Theor. Comput. Sci. 840 (2020)
Jasine Babu, Veena Prabhakaran
A new lower bound for eternal vertex cover number. CoRR (2019)
Jasine Babu, L. Sunil Chandran, Mathew C. Francis, Veena Prabhakaran, Deepak Rajendraprasad, J. Nandini Warrier
On Graphs with Minimal Eternal Vertex Cover Number. CALDAM (2019)
Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis
On induced colourful paths in triangle-free graphs. Discret. Appl. Math. 255 (2019)
Jasine Babu, Karunakaran Murali Krishnan, Vineeth Paleri
A Fix-Point Characterization of Herbrand Equivalence of Expressions in Data Flow Frameworks. ICLA (2019)
Sameera Muhamed Salam, Jasine Babu, K. Murali Krishnan
A local characterization for perfect plane near-triangulations. CoRR (2019)
Jasine Babu, L. Sunil Chandran, Mathew C. Francis, Veena Prabhakaran, Deepak Rajendraprasad, J. Nandini Warrier
On Graphs with Minimal Eternal Vertex Cover Number. CoRR (2018)
Abhijin Adiga, Jasine Babu, L. Sunil Chandran
Sublinear approximation algorithms for boxicity and related problems. Discret. Appl. Math. 236 (2018)
Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis
On Induced Colourful Paths in Triangle-free Graphs. Electron. Notes Discret. Math. 61 (2017)
Jasine Babu, K. Murali Krishnan, Vineeth Paleri
A fix-point characterization of Herbrand equivalence of expressions in data flow frameworks. CoRR (2017)
Jasine Babu, Areej Khoury, Ilan Newman
Every Property of Outerplanar Graphs is Testable. APPROX-RANDOM (2016)
Jasine Babu, L. Sunil Chandran, Deepak Rajendraprasad
Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs. Eur. J. Comb. 48 (2015)
Abhijin Adiga, Jasine Babu, L. Sunil Chandran
Sublinear Approximation Algorithms for Boxicity and Related Problems. CoRR (2015)
Jasine Babu, L. Sunil Chandran, Krishna Vaidyanathan
Rainbow matchings in strongly edge-colored graphs. Discret. Math. 338 (7) (2015)
Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Naveen Sivadasan
Approximating the Cubicity of Trees. CoRR (2014)
Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad
2-Connecting outerplanar graphs without blowing up the pathwidth. Theor. Comput. Sci. 554 (2014)
Abhijin Adiga, Jasine Babu, L. Sunil Chandran
A constant factor approximation algorithm for boxicity of circular arc graphs. Discret. Appl. Math. 178 (2014)
Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
Fixed-orientation equilateral triangle matching of point sets. Theor. Comput. Sci. 555 (2014)
Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
Fixed-Orientation Equilateral Triangle Matching of Point Sets. WALCOM (2013)
Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad
2-connecting Outerplanar Graphs without Blowing Up the Pathwidth. COCOON (2013)
Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
Fixed-Orientation Equilateral Triangle Matching of Point Sets CoRR (2012)
Abhijin Adiga, Jasine Babu, L. Sunil Chandran
Polynomial Time and Parameterized Approximation Algorithms for Boxicity. IPEC (2012)
Abhijin Adiga, Jasine Babu, L. Sunil Chandran
Parameterized and Approximation Algorithms for Boxicity CoRR (2012)
Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad
2-connecting Outerplanar Graphs without Blowing Up the Pathwidth CoRR (2012)
Abhijin Adiga, Jasine Babu, L. Sunil Chandran
A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs CoRR (2011)
Abhijin Adiga, Jasine Babu, L. Sunil Chandran
A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs. WADS (2011)