dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

N. Chandrasekharan Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys1996
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLN. 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
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLR. Sridhar, N. Chandrasekharan: Highly Parallelizable Problems on Sorted Intervals. Parallel Computing 21(3): 433-446 (1995)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLR. 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
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLN. 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
8no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSridhar Hannenhalli, Kalyan S. Perumalla, N. Chandrasekharan, R. Sridhar: A Distributed Algorithm for Ear Decomposition. ICCI 1993: 180-184
7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDipti 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
6no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmit Jain, N. Chandrasekharan: An Efficient Parallel Algorithm for Min-Cost Flow on Directed Series-Parallel Networks. IPPS 1993: 188-192
5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLN. Chandrasekharan, Laks V. S. Lakshmanan, Muralidhar Medidi: Efficient Parallel Algorithms for Finding Chordless Cycles in Graphs. Parallel Processing Letters 3: 165-170 (1993)
1992
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLN. Chandrasekharan, Sridhar Hannenhalli: Efficient Algorithms for Computing Matching and Chromatic Polynominals on Series-Parallel Graphs. ICCI 1992: 42-45
1990
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLN. Chandrasekharan: Isomorphism Testing of k-Trees is in NC, for Fixed k. Inf. Process. Lett. 34(6): 283-287 (1990)
1988
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLN. Chandrasekharan, S. Sitharama Iyengar: NC Algorithms for Recognizing Chordal Graphs and k Trees. IEEE Trans. Computers 37(10): 1178-1183 (1988)
1984
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLV. S. Lakshmanan, N. Chandrasekharan, C. E. Veni Madhavan: Recognition and Top-Down Generation of beta-Acyclic Database Schemes. FSTTCS 1984: 344-366

Coauthor Index

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

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page