Gur Saran Adhar Coauthor index DBLP Vis pubzone.org

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

DBLP keys2007
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGur Saran Adhar: Parallel algorithms for chains and anti-chains of points on a plane. ICPADS 2007: 1-7
2003
7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGur Saran Adhar: Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks. Applied Informatics 2003: 692-696
2001
6no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGur Saran Adhar: Optimal Parallel Algorithms for Cut Vertices, Bridges, and Hamiltonian Path in Bounded Interval Tolerance Graphs. ICPADS 2001: 91-98
1994
5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGur Saran Adhar, Shietung Peng: Parallel Algorithms for K-tree Recognition and its Applications. HICSS (2) 1994: 194-202
1991
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGur 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
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGur Saran Adhar, Shietung Peng: Parallel Algorithms for Path Covering, Hamiltonian Path and Hamiltonian Cycle in Cographs. ICPP (3) 1990: 364-365
2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGur Saran Adhar, Shietung Peng: Parallel Algorithms for Cographs and Parity Graphs with Applications. J. Algorithms 11(2): 252-284 (1990)
1989
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGur Saran Adhar, Shietung Peng: Parallel Algorithms for Cographs Recognition and Applications. WADS 1989: 335-351

Coauthor Index

1Shietung Peng [1] [2] [3] [4] [5]

Copyright © Mon Nov 30 15:58:31 2009 by Michael Ley (ley@uni-trier.de)