AIDB Lab
Department of Computer Science & Engineering, IIT Madras, Chennai

Algorithm Theoretical Computer Science

Error message

Notice: Undefined offset: 1 in counter_get_browser() (line 70 of /opt/lampp/htdocs/aidb/sites/all/modules/counter/counter.lib.inc).
Year ▾ Authors ▾ Title ▾ Publication ▾ Links ▾
2014Anup Joshi,N. S. Narayanaswamy,Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments. SWAT 2014:357-367Bibtex
--------
Google Scholar
2014N. S. Narayanaswamy,G. Ramakrishna,On Minimum Average Stretch Spanning Trees in Polygonal 2-Trees. WALCOM 2014:310-321Bibtex
--------
Google Scholar
(2013)R. Krithika,Rogers Mathew,N. S. Narayanaswamy,N. Sadagopan,A Dirac-type characterization of Discrete Mathematics (DM) 313(24):2865-2867 (2013)Bibtex
--------
Google Scholar
2013N. S. Narayanaswamy,R. Subashini,FPT Algorithms for Consecutive Ones Submatrix Problems. IPEC 2013:295-307Bibtex
--------
Google Scholar
(2013)R. Krithika,N. S. Narayanaswamy,Another disjoint compression algorithm for odd cycle transversal. Inf. Process. Lett. (IPL) 113(22-24):849-851 (2013)Bibtex
--------
Google Scholar
(2013)N. S. Narayanaswamy,N. Sadagopan,A Unified Framework for Bi(Tri)Connectivity and Chordal Augmentation. Int. J. Found. Comput. Sci. (IJFCS) 24(1):67-94 (2013)Bibtex
--------
Google Scholar
(2013)R. Krithika,N. S. Narayanaswamy,Parameterized Algorithms for (r, l)-Partization. J. Graph Algorithms Appl. (JGAA) 17(2):129-146 (2013)Bibtex
--------
Google Scholar
(2013)Neeldhara Misra,N. S. Narayanaswamy,Venkatesh Raman,Bal Sri Shankar,Solving min ones 2-sat as fast as vertex cover. Theor. Comput. Sci. (TCS) 506:115-121 (2013)Bibtex
--------
Google Scholar
2013Kamiel Cornelissen,Ruben Hoeksma,Bodo Manthey,N. S. Narayanaswamy,C. S. Rahul,Approximability of Connected Factors. WAOA 2013:120-131Bibtex
--------
Google Scholar
2012N. S. Narayanaswamy,G. Ramakrishna,Characterization of Minimum Cycle Basis in Weighted Partial 2-trees. CTW 2012:193-196Bibtex
--------
Google Scholar
2012N. S. Narayanaswamy,Venkatesh Raman,M. S. Ramanujan,Saket Saurabh,LP can be a cure for Parameterized Problems. STACS 2012:338-349Bibtex
--------
Google Scholar
2012R. Krithika,N. S. Narayanaswamy,Generalized Above Guarantee Vertex Cover and r-Partization. WALCOM 2012:17-27Bibtex
--------
Google Scholar
2011N. S. Narayanaswamy,N. Sadagopan,A Novel Data Structure for Biconnectivity, Triconnectivity, and k-Tree Augmentation. CATS 2011:45-54Bibtex
--------
Google Scholar
(2011)N. S. Narayanaswamy,C. R. Subramanian,Dominating set based exact algorithms for 3-coloring. Inf. Process. Lett. (IPL) 111(6):251-255 (2011)Bibtex
--------
Google Scholar
(2011)S. Kanthi Kiran,N. S. Narayanaswamy,Hardness of subgraph and supergraph problems in c-tournaments. Theor. Comput. Sci. (TCS) 412(35):4629-4635 (2011)Bibtex
--------
Google Scholar
2011Esha Ghosh,N. S. Narayanaswamy,C. Pandu Rangan,A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs. WALCOM 2011:191-201Bibtex
--------
Google Scholar
2010Neeldhara Misra,N. S. Narayanaswamy,Venkatesh Raman,Bal Sri Shankar,Solving minones-2-sat as Fast as vertex cover. MFCS 2010:549-555Bibtex
--------
Google Scholar
(2009)L. Sunil Chandran,N. S. Narayanaswamy,On the Arrangement of Cliques in Chordal Graphs with respect to the Cuts. Ars Comb. (ARSCOM) 92 (2009)Bibtex
--------
Google Scholar
(2009)N. S. Narayanaswamy,R. Subashini,A new characterization of matrices with the consecutive ones property. Discrete Applied Mathematics (DAM) 157(18):3721-3727 (2009)Bibtex
--------
Google Scholar
(2009)Rakesh Mohanty,N. S. Narayanaswamy,Online Algorithms for Self-Organizing Sequential Search - A Survey. Electronic Colloquium on Computational Complexity (ECCC) (ECCC) 16:97 (2009)Bibtex
--------
Google Scholar
(2009)N. S. Narayanaswamy,N. Sadagopan,On the Structure of Contractible Vertex Pairs in Chordal Graphs. Electronic Notes in Discrete Mathematics (ENDM) 33:29-36 (2009)Bibtex
--------
Google Scholar
(2009)N. S. Narayanaswamy,N. Sadagopan,L. Sunil Chandran,On the Structure of Contractible Edges in Graphs and Combinatorics (GC) 25(4):557-569 (2009)Bibtex
--------
Google Scholar
(2008)N. S. Narayanaswamy,R. Subhash Babu,A Note on First-Fit Coloring of Interval Graphs. Order 25(1):49-53 (2008)Bibtex
--------
Google Scholar
(2007)N. S. Narayanaswamy,Naveen Belkale,L. Sunil Chandran,Naveen Sivadasan,A note on the Hadwiger number of circular arc graphs. Inf. Process. Lett. (IPL) 104(1):10-13 (2007)Bibtex
--------
Google Scholar
2006Zvi Lotker,Debapriyo Majumdar,N. S. Narayanaswamy,Ingmar Weber,Sequences Characterizing COCOON 2006:216-225Bibtex
--------
Google Scholar
(2006)Yossi Azar,Amos Fiat,Meital Levy,N. S. Narayanaswamy,An improved algorithm for online coloring of intervals with bandwidth. Theor. Comput. Sci. (TCS) 363(1):18-27 (2006)Bibtex
--------
Google Scholar
2004L. Sunil Chandran,N. S. Narayanaswamy,On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts. COCOON 2004:151-160Bibtex
--------
Google Scholar
2004N. S. Narayanaswamy,Dynamic Storage Allocation and On-Line Colouring Interval Graphs. COCOON 2004:329-338Bibtex
--------
Google Scholar
2004Ravi Gummadi,N. S. Narayanaswamy,Venkatakrishnan Ramaswamy,Algorithms for Satisfiability using Independent Sets of Variables. SAT 2004Bibtex
--------
Google Scholar
2004Ravi Gummadi,N. S. Narayanaswamy,Venkatakrishnan Ramaswamy,Algorithms for Satisfiability Using Independent Sets of Variables. SAT (Selected Papers 2004:133-144Bibtex
--------
Google Scholar
(2002)Rolf Backofen,N. S. Narayanaswamy,Firas Swidan,Protein similarity search under mRNA structural constraints: application to selenocysteine incorporation. In Silico Biology (ISB) 2(3):275-290 (2002)Bibtex
--------
Google Scholar
2002Jan Johannsen,N. S. Narayanaswamy,An Optimal Lower Bound for Resolution with 2-Conjunctions. MFCS 2002:387-398Bibtex
--------
Google Scholar
2002Rolf Backofen,N. S. Narayanaswamy,Firas Swidan,On the Complexity of Protein Similarity Search under mRNA Structure Constraints. STACS 2002:274-286Bibtex
--------
Google Scholar
2001N. S. Narayanaswamy,C. E. Veni Madhavan,On Assigning Prefix Free Codes to the Vertices of a Graph. COCOON 2001:328-337Bibtex
--------
Google Scholar
(2001)N. S. Narayanaswamy,C. E. Veni Madhavan,Lower Bounds for OBDDs and Nisan's pseudorandom generator Electronic Colloquium on Computational Complexity (ECCC) (ECCC) 8(20) (2001)Bibtex
--------
Google Scholar
2001Rolf Backofen,N. S. Narayanaswamy,Firas Swidan,Protein similarity search under mRNA structural constraints: application to selenocysteine incorporation. German Conference on Bioinformatics 2001:135-140Bibtex
--------
Google Scholar
1997K. Cirino,S. Muthukrishnan,N. S. Narayanaswamy,H. Ramesh,Graph Editing to Bipartite Interval Graphs: Exact and Asymtotic Bounds. FSTTCS 1997:37-53Bibtex
--------
Google Scholar