Publications

• Overview Papers and News Articles
• Research Papers
• Journal Papers
• Conference Papers
• Book Chapters
• PhD Theses

• A. Pothen, A.H. Gebremedhin, F. Dobrian; E.G. Boman, K.D. Devine, B.A. Hendrickson; P. Hovland, B. Norris, J. Utke; U. Catalyurek; M.M. Strout; Combinatorial Algorithms for Petascale Science, SciDAC Review, Issue 5, pp 26-35, Fall 2007.
• E.G. Boman, D. Bozdag, U. Catalyurek, K. Devine, A.H. Gebremedhin, P. Hovland and A. Pothen, Combinatorial Algorithms for Computational Science and Engineering, Journal of Physics: Conference Series 125 (2008) 012071, 5 pp. SciDAC 2008.
• E.G. Boman, D. Bozdag, U.V. Catalyurek, K.D. Devine, A.H. Gebremedhin, P.D. Hovland, A. Pothen, and M.M. Strout, Enabling high performance computational science through combinatorial algorithms, Journal of Physics: Conference Series 78 (2007) 012058, SciDAC 2007.
• S. Bhowmick, E.G. Boman, K. Devine, A.H. Gebremedhin, B. Hendrickson, P. Hovland, T. Munson and A. Pothen, Combinatorial Algorithms Enabling Computational Science: Tales from the Front, Journal of Physics: Conference Series 46 (2006), 453-457, SciDAC 2006.
• B. Hendrickson, and A. Pothen, Combinatorial Scientific Computing: The enabling power of discrete algorithms in computational science, Lecture Notes in Computer Science, Vol. 4395, pp. 260-280, 2007.
• M. Wolf and E. Boman, Parallel Processing '08: An Increasing Role for Combinatorial Methods in Large-Scale Parallel Simulations, SIAM News Vol 41, No 5, June 2008.
• A.H. Gebremedhin, The Third SIAM Workshop on Combinatorial Scientific Computing, SIAM News Vol 40, No 4, May 2007.

• U. Catalyurek, C. Aykanat and E. Kayaaslan, Hypergraph Partitioning- Based Fill-Reducing Ordering, Technical Report, OSUBMI-TR-2009-n02, The Ohio State University, Department of Biomedical Informatics, also available as BU-CE-0904, Bilkent University, Computer Engineering Department, 2009. Submitted for Publication.
• U. Catalyurek, C. Aykanat, and B. Ucar, On two-dimensional sparse matrix partitioning: Models, Methods, and a Recipe, Technical Report, No. OSUBMI_TR_2008_n04, The Ohio State University, Department of Biomedical Informatics, 2008, Submitted for Publication.
• E.G. Boman, and M.M. Wolf, A Nested Dissection Approach to Sparse Matrix Partitioning for Parallel Computations, Sandia Report 2008-5482J, 2008, Submitted for Publication.
• U.V. Catalyurek, E.G. Boman, K.D. Devine, D. Bozdag, R.T. Heaphy, and L.A. Riesen, A Hypergraph Repartitioning Model for Dynamic Load Balancing, Journal of Parallel and Distributed Computing, to appear.
• D. W. Cranston, and P. D. Hovland, Colorings for Efficient Derivative Computation on Grids with Periodic Boundaries, Preprint ANL/MCS-P1557-1108, 2008, Submitted for Publication.
• L. Grigori, E.G. Boman, S. Donfack, and T.A. Davis, Hypergraph-based Unsymmetric Nested Dissection Ordering for Sparse LU Factorization, Sandia Report 2008-1290J, 2008, Submitted for Publication.
• D. Ron, I. Safro and A. Brandt, A Fast Multigrid Algorithm for Energy Minimization under Planar Density Constraints, Preprint ANL/MCS-P1560-1108, 2008, Submitted for Publication.
• D. Bozdag, U. Catalyurek, A.H. Gebremedhin, F. Manne, E.G. Boman, and F. Ozguner, Distributed-memory Parallel Algorithms for Distance-2 Coloring and Their Application to Derivative Computation, Aug 2008, Submitted for Publication.
• A.H. Gebremedhin, A. Pothen, A. Tarafdar, and A. Walther, Efficient Computation of Sparse Hessians using Coloring and Automatic Differentiation, INFORMS Journal on Computing Vol 21, No 2, pp 209--223, 2009.
• D. Bozdag, F. Ozguner, U. Catalyurek, Compaction of Schedules and a Two-Stage Approach for Duplication-Based DAG Scheduling, IEEE Transaction on Parallel and Distributed Systems, to appear.
• D. Bozdag, A.H. Gebremedhin, F. Manne, E.G. Boman, and U. Catalyurek, A Framework for Scalable Greedy Coloring on Distributed Memory Parallel Computers, Journal of Parallel and Distributed Computing, Vol 68, No 4, pp 515-535, 2008.
• A. Lumsdaine, D. Gregor, B. Hendrickson and J. Berry, Challenges in Parallel Graph Processing, Parallel Processing Letters, , 17(1):5--20, 2007.
• P. Hovland, B. Norris, M. M. Strout, and J. Utke., Term Graphs for Computing Derivatives in Imperative Languages, Electronic Notes in Theoretical Computer Science, Volume 176, Issue 1, 28 May 2007, Pages 99-111.
• A. Gebremedhin, A. Tarafdar, F. Manne and A. Pothen, New Acyclic and Star Coloring Algorithms with Applications to Hessian Computation, SIAM Journal on Scientific Computing, Vol 29, No 3, pp 1042--1072, 2007.
• A. Gebremedhin, M. Essaidi, I. Guerin-Lassous, J. Gustedt, J.A. Telle, PRO: A Model for the Design and Analysis of Efficient and Scalable Parallel Algorithms, Nordic Journal of Computing, Vol 13, pp 1--25, 2006.

