Jasine Babu

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