Search the dblp DataBase

Publications of Author

1. L. Sunil Chandran, N. S. Narayanaswamy
   On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts. [Citation Graph (0, 0)][DBLP]
   COCOON, 2004, pp:151-160 [Conf]
   
2. Zvi Lotker, Debapriyo Majumdar, N. S. Narayanaswamy, Ingmar Weber
   Sequences Characterizing k-Trees. [Citation Graph (0, 0)][DBLP]
   COCOON, 2006, pp:216-225 [Conf]
   
3. N. S. Narayanaswamy
   Dynamic Storage Allocation and On-Line Colouring Interval Graphs. [Citation Graph (0, 0)][DBLP]
   COCOON, 2004, pp:329-338 [Conf]
   
4. N. S. Narayanaswamy, C. E. Veni Madhavan
   On Assigning Prefix Free Codes to the Vertices of a Graph. [Citation Graph (0, 0)][DBLP]
   COCOON, 2001, pp:328-337 [Conf]
   
5. K. Cirino, S. Muthukrishnan, N. S. Narayanaswamy, H. Ramesh
   Graph Editing to Bipartite Interval Graphs: Exact and Asymtotic Bounds. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 1997, pp:37-53 [Conf]
   
6. Rolf Backofen, N. S. Narayanaswamy, Firas Swidan
   Protein similarity search under mRNA structural constraints: application to selenocysteine incorporation. [Citation Graph (0, 0)][DBLP]
   German Conference on Bioinformatics, 2001, pp:135-140 [Conf]
   
7. Jan Johannsen, N. S. Narayanaswamy
   An Optimal Lower Bound for Resolution with 2-Conjunctions. [Citation Graph (0, 0)][DBLP]
   MFCS, 2002, pp:387-398 [Conf]
   
8. Ravi Gummadi, N. S. Narayanaswamy, Venkatakrishnan Ramaswamy
   Algorithms for Satisfiability using Independent Sets of Variables. [Citation Graph (0, 0)][DBLP]
   SAT, 2004, pp:- [Conf]
   
9. Ravi Gummadi, N. S. Narayanaswamy, Venkatakrishnan Ramaswamy
   Algorithms for Satisfiability Using Independent Sets of Variables. [Citation Graph (0, 0)][DBLP]
   SAT (Selected Papers, 2004, pp:133-144 [Conf]
   
10. Rolf Backofen, N. S. Narayanaswamy, Firas Swidan
    On the Complexity of Protein Similarity Search under mRNA Structure Constraints. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:274-286 [Conf]
    
11. N. S. Narayanaswamy, C. E. Veni Madhavan
    Lower Bounds for OBDDs and Nisan's pseudorandom generator [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:20, pp:- [Journal]
    
12. Rolf Backofen, N. S. Narayanaswamy, Firas Swidan
    Protein similarity search under mRNA structural constraints: application to selenocysteine incorporation. [Citation Graph (0, 0)][DBLP]
    In Silico Biology, 2002, v:2, n:, pp:26- [Journal]
    
13. Yossi Azar, Amos Fiat, Meital Levy, N. S. Narayanaswamy
    An improved algorithm for online coloring of intervals with bandwidth. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:363, n:1, pp:18-27 [Journal]
    
14. N. S. Narayanaswamy, N. Belkale, L. Sunil Chandran, Naveen Sivadasan
    A note on the Hadwiger number of circular arc graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:104, n:1, pp:10-13 [Journal]
    
15. 
    TRANS: Schema-Aware Mapping of OWL Ontologies into Relational Databases. [Citation Graph (, )][DBLP]
    
    
16. 
    Tuning Search Heuristics for Classical Planning with Macro Actions. [Citation Graph (, )][DBLP]
    
    
17. 
    Solving minones-2-sat as Fast as vertex cover. [Citation Graph (, )][DBLP]
    
    
18. 
    A Note on Contractible Edges in Chordal Graphs [Citation Graph (, )][DBLP]
    
    
19. 
    Online Algorithms for Self-Organizing Sequential Search - A Survey [Citation Graph (, )][DBLP]
    
    
20. 
    A new characterization of matrices with the consecutive ones property. [Citation Graph (, )][DBLP]