<h2>Dagstuhl Seminar Proceedings, Volume 9061, </h2>
<ul>
<li>
<span class="authors">Uwe Naumann, Olaf Schenk, Horst D Simon, and Sivan Toledo</span>
<span class="title">09061 Abstracts Collection – Combinatorial Scientific Computing</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09061.1">10.4230/DagSemProc.09061.1</a>
</li>
<li>
<span class="authors">Cevdet Aykanat, Erkan Okuyan, and B. Barla Cambazoglu</span>
<span class="title">A Model for Task Repartioning under Data Replication</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09061.2">10.4230/DagSemProc.09061.2</a>
</li>
<li>
<span class="authors">Samuel I. Daitch and Daniel A. Spielman</span>
<span class="title">A Nearly-Linear Time Algorithm for Approximately Solving Linear Systems in a Symmetric M-Matrix</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09061.3">10.4230/DagSemProc.09061.3</a>
</li>
<li>
<span class="authors">Jan Riehme and Andreas Griewank</span>
<span class="title">Algorithmic Differentiation Through Automatic Graph Elimination Ordering (ADTAGEO)</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09061.4">10.4230/DagSemProc.09061.4</a>
</li>
<li>
<span class="authors">H. Martin Bücker, Michael Lülfesmann, and Arno Rasch</span>
<span class="title">Assessing an approximation algorithm for the minimum fill-in problem in practice</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09061.5">10.4230/DagSemProc.09061.5</a>
</li>
<li>
<span class="authors">Rob Bisseling, Tristan van Leeuwen, and Umit V. Catalyurek</span>
<span class="title">Combinatorial Problems in High-Performance Computing: Partitioning</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09061.6">10.4230/DagSemProc.09061.6</a>
</li>
<li>
<span class="authors">Jean Utke and Uwe Naumann</span>
<span class="title">Combinatorial Problems in OpenAD</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09061.7">10.4230/DagSemProc.09061.7</a>
</li>
<li>
<span class="authors">Iain S. Duff and Bora Ucar</span>
<span class="title">Combinatorial problems in solving linear systems</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09061.8">10.4230/DagSemProc.09061.8</a>
</li>
<li>
<span class="authors">Francois Pellegrini</span>
<span class="title">Distillating knowledge about SCOTCH</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09061.9">10.4230/DagSemProc.09061.9</a>
</li>
<li>
<span class="authors">Andrea Walther</span>
<span class="title">Getting Started with ADOL-C</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09061.10">10.4230/DagSemProc.09061.10</a>
</li>
<li>
<span class="authors">Karen D. Devine, Erik G. Boman, Lee Ann Riesen, Umit V. Catalyurek, and Cédric Chevalier</span>
<span class="title">Getting Started with Zoltan: A Short Tutorial</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09061.11">10.4230/DagSemProc.09061.11</a>
</li>
<li>
<span class="authors">Viktor Mosenkis, Uwe Naumann, and Elmar Peise</span>
<span class="title">Low-Memory Tour Reversal in Directed Graphs</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09061.12">10.4230/DagSemProc.09061.12</a>
</li>
<li>
<span class="authors">Timothy Davis</span>
<span class="title">Multifrontral multithreaded rank-revealing sparse QR factorization</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09061.13">10.4230/DagSemProc.09061.13</a>
</li>
<li>
<span class="authors">Doruk Bozdag, Catalin C. Barbacioru, and Umit V. Catalyurek</span>
<span class="title">Parallelization of Mapping Algorithms for Next Generation Sequencing Applications</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09061.14">10.4230/DagSemProc.09061.14</a>
</li>
<li>
<span class="authors">Andrew Lyons and Ilya Safro</span>
<span class="title">Randomized Heuristics for Exploiting Jacobian Scarcity</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09061.15">10.4230/DagSemProc.09061.15</a>
</li>
<li>
<span class="authors">Andreas Wächter</span>
<span class="title">Short Tutorial: Getting Started With Ipopt in 90 Minutes</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09061.16">10.4230/DagSemProc.09061.16</a>
</li>
<li>
<span class="authors">Frank Hülsemann</span>
<span class="title">Stabilising aggregation AMG</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09061.17">10.4230/DagSemProc.09061.17</a>
</li>
<li>
<span class="authors">Shahadat Hossain and Trond Steihaug</span>
<span class="title">The CPR Method and Beyond : Prologue</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09061.18">10.4230/DagSemProc.09061.18</a>
</li>
<li>
<span class="authors">Assefaw H. Gebremedhin</span>
<span class="title">The Enabling Power of Graph Coloring Algorithms in Automatic Differentiation and Parallel Processing</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09061.19">10.4230/DagSemProc.09061.19</a>
</li>
<li>
<span class="authors">Ruud van der Pas</span>
<span class="title">The Past, Present and Future of High Performance Computing</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09061.20">10.4230/DagSemProc.09061.20</a>
</li>
<li>
<span class="authors">Cédric Chevalier and Ilya Safro</span>
<span class="title">Weighted aggregation for multi-level graph partitioning</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09061.21">10.4230/DagSemProc.09061.21</a>
</li>
</ul>
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing