Parallel Algorithms for Cographs Recognition and Applications. - Gur Saran Adhar; Shietung Peng (WADS, 1989)

Parallel Algorithms for Path Covering, Hamiltonian Path and Hamiltonian Cycle in Cographs. - Gur Saran Adhar; Shietung Peng (ICPP (3), 1990)

Parallel Algorithms for Cographs and Parity Graphs with Applications. - Gur Saran Adhar; Shietung Peng (J. Algorithms, 1990)

Parallel algorithms for finding connected, independent and total domination in interval graphs. - Gur Saran Adhar; Shietung Peng (Algorithms and Parallel VLSI Architectures, 1991)

Parallel Algorithms for K-tree Recognition and its Applications. - Gur Saran Adhar; Shietung Peng (HICSS (2), 1994)

Domination in bounded interval tolerance graphs. - Gur Saran Adhar (ICPADS Workshops, 2000)

Optimal Parallel Algorithms for Cut Vertices, Bridges, and Hamiltonian Path in Bounded Interval Tolerance Graphs. - Gur Saran Adhar (ICPADS, 2001)

Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks. - Gur Saran Adhar (Applied Informatics, 2003)

Parallel algorithms for chains and anti-chains of points on a plane. - Gur Saran Adhar (ICPADS, 2007)