Dagstuhl Seminar Proceedings, Volume 9061,

• Uwe Naumann, Olaf Schenk, Horst D Simon, and Sivan Toledo 09061 Abstracts Collection – Combinatorial Scientific Computing 10.4230/DagSemProc.09061.1
• Cevdet Aykanat, Erkan Okuyan, and B. Barla Cambazoglu A Model for Task Repartioning under Data Replication 10.4230/DagSemProc.09061.2
• Samuel I. Daitch and Daniel A. Spielman A Nearly-Linear Time Algorithm for Approximately Solving Linear Systems in a Symmetric M-Matrix 10.4230/DagSemProc.09061.3
• Jan Riehme and Andreas Griewank Algorithmic Differentiation Through Automatic Graph Elimination Ordering (ADTAGEO) 10.4230/DagSemProc.09061.4
• H. Martin Bücker, Michael Lülfesmann, and Arno Rasch Assessing an approximation algorithm for the minimum fill-in problem in practice 10.4230/DagSemProc.09061.5
• Rob Bisseling, Tristan van Leeuwen, and Umit V. Catalyurek Combinatorial Problems in High-Performance Computing: Partitioning 10.4230/DagSemProc.09061.6
• Jean Utke and Uwe Naumann Combinatorial Problems in OpenAD 10.4230/DagSemProc.09061.7
• Iain S. Duff and Bora Ucar Combinatorial problems in solving linear systems 10.4230/DagSemProc.09061.8
• Francois Pellegrini Distillating knowledge about SCOTCH 10.4230/DagSemProc.09061.9
• Andrea Walther Getting Started with ADOL-C 10.4230/DagSemProc.09061.10
• Karen D. Devine, Erik G. Boman, Lee Ann Riesen, Umit V. Catalyurek, and Cédric Chevalier Getting Started with Zoltan: A Short Tutorial 10.4230/DagSemProc.09061.11
• Viktor Mosenkis, Uwe Naumann, and Elmar Peise Low-Memory Tour Reversal in Directed Graphs 10.4230/DagSemProc.09061.12
• Timothy Davis Multifrontral multithreaded rank-revealing sparse QR factorization 10.4230/DagSemProc.09061.13
• Doruk Bozdag, Catalin C. Barbacioru, and Umit V. Catalyurek Parallelization of Mapping Algorithms for Next Generation Sequencing Applications 10.4230/DagSemProc.09061.14
• Andrew Lyons and Ilya Safro Randomized Heuristics for Exploiting Jacobian Scarcity 10.4230/DagSemProc.09061.15
• Andreas Wächter Short Tutorial: Getting Started With Ipopt in 90 Minutes 10.4230/DagSemProc.09061.16
• Frank Hülsemann Stabilising aggregation AMG 10.4230/DagSemProc.09061.17
• Shahadat Hossain and Trond Steihaug The CPR Method and Beyond : Prologue 10.4230/DagSemProc.09061.18
• Assefaw H. Gebremedhin The Enabling Power of Graph Coloring Algorithms in Automatic Differentiation and Parallel Processing 10.4230/DagSemProc.09061.19
• Ruud van der Pas The Past, Present and Future of High Performance Computing 10.4230/DagSemProc.09061.20
• Cédric Chevalier and Ilya Safro Weighted aggregation for multi-level graph partitioning 10.4230/DagSemProc.09061.21