Program
The program takes place at Albuquerque Marriott(2101 Louisiana Boulevard NE; Albuquerque NM 87110)
Sunday, October 9  
6:30  8:30  Welcome Reception Location: Zuni Terrace  Poolside 
Monday, October 10  
Graphs and Applications; Algorithmic Differentiation; Optimization Location for all sessions in the day: Pecos/Sandia 

Session Chair: Assefaw Gebremedhin  
8:30  8:40  Opening Remarks  
8:40  9:25  Invited Talk: Parallel Machine Learning Approaches for Reverse Engineering Genomescale Networks 

9:35  9:55  Graph Partitioning Methods for Fast Parallel Quantum Molecular Dynamics 

10:00  10:20  An Adaptive Parallel Algorithm for Computing Connectivity 

10:30  11:00  Coffee Break  
Session Chair: Sherry Li  
11:00  11:20  On Stable Marriages and Greedy Matchings 

11:25  11:45  A New 3/2Approximation Algorithm for the bEdge Cover Problem 

11:50  12:10  Fast Hierarchy Construction for Dense Subgraphs 

12:15  1:45  Lunch Break  
Session Chair: Stefan Wild  
1:45  2:05  Edge Pushing is Equivalent to Vertex Elimination for Computing Hessians 

2:10  2:30  An Integer Programming Formulation of the Minimal Jacobian Representation Problem


2:35  2:55  Mixed Integer Programming for Call Tree Reversal


3:00  3:30  Coffee Break  
Session Chair: Ilya Safro  
3:30  3:50  Extending the Binomial Checkpointing Technique for Resilience 

3:55  4:15  Coordinated Platoon Routing in a Metropolitan Network 

4:20  4:40  Using Tropical Optimization Techniques to Evaluate Alternatives via Pairwise Comparisons 

4:45  6:30  Free  
6:30   Workshop Dinner 
Tuesday, October 11  
Graphs and Sparse Computations Location for all sessions in the day: Pecos/Sandia 

Session Chair: Erik Boman  
8:30  8:40  Remarks/Announcements  
8:40  9:25  Invited Talk: Graphs and sparse Matrices: There and Back Again 

9:35  9:55  A Hybrid Mutithreaded Direct Sparse Triangular Solver 

10:00  10:20  HiLUK: Scalable Incomplete Factorization Utilizing Combinatorial Methods to Reduce Overheads 

10:30  11:00  Coffee Break  
Session Chair: Rob Bisseling  
11:00  11:20  Preconditioning Techniques Based on the Birkhoffvon Neumann Decomposition 

11:25  11:45  Enabling Implicit Time Integration for Compressible Flows by Partial Coloring: A Case Study of a Semimatrixfree Preconditioning Technique 

11:50  12:10  Sparse Computations and MultiBSP 

12:15  1:45  Lunch Break  
Session Chair: Cevdet Aykanat  
1:45  2:05  HPCGraph: Benchmarking Massive Graph Analytics on Supercomputers 

2:10  2:30  Convex Partitioning of LargeScale Directed Graphs


2:35  2:55  Highly Scalable Community Detection using a GPU


3:00  3:30  Coffee Break  
Session Chair: Bora Ucar  
3:30  3:50  Sparse MatrixMatrix Multiplication for Modern Architectures 

3:55  4:15  Exploiting Matrix Reuse and Data Locality in Sparse MatrixVector and MatrixTransposeVector Multiplication on ManyCore Architectures 

4:20  4:30  Short Break  
4:30  6:00  Business Meeting, Chair: Alex Pothen Location: Pecos/Sandia 

6:00  7:00  Poster Session Location: Pecos/Sandia 
Wednesday, October 12  
Spectral Graph Theoretic Approaches; Ordering; Partitioning Location for all sessions in the day: Pecos/Sandia 

Session Chair: Bruce Hendrickson  
8:30  8:40  Remarks/Announcements  
8:40  9:25  Invited Talk: The Revolution in Graph Theoretic Optimization 

9:35  9:55  Estimating Currentflow Closeness Centrality with a Multigrid Laplacian Solver 

10:00  10:20  An Empirical Study of Cycle Toggling based Laplacian Solver 

10:30  11:00  Coffee Break  
Session Chair: Sivan Toledo  
11:00  11:20  A Parallel Solver for Laplacian Matrices 

11:25  11:45  Hierarchical Probing for General Graphs, a Method for Computing Diag(f(A)) 

11:50  12:10  Augmenting Hypergraph Models with Message Nets to Reduce Bandwidth Latency Costs 

12:15  1:45  Lunch Break  
Session Chair: Siva Rajamanickam  
1:45  2:05  A Global, Distributed Ordering Library 

2:10  2:30  The Reverse CuthillMcKee Algorithm in DistributedMemory 

2:35  2:55  A Multilevel Vertex Separator Algorithm Based on the Solution of Bilinear Programs


3:00  3:20  BalanceEnforced MultiLevel Algorithm for MultiCriteria Mesh Partitioning Remi Barat, CEA  Université de Bordeaux, France Slides 