PhD thesis

          Practical Parallel Algorithms for Graph
        Coloring Problems in Numerical Optimization,
          A. H. Gebremedhin.  Dr.scient thesis,
 Department of Informatics, University of Bergen,
          February 2003.

 The thesis consists of a  coverpage (ps) (pdf), acknowledgements (ps) (pdf),
a common introduction (ps) (pdf) and the following five papers:

           Scalable Parallel Graph Coloring Algorithms (ps) (pdf)
           with F. Manne.  Concurrency: Pract. Exper. 2000; 12:1131-1146.  
           Graph Coloring in Optimization Revisited (ps) (pdf)
           with F. Manne and A. Pothen.  

           Parallel Distance-k Coloring Algorithms for Numerical Optimization (ps) (pdf)
           with F. Manne and A. Pothen.
           A shorter version appears  In B. Monien and R. Feldmann (Eds.): Euro-Par 2002, 
           LNCS 2400, pp. 912-921,
Springer-Verlag 2002. (ps)  (pdf)

           Graph Coloring on Coarse Grained Multicomputers (ps) (pdf)
           with I.G. Lassous, J. Gustedt and J.A. Telle.
           To appear in Discrete Applied Mathematics.
           A preliminary version appears  In U. Brandes and D. Wagner (Eds.):
           WG 2000,
LNCS 1928,  pp. 184-195, 2000, Springer-Verlag. (ps).

           PRO: a Model for Parallel Resource-Optimal Computation (ps) (pdf)
           with I. G. Lassous, J. Gustedt and J.A. Telle.
           In Proceedings of HPCS'2002 - The 16th Annual International Symposium
           on High Performance Computing Systems and Applications,  Moncton, NB, Canada,
           June 17-19, 2002, pages 106-113, IEEE Compter Society Press.
Master's thesis
Parallel Graph Coloring,
A. H. Gebremedhin, Cand.scient thesis,
Department of Informatics, University of Bergen,
May 1999.  (ps) (pdf)