Jasine Babu

According to our database1, Jasine Babu authored at least 30 papers between 2011 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
A Correct by Construction Fault Tolerant Voter for Input Selection of a Control System.
CoRR, September, 2025

Color-Constrained Arborescences in Edge-Colored Digraphs.
CoRR, March, 2025

Arborescences and shortest path trees when colors matter.
Theor. Comput. Sci., 2025

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

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

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

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

A Substructure based Lower Bound for Eternal Vertex Cover Number.
Proceedings of the 21st Italian Conference on Theoretical Computer Science, 2020

An Improvement to Chvátal and Thomassen's Upper Bound for Oriented Diameter.
Proceedings of the Computer Science - Theory and Applications, 2020

A New Lower Bound for the Eternal Vertex Cover Number of Graphs.
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

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

2017
On Induced Colourful Paths in Triangle-free Graphs.
Electron. Notes Discret. Math., 2017

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
Approximating the Cubicity of Trees.
CoRR, 2014

2013
Fixed-Orientation Equilateral Triangle Matching of Point Sets.
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

2-connecting Outerplanar Graphs without Blowing Up the Pathwidth.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

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

2011
A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011


  Loading...