N.S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
Appeared in
29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France (STACS 2012),
LIPIcs, Vol 14, pp.338-349, Feb 2012.
Planning for the Convoy Movement Problem.
Anand Kumar, I. Murugeswari, Deepak Khemani, N.S. Narayanaswamy
Appeared in
ICAART 2012 - Proceedings of the 4th International Conference on Agents and Artificial Intelligence, Volume 1 - Artificial Intelligence, Vilamoura, Algarve, Portugal, 6-8 February, 2012 (ICAART 2012),
pp.495-498, Feb 2012.
A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs.
Esha Ghosh, N.S. Narayanaswamy, C. Pandu Rangan
Appeared in
WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings (WALCOM 2011),
Lecture Notes in Computer Science, Vol 6552, pp.191-201, Feb 2011.
A Novel Data Structure for Biconnectivity, Triconnectivity, and k-Tree Augmentation.
N.S. Narayanaswamy, N. Sadagopan
Appeared in
Seventeenth Computing: The Australasian Theory Symposium, CATS 2011, Perth, Australia, January 2011 (CATS 2011),
CRPIT, Vol 119, pp.45-54, Jan 2011.
Hardness of subgraph and supergraph problems in c-tournaments.
Neeldhara Misra, N.S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar
Appeared in
Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings (MFCS 2010),
Lecture Notes in Computer Science, Vol 6281, pp.549-555, Aug 2010.
TRANS: Schema-Aware Mapping of OWL Ontologies into Relational Databases.
Saurabh Kejriwal, N.S. Narayanaswamy
Appeared in
Proceedings of the 15th International Conference on Management of Data, December 9-12, 2009, International School of Information Management, Mysore, India,
Dec 2009.
Tuning Search Heuristics for Classical Planning with Macro Actions.
I. Murugeswari, N.S. Narayanaswamy
Appeared in
Proceedings of the Twenty-Second International Florida Artificial Intelligence Research Society Conference, May 19-21, 2009, Sanibel Island, Florida, USA,
May 2009.
Online Algorithms for Self-Organizing Sequential Search - A Survey.
On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts.
L. Sunil Chandran, N.S. Narayanaswamy
Appeared in
Computing and Combinatorics, 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings (COCOON 2004),
Lecture Notes in Computer Science, Vol 3106, pp.151-160, Aug 2004.
Dynamic Storage Allocation and On-Line Colouring Interval Graphs.
N.S. Narayanaswamy
Appeared in
Computing and Combinatorics, 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings (COCOON 2004),
Lecture Notes in Computer Science, Vol 3106, pp.329-338, Aug 2004.
Algorithms for Satisfiability Using Independent Sets of Variables.
Ravi Gummadi, N.S. Narayanaswamy, Venkatakrishnan Ramaswamy
Appeared in
Theory and Applications of Satisfiability Testing, 7th International Conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised Selected Papers (SAT 2004),
Lecture Notes in Computer Science, Vol 3542, pp.133-144, May 2004.
Algorithms for Satisfiability using Independent Sets of Variables.
Ravi Gummadi, N.S. Narayanaswamy, Venkatakrishnan Ramaswamy
Appeared in
SAT 2004 - The Seventh International Conference on Theory and Applications of Satisfiability Testing, 10-13 May 2004, Vancouver, BC, Canada, Online Proceedings (SAT 2004),
May 2004.
An Optimal Lower Bound for Resolution with 2-Conjunctions.
Jan Johannsen, N.S. Narayanaswamy
Appeared in
Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings (MFCS 2002),
Lecture Notes in Computer Science, Vol 2420, pp.387-398, Aug 2002.
On the Complexity of Protein Similarity Search under mRNA Structure Constraints.
Rolf Backofen, N.S. Narayanaswamy, Firas Swidan
Appeared in
STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings (STACS 2002),
Lecture Notes in Computer Science, Vol 2285, pp.274-286, Mar 2002.
Protein similarity search under mRNA structural constraints: application to selenocysteine incorporation.
Type :
Member :
Area :
Lab:
