3 citations · 10 across the 17 of their papers we have counts for
20 papers
Eternal Vertex Cover Problem on Halin Graphs
Jasine Babu, Pratik Ghosal, Cipriyano Simoes
Eternal vertex cover problem is a graph protection problem which is a dynamic two player game variant of the classical vertex cover problem. In this game, the minimum number of gua…
A Correct by Construction Fault Tolerant Voter for Input Selection of a Control System
Arif Ali AP, Jasine Babu, Deepa Sara John
Safety-critical systems use redundant input units to improve their reliability and fault tolerance. A voting logic is then used to select a reliable input from the redundant source…
Color-Constrained Arborescences in Edge-Colored Digraphs
P. S. Ardra, Jasine Babu, R. Krithika +1
Given a multigraph whose edges are colored from the set (\emph{-colored graph}), and a vector (\emph{color-…
Arborescences and Shortest Path Trees when Colors Matter
P. S. Ardra, Jasine Babu, Kritika Kashyap +3
Color-constrained subgraph problems are those where we are given an edge-colored (directed or undirected) graph and the task is to find a specific type of subgraph, like a spanning…
Eternal vertex cover number of maximal outerplanar graphs
Jasine Babu, K. Murali Krishnan, Veena Prabhakaran +1
Eternal vertex cover problem is a variant of the classical vertex cover problem modeled as a two player attacker-defender game. Computing eternal vertex cover number of graphs is k…
Improved Bounds for the Oriented Radius of Mixed Multigraphs
Jasine Babu, Deepu Benson, Deepak Rajendraprasad
A mixed multigraph is a multigraph which may contain both undirected and directed edges. An orientation of a mixed multigraph is an assignment of exactly one direction to each…