Skip to main content

3 Result(s)

within Chapter Remove this filter Jasine Babu Remove this filter Computer Science Remove this filter Computer Graphics Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    On Graphs with Minimal Eternal Vertex Cover Number

    The eternal vertex cover problem is a variant of the classical vertex cover problem where a set of guards on the vertices have to be dynamically reconfigured from one vertex cover to another in every round of ...

    Jasine Babu, L. Sunil Chandran… in Algorithms and Discrete Applied Mathematics (2019)

  2. No Access

    Chapter and Conference Paper

    Fixed-Orientation Equilateral Triangle Matching of Point Sets

    Given a point set P and a class \(\mathcal{C}\) of geometric objects,

    Jasine Babu, Ahmad Biniaz, Anil Maheshwari… in WALCOM: Algorithms and Computation (2013)

  3. No Access

    Chapter and Conference Paper

    A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs

    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 boxes in R k . Equivalentl...

    Abhi** Adiga, Jasine Babu, L. Sunil Chandran in Algorithms and Data Structures (2011)