9 citations · 17 across the 9 of their papers we have counts for
11 papers
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…
eXpOS: A Simple Pedagogical Operating System for Undergraduate Instruction
K. Murali Krishnan
An operating system project suitable for undergraduate computing/electrical sciences students is presented. The project can be used as a course project in a one semester course, or…
A local characterization for perfect plane near-triangulations
Sameera M. Salam, Jasine Babu, K. Murali Krishnan
We derive a local criterion for a plane near-triangulated graph to be perfect. It is shown that a plane near-triangulated graph is perfect if and only if it does not contain either…
A fix-point characterization of Herbrand equivalence of expressions in data flow frameworks
Jasine Babu, K. Murali Krishnan, Vineeth Paleri
The problem of determining Herbrand equivalence of terms at each program point in a data flow framework is a central and well studied question in program analysis. Most of the well…
On chordal and perfect plane near-triangulations
Sameera M Salam, Daphna Chacko, Nandini J Warrier +2
A plane near-triangulation G can be decomposed into a collection of induced subgraphs, described here as the W-components of G, such that G is perfect (respectively, chordal) if an…
On the computational complexity of Data Flow Analysis
Gaurav Sood, K. Murali Krishnan
We consider the problem of Data Flow Analysis over monotone data flow frameworks with a finite lattice. The problem of computing the Maximum Fixed Point (MFP) solution is shown to…