ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Browse by Author

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 5.

Book Chapter

Narayanaswamy, NS and Madhavan, Veni CE (2001) On Assigning Prefix Free Codes to the Vertices of a Graph. [Book Chapter]

Conference Paper

Chandran, L Sunil and Narayanaswamy, NS (2009) On the Arrangement of Cliques in Chordal Graphs with respect to the Cuts. In: 10th International Computing and Combinatorics Conference, AUG 17-20, 2004, Cheju Isl, SOUTH KOREA, pp. 11-19.

Journal Article

Misra, Neeldhara and Narayanaswamy, NS and Raman, Venkatesh and Shankar, Bal Sri (2013) Solving MIN ONES 2-SAT as fast as VERTEX COVER. In: THEORETICAL COMPUTER SCIENCE, 506 . pp. 115-121.

Narayanaswamy, NS and Sadagopan, N and Chandran, L. Sunil (2009) On the Structure of Contractible Edges in k-connected Partial k-trees. In: Graphs and Combinatorics, 25 (4). pp. 557-569.

Narayanaswamy, NS and Belkale, N and Chandran, LS and Sivadasan, N (2007) A note on the Hadwiger number of circular arc graphs. In: Information Processing Letters, 104 (1). pp. 10-13.

This list was generated on Tue Oct 21 16:33:29 2014 IST.