[1] U. V. Catalyurek and C. Aykanat, Hypergraph-partitioning based decomposition for parallel sparse-matrix vector  multiplication, IEEE Transactions on Parallel and Distributed Systems, 10 (1999), pp.673-693.
[2] U. V. Catalyurek and C. Aykanat, A Fine-Grain Hypergraph Model for 2D Decomposition of Sparse Matrices, in Proceedings of International Parallel and Distributed Processing Symposium (IPDPS), 8th International Workshop on Solving Irregularly structured Problems in Parallel (Irregular 2001), San Francisco, April 2001.
[3] U. V. Catalyurek and C. Aykanat, A hypergraph-partitioning approach for coarse-grain decomposition, in Proceedings of Scientific Computing 2001(SC2001), Denver, Colorado, November 2001, pp. 10-16.
[4] U. V. Catalyurek, Hypergraph Models for Sparse Matrix Partitioning and Reordering, PhD thesis, Bilkent University, Computer Engineering and Information Science, Nov. 1999.
[5] B. Ucar and C. Aykanat, Encapsulating multiple communication-cost metrics in partitioning sparse rectangular matrices for parallel matrix-vector multiplies, submitted to SIAM SciComp.
[6] C. Aykanat, A. Pinar and U. V. Catalyurek, Permuting sparse rectangular matrices into block-diagonal form, submitted to SIAM SciComp.
[7] B. B. Cambazoglu, A Hypergraph-Partitioning Based Remapping Model for Image-Space Parallel Volume Rendering, MsC Thesis, Bilkent University, Department of Computer Engineering, Feb. 2000.