SIAM Workshop on Combinatorial Scientific Computing (CSC 2004)
Schedule and Program


FRIDAY
February 27, 2004
Photo Slide Show
14:00-14:10
Welcome; Alan George honored for his contributions to CSC
Alex Pothen (ODU)    Alan George (Waterloo)

Session I: Computational Biology
Chair: Horst Simon (Berkeley Lab)
14:10-14:55
Combinatorial Optimization and Structures in Computational Biology and Bioinformatics
Dan Gusfield (UC Davis; Invited Talk)
14:55-15:15
Combinatorial Approaches to Bio-Ontology Management With Large Partially Ordered Sets Cliff Joslyn and Susan Mniszewski (Los Alamos)
15:15-15:30
Discussion

15:30-16:00
Coffee Break


Session II: Sparse Solvers and Partial Differential Equations
Chair: Sivan Toledo (Tel Aviv)
16:00-16:20
Nearly-Linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving SDD Linear Systems
Daniel A. Spielman (MIT), Shang-Hua Teng (Boston) 
16:20-16:40
Direct linear time solvers for sparse matrices
Shivkumar Chandrasekaran (UCSB) and  Ming Gu (Berkeley)
16:40-17:00
Computational Aspects of Meshfree Methods
Suely Oliveira (Iowa)
17:00-17:15
Discussion


Session III: Performance Aspects of Algorithms
Chair: John Gilbert (UCSB)
17:15-18:00 Smoothed Analysis of Algorithms
Shang-Hua Teng (Boston and Akamai; Invited Talk)
SATURDAY
February 27, 2004
08:00-08:20
Cache-Oblivious and Cache-Aware Algorithms Michael A. Bender(Stony Brook)
08:20-08:40
Sparse Data Structures for Weighted Bipartite Matching
E. Jason Riedy and James Demmel (Berkeley)
08:40-09:00
Using Hypergraphs to Improve Iteration Reordering Heuristics
Michelle Mills Strout and Paul D. Hovland (Argonne)
09:00-09:15
Discussion


Session IV: Orderings for Sparse Solvers
Chair: Rob Bisseling (Utrecht)
09:15-09:35
Symmetric Weighted Matching and Application to Indefinite Multifrontal Solvers
Iain S. Duff, Stephane Pralet (CERFACS)
09:35-09:55
Unsymmetric Orderings using a Constrained Markowitz Scheme
Patrick R. Amestoy (ENSEEIHT), Xiaoye S. Li (LBL), and Stephane Pralet
10:00-10:30
Coffee Break
10:30-10:50
Nested Dissection Orderings for LU Factorization with Static Pivoting
Ali Pinar, Manmeet Singh, and Esmond Ng (LBL)
10:50-11:05
Discussion


Session V: Automatic Differentiation and Graph Coloring
Chair: Alex Pothen (ODU)
11:05-11:25
Combinatorial Problems in Automatic Differentiation
Paul Hovland (Argonne) and Uwe Naumann (Aachen)
11:25-11:45
Is the Efficient Use of the Chain Rule Straight-Forward? Uwe Naumann and Jean Utke (Argonne)
11:45-12:00
Discussion


Session VI: Meshing
Chair: John Gilbert (UCSB)
12:00-12:20
Adaptive Dynamic Projection-Based Partitioning for Parallel Delaunay Mesh Generation Algorithms
Clemens Kadow (CMU)
12:30-13:30 Lunch Break (Box lunches available)

13:30-13:50
Combinatorial Aspects of Dual-Based Hexahedral Mesh Modification
Timothy J. Tautges(Sandia)
13:50-14:05
Discussion

14:05-14:45 CSC Business meeting


Session VII: Combinatorial Matrix Theory
Chair: Bruce Hendrickson (Sandia)
14:45-15:30
Some Highlights of Combinatorial Matrix Theory
Richard Brualdi (Wisconsin; Invited Talk)
15:30-16:00
Coffee Break

16:00-16:20
On the Factor Width of Symmetric Matrices E. G. Boman (Sandia), D. Chen, O. Parekh, and S. Toledo
16:20-16:40
Combinatorial and Computational Aspects of the Monomer-Dimer Problem
Shmuel Friedland, Uri Peled (Illinois, Chicago)
16:40-17:00
Approximate Counting via Stratified Sampling: the 3D Hard-Sphere Entropy Constant Isabel Beichl (NIST) and Francis Sullivan (IDA)
17:00-17:20
Spectral properties of acyclic matrices
Bryan L. Shader (Wyoming)
17:20-17:40
Discussion

17:40
Workshop Adjouns
Group Photo