• M. Strout, N. Osheim, D. Rostron, P. Hovland and A. Pothen, Evaluation of Hierarchical Mesh Reorderings, Proceedings of the International Conference on Computational Science (ICCS), May 2009.
• E.G. Boman, U.V. Catalyurek, C. Chevalier, K.D. Devine, I. Safro, and M.M. Wolf, Advances in Parallel Partitioning, Load Balancing, and Matrix Ordering, SciDAC09 Conference, San Diego, June 2009, to appear.
• M. Halappanavar, F. Dobrian, and A. Pothen, Matchings in Massive Graphs on Terascale Computers via Approximation, 2009, Submitted for Publication.
• O. Roderick, and I. Safro, Polynomial interpolation for predicting decisions and recovering missing data, Preprint ANL/MCS-P1586-0209, 2009, Submitted for Publication.
• A. Lyons, Restricted Coloring Problems and Forbidden Induced Subgraphs, Preprint ANL/MCS-P1611-0409, 2009, Submitted for Publication.
• D. Bozdag , C. Barbacioru and U. Catalyurek , Parallel Short Sequence Mapping for High Throughput Genome Sequencing, 23rd International Parallel and Distributed Processing Symposium (IPDPS'09), to appear.
• I. Safro, P. Hovland, J. Shin, and M. Strout, Improving random walk performance, accepted in International Conference on Scientific Computing , 2009.
• K. Devine, E. Boman, L.A. Riesen, U. Catalyurek, C. Chevalier, Getting Started With Zoltan: a Short Tutorial, to appear in proceedings of Dagstuhl Seminar On Combinatorial Scientific Computing, Feb 2009.
• C. Chevalier, and I. Safro, Comparison of Coarsening Schemes for Multilevel Graph Partitioning, to appear at the 3rd Workshop on Learning and Intelligent Optimization (LION-3), Trento, Italy, January 2009.
• A. Lyons, Acyclic and Star Colorings of Joins of Graphs and an Algorithm for Cographs, Proceedings of CTW09, accepted.
• M.M. Wolf, E.G. Boman, and B. Hendrickson, Optimizing Parallel Sparse Matrix-Vector Multiplication by Corner Partitioning, PARA08, Trondheim, Norway, May 2008, to appear in LNCS.
• A.H. Gebremedhin, A. Pothen, and A. Walther, Exploiting Sparsity in Jacobian Computation via Coloring and Automatic Differentiation: a Case Study in a Simulated Moving Bed process, In C. Bischof et al. (Eds.): Proceeding of AD2008, The 5th Int'l Conference on AD, Lecture Notes in Computational Science and Engineering 64, pp. 339-349, 2008, Springer.
• H.S. Abdel-Khalik, P. Hovland, A. Lyons, T. Stover and J. Utke, A Low Rank Approach to Automatic Differentiation, In C. Bischof et al. (Eds.): Proceeding of AD2008, The 5th Int'l Conference on AD, Lecture Notes in Computational Science and Engineering 64, pp. 55-65, 2008, Springer.
• S. Bhowmick and P. Hovland, A Polynomial-Time Algorithm for Detecting Directed Axial Symmetry in Hessian Computational Graphs, In C. Bischof et al. (Eds.): Proceeding of AD2008, The 5th Int'l Conference on AD, Lecture Notes in Computational Science and Engineering 64, pp. 91-102, 2008, Springer.
• A. Lyons and J. Utke, On the Practical Exploitation of Scarsity, In C. Bischof et al. (Eds.): Proceeding of AD2008, The 5th Int'l Conference on AD, Lecture Notes in Computational Science and Engineering 64, pp. 103-114, 2008, Springer.
• J. Shin, P. Malusare, and P. Hovland, Design and Implementation of a Context-Sensitive, Flow-Sensitive Activity Analysis Algorithm for Automatic Differentiation, In C. Bischof et al. (Eds.): Proceeding of AD2008, The 5th Int'l Conference on AD, Lecture Notes in Computational Science and Engineering 64, pp. 115-126, 2008, Springer.
• I. Charpentier, C.D. Cappello, and J. Utke Efficient Higher-Order Derivatives of the Hypergeometric Function, In C. Bischof et al. (Eds.): Proceeding of AD2008, The 5th Int'l Conference on AD, Lecture Notes in Computational Science and Engineering 64, pp. 127-137, 2008, Springer.
• U.V. Catalyurek, E.G. Boman, K.D. Devine, D. Bozdag, R. Heaphy, L.A. Riesen, Hypergraph-based Dynamic Load Balancing for Adaptive Scientific Computations, Proceedings of 21st IEEE International Parallel & Distributed Processing Symposium (IPDPS´ 07), 2007. Won best paper award in the Algorithms track.