Uwe Naumann, Olaf Schenk, Horst D Simon, and Sivan Toledo. 09061 Abstracts Collection – Combinatorial Scientific Computing. In Combinatorial Scientific Computing. Dagstuhl Seminar Proceedings, Volume 9061, pp. 1-49, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{naumann_et_al:DagSemProc.09061.1, author = {Naumann, Uwe and Schenk, Olaf and Simon, Horst D and Toledo, Sivan}, title = {{09061 Abstracts Collection – Combinatorial Scientific Computing}}, booktitle = {Combinatorial Scientific Computing}, pages = {1--49}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9061}, editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.1}, URN = {urn:nbn:de:0030-drops-21124}, doi = {10.4230/DagSemProc.09061.1}, annote = {Keywords: Graphs, combinatorics, high-performance scientific computing} }
Cevdet Aykanat, Erkan Okuyan, and B. Barla Cambazoglu. A Model for Task Repartioning under Data Replication. In Combinatorial Scientific Computing. Dagstuhl Seminar Proceedings, Volume 9061, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{aykanat_et_al:DagSemProc.09061.2, author = {Aykanat, Cevdet and Okuyan, Erkan and Cambazoglu, B. Barla}, title = {{A Model for Task Repartioning under Data Replication}}, booktitle = {Combinatorial Scientific Computing}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9061}, editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.2}, URN = {urn:nbn:de:0030-drops-20903}, doi = {10.4230/DagSemProc.09061.2}, annote = {Keywords: Task repartitioning, data replication, hypergraph partitioning with fixed vertices, assignment flow network} }
Samuel I. Daitch and Daniel A. Spielman. A Nearly-Linear Time Algorithm for Approximately Solving Linear Systems in a Symmetric M-Matrix. In Combinatorial Scientific Computing. Dagstuhl Seminar Proceedings, Volume 9061, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{daitch_et_al:DagSemProc.09061.3, author = {Daitch, Samuel I. and Spielman, Daniel A.}, title = {{A Nearly-Linear Time Algorithm for Approximately Solving Linear Systems in a Symmetric M-Matrix}}, booktitle = {Combinatorial Scientific Computing}, pages = {1--4}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9061}, editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.3}, URN = {urn:nbn:de:0030-drops-20803}, doi = {10.4230/DagSemProc.09061.3}, annote = {Keywords: M-matrix, diagonally-dominant matrix, linear system solver, iterative algorithm, randomized algorithm, network flow, gain graph} }
Jan Riehme and Andreas Griewank. Algorithmic Differentiation Through Automatic Graph Elimination Ordering (ADTAGEO). In Combinatorial Scientific Computing. Dagstuhl Seminar Proceedings, Volume 9061, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{riehme_et_al:DagSemProc.09061.4, author = {Riehme, Jan and Griewank, Andreas}, title = {{Algorithmic Differentiation Through Automatic Graph Elimination Ordering (ADTAGEO)}}, booktitle = {Combinatorial Scientific Computing}, pages = {1--2}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9061}, editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.4}, URN = {urn:nbn:de:0030-drops-20852}, doi = {10.4230/DagSemProc.09061.4}, annote = {Keywords: Automatic Differentiation, Instant Elimination, Live-DAG, symmetric Hessian-DAG, forward mode, reverse mode, checkpointing, ADTAGEO} }
H. Martin Bücker, Michael Lülfesmann, and Arno Rasch. Assessing an approximation algorithm for the minimum fill-in problem in practice. In Combinatorial Scientific Computing. Dagstuhl Seminar Proceedings, Volume 9061, p. 1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{bucker_et_al:DagSemProc.09061.5, author = {B\"{u}cker, H. Martin and L\"{u}lfesmann, Michael and Rasch, Arno}, title = {{Assessing an approximation algorithm for the minimum fill-in problem in practice}}, booktitle = {Combinatorial Scientific Computing}, pages = {1--1}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9061}, editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.5}, URN = {urn:nbn:de:0030-drops-21191}, doi = {10.4230/DagSemProc.09061.5}, annote = {Keywords: Sparse linear algebra} }
Rob Bisseling, Tristan van Leeuwen, and Umit V. Catalyurek. Combinatorial Problems in High-Performance Computing: Partitioning. In Combinatorial Scientific Computing. Dagstuhl Seminar Proceedings, Volume 9061, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{bisseling_et_al:DagSemProc.09061.6, author = {Bisseling, Rob and van Leeuwen, Tristan and Catalyurek, Umit V.}, title = {{Combinatorial Problems in High-Performance Computing: Partitioning}}, booktitle = {Combinatorial Scientific Computing}, pages = {1--5}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9061}, editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.6}, URN = {urn:nbn:de:0030-drops-20818}, doi = {10.4230/DagSemProc.09061.6}, annote = {Keywords: Partitioning, sparse matrix, hypergraph, parallel, HPC} }
Jean Utke and Uwe Naumann. Combinatorial Problems in OpenAD. In Combinatorial Scientific Computing. Dagstuhl Seminar Proceedings, Volume 9061, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{utke_et_al:DagSemProc.09061.7, author = {Utke, Jean and Naumann, Uwe}, title = {{Combinatorial Problems in OpenAD}}, booktitle = {Combinatorial Scientific Computing}, pages = {1--12}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9061}, editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.7}, URN = {urn:nbn:de:0030-drops-20954}, doi = {10.4230/DagSemProc.09061.7}, annote = {Keywords: Automatic differentiation, combinatorial problem, tool tutorial} }
Iain S. Duff and Bora Ucar. Combinatorial problems in solving linear systems. In Combinatorial Scientific Computing. Dagstuhl Seminar Proceedings, Volume 9061, pp. 1-37, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{duff_et_al:DagSemProc.09061.8, author = {Duff, Iain S. and Ucar, Bora}, title = {{Combinatorial problems in solving linear systems}}, booktitle = {Combinatorial Scientific Computing}, pages = {1--37}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9061}, editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.8}, URN = {urn:nbn:de:0030-drops-20779}, doi = {10.4230/DagSemProc.09061.8}, annote = {Keywords: Combinatorial scientific computing, graph theory, combinatorial optimization, sparse matrices, linear system solution} }
Francois Pellegrini. Distillating knowledge about SCOTCH. In Combinatorial Scientific Computing. Dagstuhl Seminar Proceedings, Volume 9061, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{pellegrini:DagSemProc.09061.9, author = {Pellegrini, Francois}, title = {{Distillating knowledge about SCOTCH}}, booktitle = {Combinatorial Scientific Computing}, pages = {1--12}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9061}, editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.9}, URN = {urn:nbn:de:0030-drops-20914}, doi = {10.4230/DagSemProc.09061.9}, annote = {Keywords: Scotch, graph algorithms, data structures} }
Andrea Walther. Getting Started with ADOL-C. In Combinatorial Scientific Computing. Dagstuhl Seminar Proceedings, Volume 9061, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{walther:DagSemProc.09061.10, author = {Walther, Andrea}, title = {{Getting Started with ADOL-C}}, booktitle = {Combinatorial Scientific Computing}, pages = {1--10}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9061}, editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.10}, URN = {urn:nbn:de:0030-drops-20849}, doi = {10.4230/DagSemProc.09061.10}, annote = {Keywords: ADOL-C, algorithmic differentiation of C/C++ programs} }
Karen D. Devine, Erik G. Boman, Lee Ann Riesen, Umit V. Catalyurek, and Cédric Chevalier. Getting Started with Zoltan: A Short Tutorial. In Combinatorial Scientific Computing. Dagstuhl Seminar Proceedings, Volume 9061, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{devine_et_al:DagSemProc.09061.11, author = {Devine, Karen D. and Boman, Erik G. and Riesen, Lee Ann and Catalyurek, Umit V. and Chevalier, C\'{e}dric}, title = {{Getting Started with Zoltan: A Short Tutorial}}, booktitle = {Combinatorial Scientific Computing}, pages = {1--10}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9061}, editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.11}, URN = {urn:nbn:de:0030-drops-20886}, doi = {10.4230/DagSemProc.09061.11}, annote = {Keywords: Parallel computing, load balancing, partitioning, coloring, ordering, software} }
Viktor Mosenkis, Uwe Naumann, and Elmar Peise. Low-Memory Tour Reversal in Directed Graphs. In Combinatorial Scientific Computing. Dagstuhl Seminar Proceedings, Volume 9061, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{mosenkis_et_al:DagSemProc.09061.12, author = {Mosenkis, Viktor and Naumann, Uwe and Peise, Elmar}, title = {{Low-Memory Tour Reversal in Directed Graphs}}, booktitle = {Combinatorial Scientific Computing}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9061}, editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.12}, URN = {urn:nbn:de:0030-drops-20924}, doi = {10.4230/DagSemProc.09061.12}, annote = {Keywords: Directed graph, tour reversal, offline algorithm, dynamic programming, online algorithm, control-flow reversal, adjoint program} }
Timothy Davis. Multifrontral multithreaded rank-revealing sparse QR factorization. In Combinatorial Scientific Computing. Dagstuhl Seminar Proceedings, Volume 9061, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{davis:DagSemProc.09061.13, author = {Davis, Timothy}, title = {{Multifrontral multithreaded rank-revealing sparse QR factorization}}, booktitle = {Combinatorial Scientific Computing}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9061}, editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.13}, URN = {urn:nbn:de:0030-drops-20781}, doi = {10.4230/DagSemProc.09061.13}, annote = {Keywords: Sparse matrix algorithms, QR factorization, multifrontal} }
Doruk Bozdag, Catalin C. Barbacioru, and Umit V. Catalyurek. Parallelization of Mapping Algorithms for Next Generation Sequencing Applications. In Combinatorial Scientific Computing. Dagstuhl Seminar Proceedings, Volume 9061, p. 1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{bozdag_et_al:DagSemProc.09061.14, author = {Bozdag, Doruk and Barbacioru, Catalin C. and Catalyurek, Umit V.}, title = {{Parallelization of Mapping Algorithms for Next Generation Sequencing Applications}}, booktitle = {Combinatorial Scientific Computing}, pages = {1--1}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9061}, editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.14}, URN = {urn:nbn:de:0030-drops-21294}, doi = {10.4230/DagSemProc.09061.14}, annote = {Keywords: Genome sequencing, sequence mapping} }
Andrew Lyons and Ilya Safro. Randomized Heuristics for Exploiting Jacobian Scarcity. In Combinatorial Scientific Computing. Dagstuhl Seminar Proceedings, Volume 9061, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{lyons_et_al:DagSemProc.09061.15, author = {Lyons, Andrew and Safro, Ilya}, title = {{Randomized Heuristics for Exploiting Jacobian Scarcity}}, booktitle = {Combinatorial Scientific Computing}, pages = {1--2}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9061}, editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.15}, URN = {urn:nbn:de:0030-drops-20868}, doi = {10.4230/DagSemProc.09061.15}, annote = {Keywords: Jacobian, scarcity, accumulation, directed acyclic graph} }
Andreas Wächter. Short Tutorial: Getting Started With Ipopt in 90 Minutes. In Combinatorial Scientific Computing. Dagstuhl Seminar Proceedings, Volume 9061, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{wachter:DagSemProc.09061.16, author = {W\"{a}chter, Andreas}, title = {{Short Tutorial: Getting Started With Ipopt in 90 Minutes}}, booktitle = {Combinatorial Scientific Computing}, pages = {1--17}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9061}, editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.16}, URN = {urn:nbn:de:0030-drops-20890}, doi = {10.4230/DagSemProc.09061.16}, annote = {Keywords: Nonlinear Optimization, Tutorial, Ipopt, COIN-OR} }
Frank Hülsemann. Stabilising aggregation AMG. In Combinatorial Scientific Computing. Dagstuhl Seminar Proceedings, Volume 9061, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{hulsemann:DagSemProc.09061.17, author = {H\"{u}lsemann, Frank}, title = {{Stabilising aggregation AMG}}, booktitle = {Combinatorial Scientific Computing}, pages = {1--4}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9061}, editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.17}, URN = {urn:nbn:de:0030-drops-20946}, doi = {10.4230/DagSemProc.09061.17}, annote = {Keywords: Algebraic multigrid, aggregation, stabilisation} }
Shahadat Hossain and Trond Steihaug. The CPR Method and Beyond : Prologue. In Combinatorial Scientific Computing. Dagstuhl Seminar Proceedings, Volume 9061, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{hossain_et_al:DagSemProc.09061.18, author = {Hossain, Shahadat and Steihaug, Trond}, title = {{The CPR Method and Beyond : Prologue}}, booktitle = {Combinatorial Scientific Computing}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9061}, editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.18}, URN = {urn:nbn:de:0030-drops-20797}, doi = {10.4230/DagSemProc.09061.18}, annote = {Keywords: Structural Orthogonality, Optimal CPR, Sparse Jacobian Estimation Software} }
Assefaw H. Gebremedhin. The Enabling Power of Graph Coloring Algorithms in Automatic Differentiation and Parallel Processing. In Combinatorial Scientific Computing. Dagstuhl Seminar Proceedings, Volume 9061, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{gebremedhin:DagSemProc.09061.19, author = {Gebremedhin, Assefaw H.}, title = {{The Enabling Power of Graph Coloring Algorithms in Automatic Differentiation and Parallel Processing}}, booktitle = {Combinatorial Scientific Computing}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9061}, editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.19}, URN = {urn:nbn:de:0030-drops-20934}, doi = {10.4230/DagSemProc.09061.19}, annote = {Keywords: Graph coloring, sparse derivative computation, automatic differentiation, parallel computing} }
Ruud van der Pas. The Past, Present and Future of High Performance Computing. In Combinatorial Scientific Computing. Dagstuhl Seminar Proceedings, Volume 9061, pp. 1-7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{vanderpas:DagSemProc.09061.20, author = {van der Pas, Ruud}, title = {{The Past, Present and Future of High Performance Computing}}, booktitle = {Combinatorial Scientific Computing}, pages = {1--7}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9061}, editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.20}, URN = {urn:nbn:de:0030-drops-20836}, doi = {10.4230/DagSemProc.09061.20}, annote = {Keywords: High-Performance Scientific Computing} }
Cédric Chevalier and Ilya Safro. Weighted aggregation for multi-level graph partitioning. In Combinatorial Scientific Computing. Dagstuhl Seminar Proceedings, Volume 9061, p. 1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{chevalier_et_al:DagSemProc.09061.21, author = {Chevalier, C\'{e}dric and Safro, Ilya}, title = {{Weighted aggregation for multi-level graph partitioning}}, booktitle = {Combinatorial Scientific Computing}, pages = {1--1}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9061}, editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.21}, URN = {urn:nbn:de:0030-drops-20820}, doi = {10.4230/DagSemProc.09061.21}, annote = {Keywords: Graph partitioning, multilevel, coarsening, weighted aggregation} }
Feedback for Dagstuhl Publishing