Jasine Babu

According to our database1, Jasine Babu authored at least 28 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Packing arc-disjoint cycles in oriented graphs.
J. Comput. Syst. Sci., 2024

Arborescences and Shortest Path Trees when Colors Matter.
CoRR, 2024

2023
Improved bounds for the oriented radius of mixed multigraphs.
J. Graph Theory, August, 2023

2022
A new lower bound for the eternal vertex cover number of graphs.
J. Comb. Optim., 2022

On graphs whose eternal vertex cover number and vertex cover number coincide.
Discret. Appl. Math., 2022

Eternal vertex cover number of maximal outerplanar graphs.
CoRR, 2022

Computing Eternal Vertex Cover Number on Maximal Outerplanar Graphs in Linear Time.
Proceedings of the 23rd Italian Conference on Theoretical Computer Science, 2022

Packing Arc-Disjoint 4-Cycles in Oriented Graphs.
Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

Eternal Vertex Cover on Bipartite Graphs.
Proceedings of the Computer Science - Theory and Applications, 2022

2021
A substructure based lower bound for eternal vertex cover number.
Theor. Comput. Sci., 2021

An improvement to Chvátal and Thomassen's upper bound for oriented diameter.
Discret. Appl. Math., 2021

2020
A local characterization for perfect plane near-triangulations.
Theor. Comput. Sci., 2020

A Linear Time Algorithm for Computing the Eternal Vertex Cover Number of Cactus Graphs.
CoRR, 2020

A Note on Arc-Disjoint Cycles in Bipartite Tournaments.
CoRR, 2020

2019
On induced colourful paths in triangle-free graphs.
Discret. Appl. Math., 2019

A new lower bound for eternal vertex cover number.
CoRR, 2019

A Fix-Point Characterization of Herbrand Equivalence of Expressions in Data Flow Frameworks.
Proceedings of the Logic and Its Applications - 8th Indian Conference, 2019

On Graphs with Minimal Eternal Vertex Cover Number.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018
Sublinear approximation algorithms for boxicity and related problems.
Discret. Appl. Math., 2018

2016
Every Property of Outerplanar Graphs is Testable.
Proceedings of the Approximation, 2016

2015
Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs.
Eur. J. Comb., 2015

Rainbow matchings in strongly edge-colored graphs.
Discret. Math., 2015

2014
Fixed-orientation equilateral triangle matching of point sets.
Theor. Comput. Sci., 2014

2-Connecting outerplanar graphs without blowing up the pathwidth.
Theor. Comput. Sci., 2014

A constant factor approximation algorithm for boxicity of circular arc graphs.
Discret. Appl. Math., 2014

Approximating the Cubicity of Trees.
CoRR, 2014

2012
Parameterized and Approximation Algorithms for Boxicity
CoRR, 2012

Polynomial Time and Parameterized Approximation Algorithms for Boxicity.
Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012


  Loading...