Abstract is missing.
- Estimating Current-Flow Closeness Centrality with a Multigrid Laplacian SolverElisabetta Bergamini, Michael Wegner, Dimitar Lukarski, Henning Meyerhenke. 1-12 [doi]
- A Hybrid Multithreaded Direct Sparse Triangular SolverAndrew M. Bradley. 13-22 [doi]
- Enabling Implicit Time Integration for Compressible Flows by Partial Coloring: A Case Study of a Semi-matrix-free Preconditioning TechniqueH. Martin Bücker, Michael Lülfesmann, M. Ali Rostami. 23-32 [doi]
- An Empirical Study of Cycle Toggling Based Laplacian SolversKevin Deweese, John R. Gilbert, Gary L. Miller, Richard Peng, Hao Ran Xu, Shen Chen Xu. 33-41 [doi]
- Graph Partitioning Methods for Fast Parallel Quantum Molecular DynamicsHristo N. Djidjev, Georg Hahn, Susan M. Mniszewski, Christian F. A. Negre, Anders M. N. Niklasson, Vivek B. Sardeshmukh. 42-51 [doi]
- b-Edge Cover ProblemArif M. Khan, Alex Pothen. 52-61 [doi]
- Using Tropical Optimization Techniques to Evaluate Alternatives via Pairwise ComparisonsNikolai Krivulin. 62-72 [doi]
- Coordinated Platoon Routing in a Metropolitan NetworkJeffrey Larson, Todd S. Munson, Vadim Sokolov. 73-82 [doi]
- Mixed Integer Programming for Call Tree ReversalJohannes Lotz 0001, Uwe Naumann, Sumit Mitra. 83-91 [doi]
- On Stable Marriages and Greedy MatchingsFredrik Manne, Md. Naim, Håkon Lerring, Mahantesh Halappanavar. 92-101 [doi]
- Edge Pushing is Equivalent to Vertex Elimination for Computing HessiansMu Wang, Alex Pothen, Paul D. Hovland. 102-111 [doi]