Abstract is missing.
- WeGotYouCovered: The Winning Solver from the PACE 2019 Challenge, Vertex Cover TrackDemian Hespe, Sebastian Lamm, Christian Schulz 0003, Darren Strash. 1-11 [doi]
- A Parallel 2/3-Approximation Algorithm for Vertex-Weighted MatchingAhmed Al-Herz, Alex Pothen. 12-21 [doi]
- Checkpointing Approaches for the Computation of Adjoints Covering Resilience IssuesArne Bockhorn, Sri Hari Krishna Narayanan, Andrea Walther. 22-31 [doi]
- An Inexact Combinatorial Model for Maximizing the Number of Discovered Nonzero EntriesMohammad-Ali Rostami, H. Martin Bücker. 32-42 [doi]
- A Parallel Projection Method for Metric Constrained OptimizationCameron Ruggles, Nate Veldt, David F. Gleich. 43-53 [doi]
- Graphs with Tunable Chromatic Numbers for Parallel ColoringXin Cheng, Hemanta K. Maji, Alex Pothen. 54-64 [doi]
- Solution Attractor of Local Search System: A Method to Reduce Computational Complexity of the Traveling Salesman ProblemWeiqi Li. 65-75 [doi]
- Street-level Travel-time Estimation via Aggregated Uber DataKelsey Maass, Arun V. Sathanur, Arif Khan, Robert Rallo. 76-84 [doi]
- A Multilevel Mesh Partitioning Algorithm Driven by Memory ConstraintsCédric Chevalier, Franck Ledoux, Sébastien Morais. 85-95 [doi]
- Generalized Gains for Hybrid Vertex Separator AlgorithmsScott P. Kolodziej, Timothy A. Davis 0001. 96-105 [doi]
- Fault Tolerance with High Performance for Fast Matrix MultiplicationNoam Birnbaum, Roy Nissim, Oded Schwartz. 106-117 [doi]
- On Sparse Matrix Chain ProductsUwe Naumann. 118-127 [doi]
- Matrix symmetrization and sparse direct solversRaluca Portase, Bora Uçar. 128-137 [doi]
- Parallel GraphBLAS with OpenMPMohsen Aznaveh, Jinhao Chen, Timothy A. Davis 0001, Bálint Hegyi, Scott P. Kolodziej, Timothy G. Mattson, Gábor Szárnyas. 138-148 [doi]
- Modeling Fluid Mixing in Microfluidic GridsHuong Luu, Marek Chrobak. 149-159 [doi]