 | 2009 |
|---|
| 19 |       | I. Murugeswari,
N. S. Narayanaswamy:
Tuning Search Heuristics for Classical Planning with Macro Actions.
FLAIRS Conference 2009 |
| 18 |  | N. S. Narayanaswamy,
N. Sadagopan,
Apoorve Dubey:
A Note on Contractible Edges in Chordal Graphs
CoRR abs/0902.1364: (2009) |
| 17 | | Rakesh Mohanty,
N. S. Narayanaswamy:
Online Algorithms for Self-Organizing Sequential Search - A Survey
CoRR abs/0909.0095: (2009) |
| 16 | | N. S. Narayanaswamy,
N. Sadagopan:
On the Structure of Contractible Vertex Pairs in Chordal Graphs.
Electronic Notes in Discrete Mathematics 33: 29-36 (2009) |
| 2008 |
|---|
| 15 | | N. S. Narayanaswamy,
R. Subhash Babu:
A Note on First-Fit Coloring of Interval Graphs.
Order 25(1): 49-53 (2008) |
| 2007 |
|---|
| 14 | | N. S. Narayanaswamy,
N. Belkale,
L. Sunil Chandran,
Naveen Sivadasan:
A note on the Hadwiger number of circular arc graphs.
Inf. Process. Lett. 104(1): 10-13 (2007) |
| 2006 |
|---|
| 13 | | Zvi Lotker,
Debapriyo Majumdar,
N. S. Narayanaswamy,
Ingmar Weber:
Sequences Characterizing k-Trees.
COCOON 2006: 216-225 |
| 12 | | Yossi Azar,
Amos Fiat,
Meital Levy,
N. S. Narayanaswamy:
An improved algorithm for online coloring of intervals with bandwidth.
Theor. Comput. Sci. 363(1): 18-27 (2006) |
| 2004 |
|---|
| 11 | | L. Sunil Chandran,
N. S. Narayanaswamy:
On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts.
COCOON 2004: 151-160 |
| 10 | | N. S. Narayanaswamy:
Dynamic Storage Allocation and On-Line Colouring Interval Graphs.
COCOON 2004: 329-338 |
| 9 | | Ravi Gummadi,
N. S. Narayanaswamy,
Venkatakrishnan Ramaswamy:
Algorithms for Satisfiability using Independent Sets of Variables.
SAT 2004 |
| 8 | | Ravi Gummadi,
N. S. Narayanaswamy,
Venkatakrishnan Ramaswamy:
Algorithms for Satisfiability Using Independent Sets of Variables.
SAT (Selected Papers 2004: 133-144 |
| 2002 |
|---|
| 7 | | Jan Johannsen,
N. S. Narayanaswamy:
An Optimal Lower Bound for Resolution with 2-Conjunctions.
MFCS 2002: 387-398 |
| 6 | | Rolf Backofen,
N. S. Narayanaswamy,
Firas Swidan:
On the Complexity of Protein Similarity Search under mRNA Structure Constraints.
STACS 2002: 274-286 |
| 5 | | Rolf Backofen,
N. S. Narayanaswamy,
Firas Swidan:
Protein similarity search under mRNA structural constraints: application to selenocysteine incorporation.
In Silico Biology 2: 26 (2002) |
| 2001 |
|---|
| 4 | | N. S. Narayanaswamy,
C. E. Veni Madhavan:
On Assigning Prefix Free Codes to the Vertices of a Graph.
COCOON 2001: 328-337 |
| 3 | | Rolf Backofen,
N. S. Narayanaswamy,
Firas Swidan:
Protein similarity search under mRNA structural constraints: application to selenocysteine incorporation.
German Conference on Bioinformatics 2001: 135-140 |
| 2 | | N. S. Narayanaswamy,
C. E. Veni Madhavan:
Lower Bounds for OBDDs and Nisan's pseudorandom generator
Electronic Colloquium on Computational Complexity (ECCC) 8(20): (2001) |
| 1997 |
|---|
| 1 | | K. Cirino,
S. Muthukrishnan,
N. S. Narayanaswamy,
H. Ramesh:
Graph Editing to Bipartite Interval Graphs: Exact and Asymtotic Bounds.
FSTTCS 1997: 37-53 |
