N. Chandrasekharan

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	1996
j7		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
j6		R. Sridhar, N. Chandrasekharan: Highly Parallelizable Problems on Sorted Intervals. Parallel Computing 21(3): 433-446 (1995)
j5		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
c6		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
j4		N. Chandrasekharan, Laks V. S. Lakshmanan, Muralidhar Medidi: Efficient Parallel Algorithms for Finding Chordless Cycles in Graphs. Parallel Processing Letters 3: 165-170 (1993)
c5		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
c4		Sridhar Hannenhalli, Kalyan S. Perumalla, N. Chandrasekharan, R. Sridhar: A Distributed Algorithm for Ear Decomposition. ICCI 1993: 180-184
c3		Amit Jain, N. Chandrasekharan: An Efficient Parallel Algorithm for Min-Cost Flow on Directed Series-Parallel Networks. IPPS 1993: 188-192
	1992
c2		N. Chandrasekharan, Sridhar Hannenhalli: Efficient Algorithms for Computing Matching and Chromatic Polynominals on Series-Parallel Graphs. ICCI 1992: 42-45
	1990
j3		N. Chandrasekharan: Isomorphism Testing of k-Trees is in NC, for Fixed k. Inf. Process. Lett. 34(6): 283-287 (1990)
	1988
j2		N. Chandrasekharan, S. Sitharama Iyengar: NC Algorithms for Recognizing Chordal Graphs and k Trees. IEEE Trans. Computers 37(10): 1178-1183 (1988)
	1987
j1		N. Chandrasekharan, R. Sridhar, S. S. Iyengar: On the minimum vocabulary problem. JASIS 38(4): 234-238 (1987)
	1984
c1		V. S. Lakshmanan, N. Chandrasekharan, C. E. Veni Madhavan: Recognition and Top-Down Generation of beta-Acyclic Database Schemes. FSTTCS 1984: 344-366

Coauthor Index

1	K. Han	[j5]
2	Sridhar Hannenhalli	[c4] [c2]
3	Allen T. Irwin	[j7] [c6]
4	S. Sitharama Iyengar (S. S. Iyengar)	[j2] [j1]
5	Amit Jain	[c3]
6	Dipti S. Joshi	[c5]
7	Laks V. S. Lakshmanan (V. S. Lakshmanan)	[j4] [c1]
8	Zhi-Hai Ma	[j7] [c6]
9	C. E. Veni Madhavan	[c1]
10	Muralidhar Medidi	[j4]
11	Kalyan S. Perumalla	[c4]
12	William J. Porthouse Jr.	[j7] [c6]
13	R. Sridhar	[j6] [j5] [c5] [c4] [j1]
14	Udaya Bhaskar Vemulapati	[j7] [c6]

Colors in the list of coauthors

Last update Sun May 19 07:35:48 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page