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