![]() | ![]() |
1996 | ||
---|---|---|
2 | K. S. Easwarakumar, S. V. Krishnan, C. Pandu Rangan, S. Seshadri: Optimal Parallel Algorithm for Finding st-Ambitus of a Planar Biconnected Graph. Algorithmica 15(3): 242-255 (1996) | |
1988 | ||
1 | S. V. Krishnan, C. Pandu Rangan, S. Seshadri: A New Linear Algorithm for the Two Path Problem on Chordal Graphs. FSTTCS 1988: 49-66 |
1 | K. S. Easwarakumar | [2] |
2 | C. Pandu Rangan (Chanrasekharan Pandu Rangan) | [1] [2] |
3 | S. Seshadri | [1] [2] |