![]() |
| 2003 | ||
|---|---|---|
| 7 | Gur Saran Adhar: Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks. Applied Informatics 2003: 692-696 | |
| 2001 | ||
| 6 | Gur Saran Adhar: Optimal Parallel Algorithms for Cut Vertices, Bridges, and Hamiltonian Path in Bounded Interval Tolerance Graphs. ICPADS 2001: 91-98 | |
| 1994 | ||
| 5 | Gur Saran Adhar, Shietung Peng: Parallel Algorithms for K-tree Recognition and its Applications. HICSS (2) 1994: 194-202 | |
| 1991 | ||
| 4 | Gur Saran Adhar, Shietung Peng: Parallel algorithms for finding connected, independent and total domination in interval graphs. Algorithms and Parallel VLSI Architectures 1991: 85-90 | |
| 1990 | ||
| 3 | Gur Saran Adhar, Shietung Peng: Parallel Algorithms for Path Covering, Hamiltonian Path and Hamiltonian Cycle in Cographs. ICPP (3) 1990: 364-365 | |
| 2 | Gur Saran Adhar, Shietung Peng: Parallel Algorithms for Cographs and Parity Graphs with Applications. J. Algorithms 11(2): 252-284 (1990) | |
| 1989 | ||
| 1 | Gur Saran Adhar, Shietung Peng: Parallel Algorithms for Cographs Recognition and Applications. WADS 1989: 335-351 | |
| 1 | Shietung Peng | [1] [2] [3] [4] [5] |