Recognition and Top-Down Generation of beta-Acyclic Database Schemes. - V. S. Lakshmanan 001; N. Chandrasekharan; C. E. Veni Madhavan (FSTTCS, 1984)

On the minimum vocabulary problem. - N. Chandrasekharan; R. Sridhar 001; S. S. Iyengar 001 (J. Am. Soc. Inf. Sci., 1987)

NC Algorithms for Recognizing Chordal Graphs and k Trees. - N. Chandrasekharan; S. Sitharama Iyengar (IEEE Trans. Computers, 1988)

Isomorphism Testing of k-Trees is in NC, for Fixed k. - N. Chandrasekharan (Inf. Process. Lett., 1990)

Efficient Algorithms for Computing Matching and Chromatic Polynominals on Series-Parallel Graphs. - N. Chandrasekharan; Sridhar Hannenhalli (ICCI, 1992)

A Distributed Algorithm for Ear Decomposition. - Sridhar Hannenhalli; Kalyan S. Perumalla; N. Chandrasekharan; R. Sridhar 001 (ICCI, 1993)

Efficient Algorithms for All-Pairs Shortest Path Problem on Interval, Directed Path, and Circular-Arc Graphs. - Dipti S. Joshi; R. Sridhar 001; N. Chandrasekharan (ICCI, 1993)

An Efficient Parallel Algorithm for Min-Cost Flow on Directed Series-Parallel Networks. - Amit Jain; N. Chandrasekharan (IPPS, 1993)

Efficient Parallel Algorithms for Finding Chordless Cycles in Graphs. - N. Chandrasekharan; Laks V. S. Lakshmanan; Muralidhar Medidi (Parallel Process. Lett., 1993)

Highly Parallelizable Problems on Sorted Intervals. - R. Sridhar 001; N. Chandrasekharan (Parallel Comput., 1995)

Efficient Algorithms for Shortest Distance Queries on Special Classes of Polygons. - R. Sridhar 001; K. Han; N. Chandrasekharan (Theor. Comput. Sci., 1995)

MasPaWS - A Massively Parallel War Simulator. - N. Chandrasekharan; Zhi-Hai Ma; Udaya Bhaskar Vemulapati; William J. Porthouse Jr.; Allen T. Irwin (Simul. Pract. Theory, 1996)