Jasine Babu

activity

20112025

most citedA Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs

3 citations · 5 across the 8 of their papers we have counts for

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2025

Color-Constrained Arborescences in Edge-Colored Digraphs

P. S. Ardra, Jasine Babu, R. Krithika +1

Given a multigraph $G$ whose edges are colored from the set $[q] := {1, 2, \dots, q}$ (\emph{ $q$ -colored graph}), and a vector $α = (α_{1}, \dots, α_{q}) \in N^{q}$ (\emph{color-…

cs.DS2020

A Note on Arc-Disjoint Cycles in Bipartite Tournaments

Jasine Babu, Ajay Saju Jacob, R. Krithika +1

We show that for each non-negative integer k, every bipartite tournament either contains k arc-disjoint cycles or has a feedback arc set of size at most 7(k - 1).

cs.DS2011★ 3 cited

A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs

Abhijin Adiga, Jasine Babu, L. Sunil Chandran

Boxicity of a graph $G (V, E)$ is the minimum integer $k$ such that $G$ can be represented as the intersection graph of $k$ -dimensional axis parallel rectangles in $R^{k}$ . Eq…