default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJasine Babu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Jasine Babu, Ajay Saju Jacob, R. Krithika
, Deepak Rajendraprasad:
Packing arc-disjoint cycles in oriented graphs. J. Comput. Syst. Sci. 143: 103530 (2024)- [i16]P. S. Ardra, Jasine Babu, Kritika Kashyap, R. Krithika, Sreejith K. Pallathumadam, Deepak Rajendraprasad:
Arborescences and Shortest Path Trees when Colors Matter. CoRR abs/2403.06580 (2024) - 2023
- [j14]Jasine Babu, Deepu Benson, Deepak Rajendraprasad:
Improved bounds for the oriented radius of mixed multigraphs. J. Graph Theory 103(4): 674-689 (2023) - 2022
- [j13]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: 171-182 (2022) - [j12]Jasine Babu, Veena Prabhakaran:
A new lower bound for the eternal vertex cover number of graphs. J. Comb. Optim. 44(4): 2482-2498 (2022) - [c13]Jasine Babu, Neeldhara Misra, Saraswati Nanoti:
Eternal Vertex Cover on Bipartite Graphs. CSR 2022: 64-76 - [c12]Jasine Babu, R. Krithika, Deepak Rajendraprasad:
Packing Arc-Disjoint 4-Cycles in Oriented Graphs. FSTTCS 2022: 5:1-5:16 - [c11]Jasine Babu, Karunakaran Murali Krishnan, Veena Prabhakaran, Nandini J. Warrier:
Computing Eternal Vertex Cover Number on Maximal Outerplanar Graphs in Linear Time. ICTCS 2022: 21-33 - [i15]Jasine Babu, K. Murali Krishnan, Veena Prabhakaran, J. Nandini Warrier:
Eternal vertex cover number of maximal outerplanar graphs. CoRR abs/2201.06577 (2022) - 2021
- [j11]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: 432-440 (2021) - [j10]Jasine Babu, Veena Prabhakaran, Arko Sharma:
A substructure based lower bound for eternal vertex cover number. Theor. Comput. Sci. 890: 87-104 (2021) - [i14]Jasine Babu, Deepu Benson, Deepak Rajendraprasad:
Improved Bounds for the Oriented Radius of Mixed Multigraphs. CoRR abs/2105.02356 (2021) - 2020
- [j9]Sameera Muhamed Salam, Jasine Babu, K. Murali Krishnan:
A local characterization for perfect plane near-triangulations. Theor. Comput. Sci. 840: 45-58 (2020) - [c10]Jasine Babu, Veena Prabhakaran:
A New Lower Bound for the Eternal Vertex Cover Number of Graphs. COCOON 2020: 27-39 - [c9]Jasine Babu, Deepu Benson, Deepak Rajendraprasad, Sai Nishant Vaka:
An Improvement to Chvátal and Thomassen's Upper Bound for Oriented Diameter. CSR 2020: 117-129 - [c8]Jasine Babu, Veena Prabhakaran, Arko Sharma:
A Substructure based Lower Bound for Eternal Vertex Cover Number. ICTCS 2020: 1-14 - [i13]Jasine Babu, Deepu Benson, Deepak Rajendraprasad, Sai Nishant Vaka:
An Improvement to Chvátal and Thomassen's Upper Bound for Oriented Diameter. CoRR abs/2001.03448 (2020) - [i12]Jasine Babu, Ajay Saju Jacob, R. Krithika, Deepak Rajendraprasad:
A Note on Arc-Disjoint Cycles in Bipartite Tournaments. CoRR abs/2002.06912 (2020) - [i11]Jasine Babu, Veena Prabhakaran, Arko Sharma:
A Linear Time Algorithm for Computing the Eternal Vertex Cover Number of Cactus Graphs. CoRR abs/2005.08058 (2020)
2010 – 2019
- 2019
- [j8]Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis:
On induced colourful paths in triangle-free graphs. Discret. Appl. Math. 255: 109-116 (2019) - [c7]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: 263-273 - [c6]Jasine Babu, Karunakaran Murali Krishnan, Vineeth Paleri:
A Fix-Point Characterization of Herbrand Equivalence of Expressions in Data Flow Frameworks. ICLA 2019: 160-172 - [i10]Sameera Muhamed Salam, Jasine Babu, K. Murali Krishnan:
A local characterization for perfect plane near-triangulations. CoRR abs/1906.06200 (2019) - [i9]Jasine Babu, Veena Prabhakaran:
A new lower bound for eternal vertex cover number. CoRR abs/1910.05042 (2019) - 2018
- [j7]Abhijin Adiga, Jasine Babu, L. Sunil Chandran:
Sublinear approximation algorithms for boxicity and related problems. Discret. Appl. Math. 236: 7-22 (2018) - [i8]Jasine Babu, L. Sunil Chandran, Mathew C. Francis, Veena Prabhakaran, Deepak Rajendraprasad, J. Nandini Warrier:
On Graphs with Minimal Eternal Vertex Cover Number. CoRR abs/1812.05125 (2018) - 2017
- [j6]Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis:
On Induced Colourful Paths in Triangle-free Graphs. Electron. Notes Discret. Math. 61: 69-75 (2017) - [i7]Jasine Babu, K. Murali Krishnan, Vineeth Paleri:
A fix-point characterization of Herbrand equivalence of expressions in data flow frameworks. CoRR abs/1708.04976 (2017) - 2016
- [c5]Jasine Babu, Areej Khoury, Ilan Newman:
Every Property of Outerplanar Graphs is Testable. APPROX-RANDOM 2016: 21:1-21:19 - 2015
- [j5]Jasine Babu, L. Sunil Chandran, Krishna Vaidyanathan:
Rainbow matchings in strongly edge-colored graphs. Discret. Math. 338(7): 1191-1196 (2015) - [j4]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: 110-126 (2015) - [i6]Abhijin Adiga, Jasine Babu, L. Sunil Chandran:
Sublinear Approximation Algorithms for Boxicity and Related Problems. CoRR abs/1505.04918 (2015) - 2014
- [j3]Abhijin Adiga, Jasine Babu, L. Sunil Chandran:
A constant factor approximation algorithm for boxicity of circular arc graphs. Discret. Appl. Math. 178: 1-18 (2014) - [j2]Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad:
2-Connecting outerplanar graphs without blowing up the pathwidth. Theor. Comput. Sci. 554: 119-134 (2014) - [j1]Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Fixed-orientation equilateral triangle matching of point sets. Theor. Comput. Sci. 555: 55-70 (2014) - [i5]Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Naveen Sivadasan:
Approximating the Cubicity of Trees. CoRR abs/1402.6310 (2014) - 2013
- [c4]Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad:
2-connecting Outerplanar Graphs without Blowing Up the Pathwidth. COCOON 2013: 626-637 - [c3]Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Fixed-Orientation Equilateral Triangle Matching of Point Sets. WALCOM 2013: 17-28 - 2012
- [c2]Abhijin Adiga, Jasine Babu, L. Sunil Chandran:
Polynomial Time and Parameterized Approximation Algorithms for Boxicity. IPEC 2012: 135-146 - [i4]Abhijin Adiga, Jasine Babu, L. Sunil Chandran:
Parameterized and Approximation Algorithms for Boxicity. CoRR abs/1201.5958 (2012) - [i3]Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Fixed-Orientation Equilateral Triangle Matching of Point Sets. CoRR abs/1211.2734 (2012) - [i2]Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad:
2-connecting Outerplanar Graphs without Blowing Up the Pathwidth. CoRR abs/1212.6382 (2012) - 2011
- [c1]Abhijin Adiga, Jasine Babu, L. Sunil Chandran:
A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs. WADS 2011: 13-24 - [i1]Abhijin Adiga, Jasine Babu, L. Sunil Chandran:
A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs. CoRR abs/1102.1544 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
