K. Murali Krishnan

21 papers B 2Misc 1Journal 16Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
Computing eternal vertex cover number of maximal outerplanar graphs in linear time.
Theor. Comput. Sci.
Jasine Babu, K. Murali Krishnan, Veena Prabhakaran, Nandini J. Warrier
2022 J jnl
Eternal vertex cover number of maximal outerplanar graphs.
CoRR
Jasine Babu, K. Murali Krishnan, Veena Prabhakaran, J. Nandini Warrier
2022 J jnl
On chordal and perfect plane near-triangulations.
Discret. Appl. Math.
Sameera Muhamed Salam, J. Nandini Warrier, Daphna Chacko, K. Murali Krishnan, K. S. Sudeep
2021 J jnl
On the computational complexity of Data Flow Analysis over finite bounded meet semilattices.
Theor. Comput. Sci.
Gaurav Sood, K. Murali Krishnan
2020 J jnl
A local characterization for perfect plane near-triangulations.
Theor. Comput. Sci.
Sameera Muhamed Salam, Jasine Babu, K. Murali Krishnan
2020 J jnl
eXpOS: A Simple Pedagogical Operating System for Undergraduate Instruction.
CoRR
K. Murali Krishnan
2019 J jnl
A local characterization for perfect plane near-triangulations.
CoRR
Sameera Muhamed Salam, Jasine Babu, K. Murali Krishnan
2019 — conf
On Chordal and Perfect Plane Triangulations.
CALDAM
Sameera Muhamed Salam, Daphna Chacko, J. Nandini Warrier, K. Murali Krishnan, K. S. Sudeep
2018 J jnl
Efficient query retrieval in Neo4jHA using metaheuristic social data allocation scheme.
Comput. Electr. Eng.
Anita Brigit Mathew, S. D. Madhu Kumar, K. Murali Krishnan, Sameera Muhamed Salam
2017 J jnl
A fix-point characterization of Herbrand equivalence of expressions in data flow frameworks.
CoRR
Jasine Babu, K. Murali Krishnan, Vineeth Paleri
2013 J jnl
On the computational complexity of Data Flow Analysis
CoRR
Gaurav Sood, K. Murali Krishnan
2011 J jnl
On the Complexity of Edge Packing and Vertex Packing
CoRR
Sameera Muhamed Salam, K. N. Parvathy, K. S. Sudeep, K. Murali Krishnan
2009 J jnl
Extending Karger's randomized min-cut Algorithm for a Synchronous Distributed setting
CoRR
S. Shine, K. Murali Krishnan
2008 J jnl
Lower Bound for the Communication Complexity of the Russian Cards Problem
CoRR
Aiswarya Cyriac, K. Murali Krishnan
2007 B conf
A Combinatorial Family of Near Regular LDPC Codes.
ISIT
K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran, Priti Shankar
2006 J jnl
A Combinatorial Family of Near Regular LDPC Codes
CoRR
K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran, Priti Shankar
2006 J jnl
Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds
CoRR
K. Murali Krishnan, Priti Shankar
2006 B conf
Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds.
ISIT
K. Murali Krishnan, Priti Shankar
2006 — conf
Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs.
FSTTCS
K. Murali Krishnan, L. Sunil Chandran
2006 Misc conf
On the Complexity of finding stopping set size in Tanner Graphs.
CISS
K. Murali Krishnan, Priti Shankar
2005 J jnl
On the Complexity of finding Stopping Distance in Tanner Graphs
CoRR
K. Murali Krishnan, Priti Shankar