| 1996 |
|---|
| 11 | EE | N. Chandrasekharan,
Zhi-Hai Ma,
Udaya Bhaskar Vemulapati,
William J. Porthouse Jr.,
Allen T. Irwin:
MasPaWS - A Massively Parallel War Simulator.
Simul. Pr. Theory 4(4): 265-282 (1996) |
| 1995 |
|---|
| 10 | | R. Sridhar,
N. Chandrasekharan:
Highly Parallelizable Problems on Sorted Intervals.
Parallel Computing 21(3): 433-446 (1995) |
| 9 | EE | R. Sridhar,
K. Han,
N. Chandrasekharan:
Efficient Algorithms for Shortest Distance Queries on Special Classes of Polygons.
Theor. Comput. Sci. 140(2): 291-300 (1995) |
| 1994 |
|---|
| 8 | EE | N. Chandrasekharan,
Udaya Bhaskar Vemulapati,
Allen T. Irwin,
Zhi-Hai Ma,
William J. Porthouse Jr.:
MasPaWS - a massively parallel war simulator.
Winter Simulation Conference 1994: 744-751 |
| 1993 |
|---|
| 7 | | Sridhar Hannenhalli,
Kalyan S. Perumalla,
N. Chandrasekharan,
R. Sridhar:
A Distributed Algorithm for Ear Decomposition.
ICCI 1993: 180-184 |
| 6 | | Dipti S. Joshi,
R. Sridhar,
N. Chandrasekharan:
Efficient Algorithms for All-Pairs Shortest Path Problem on Interval, Directed Path, and Circular-Arc Graphs.
ICCI 1993: 31-35 |
| 5 | | Amit Jain,
N. Chandrasekharan:
An Efficient Parallel Algorithm for Min-Cost Flow on Directed Series-Parallel Networks.
IPPS 1993: 188-192 |
| 4 | | N. Chandrasekharan,
Laks V. S. Lakshmanan,
Muralidhar Medidi:
Efficient Parallel Algorithms for Finding Chordless Cycles in Graphs.
Parallel Processing Letters 3: 165-170 (1993) |
| 1992 |
|---|
| 3 | | N. Chandrasekharan,
Sridhar Hannenhalli:
Efficient Algorithms for Computing Matching and Chromatic Polynominals on Series-Parallel Graphs.
ICCI 1992: 42-45 |
| 1990 |
|---|
| 2 | | N. Chandrasekharan:
Isomorphism Testing of k-Trees is in NC, for Fixed k.
Inf. Process. Lett. 34(6): 283-287 (1990) |
| 1988 |
|---|
| 1 | | N. Chandrasekharan,
S. Sitharama Iyengar:
NC Algorithms for Recognizing Chordal Graphs and k Trees.
IEEE Trans. Computers 37(10): 1178-1183 (1988) |
