A generalized eigensolver based on smoothed aggregation (GES-SA) for initializing smoothed aggregation (SA) multigrid. - Marian Brezina; Thomas A. Manteuffel; Stephen F. McCormick; John W. Ruge; Geoffrey Sanders; Panayot S. Vassilevski (Numer. Linear Algebra Appl., 2008)

Multilevel Space-Time Aggregation for Bright Field Cell Microscopy Segmentation and Tracking. - Tiffany Inglis; Hans De Sterck; Geoffrey Sanders; Haig Djambazian; Robert Sladek; Saravanan Sundararajan; Thomas J. Hudson (Int. J. Biomed. Imaging, 2010)

Further results on error estimators for local refinement with first-order system least squares (FOSLS). - Thomas A. Manteuffel; Steve F. McCormick; Joshua Nolting; John W. Ruge; Geoffrey Sanders (Numer. Linear Algebra Appl., 2010)

Nested Iteration and First-Order System Least Squares for Incompressible, Resistive Magnetohydrodynamics. - J. H. Adler; Thomas A. Manteuffel; Stephen F. McCormick; John W. Ruge; Geoffrey D. Sanders (SIAM J. Sci. Comput., 2010)

Towards Adaptive Smoothed Aggregation (AlphaSA) for Nonsymmetric Problems. - Marian Brezina; Thomas A. Manteuffel; Stephen F. McCormick; John W. Ruge; Geoffrey Sanders (SIAM J. Sci. Comput., 2010)

Smoothed Aggregation Multigrid for Markov Chains. - Hans De Sterck; Thomas A. Manteuffel; Stephen F. McCormick; Killian Miller; J. Pearson; John W. Ruge; Geoffrey Sanders (SIAM J. Sci. Comput., 2010)

Algebraic Multigrid for Markov Chains. - Hans De Sterck; Thomas A. Manteuffel; Stephen F. McCormick; Killian Miller; John W. Ruge; Geoffrey Sanders (SIAM J. Sci. Comput., 2010)

Recursively Accelerated Multilevel Aggregation for Markov Chains. - Hans De Sterck; Killian Miller; Geoffrey Sanders; Manda Winlaw (SIAM J. Sci. Comput., 2010)

Top-level acceleration of adaptive algebraic multilevel methods for steady-state solution to Markov chains. - Hans De Sterck; Killian Miller; Thomas A. Manteuffel; Geoffrey Sanders (Adv. Comput. Math., 2011)

Multilevel Aggregation Methods for Small-World Graphs with Application to Random-Walk Ranking. - Hans De Sterck; Van Emden Henson; Geoffrey Sanders (Comput. Informatics, 2011)

Iterant recombination with one-norm minimization for multilevel Markov chain algorithms via the ellipsoid method. - Hans De Sterck; Killian Miller; Geoffrey Sanders (Comput. Vis. Sci., 2011)

Detecting highly cyclic structure with complex eigenpairs. - Christine Klymko; Geoffrey Sanders (CoRR, 2016)

Towards Practical and Robust Labeled Pattern Matching in Trillion-Edge Graphs. - Tahsin Reza; Christine Klymko; Matei Ripeanu; Geoffrey Sanders; Roger A. Pearce (CLUSTER, 2017)

An ensemble framework for detecting community changes in dynamic networks. - Timothy La Fond; Geoffrey Sanders; Christine Klymko; Van Emden Henson (HPEC, 2017)

Graph Ranking Guarantees for Numerical Approximations to Katz Centrality. - Eisha Nathan; Geoffrey Sanders; James P. Fairbanks; Van Emden Henson; David A. Bader (ICCS, 2017)

Spectral partitioning with blends of eigenvectors. - James P. Fairbanks; David A. Bader; Geoffrey D. Sanders (J. Complex Networks, 2017)

Numerical Methods for Gremban's Expansion of Signed Graphs. - Alyson Fox; Thomas A. Manteuffel; Geoffrey Sanders (SIAM J. Sci. Comput., 2017)

Computing Exact Vertex Eccentricity on Massive-Scale Distributed Graphs. - Keita Iwabuchi; Geoffrey Sanders; Keith Henderson; Roger Pearce (CLUSTER, 2018)

Investigation of Spectral Clustering for Signed Graph Matrix Representations. - Alyson Fox; Geoffrey Sanders; Andrew Knyazev (HPEC, 2018)

K-truss decomposition for Scale-Free Graphs at Scale in Distributed Memory. - Roger Pearce; Geoffrey Sanders (HPEC, 2018)

Estimating Edge-Local Triangle Count Heavy Hitters in Edge-Linear Time and Almost-Vertex-Linear Space. - Benjamin W. Priest; Roger Pearce; Geoffrey Sanders (HPEC, 2018)

Design, Generation, and Validation of Extreme Scale Power-Law Graphs. - Jeremy Kepner; Siddharth Samsi; William Arcand; David Bestor; Bill Bergeron; Tim Davis 001; Vijay Gadepally; Michael Houle 001; Matthew Hubbell; Hayden Jananthan; Michael Jones 001; Anna Klein; et al. (IPDPS Workshops, 2018)

On Large-Scale Graph Generation with Validation of Diverse Triangle Statistics at Edges and Vertices. - Geoffrey Sanders; Roger Pearce; Timothy La Fond; Jeremy Kepner (IPDPS Workshops, 2018)

PruneJuice: pruning trillion-edge graphs to a precise pattern-matching solution. - Tahsin Reza; Matei Ripeanu; Nicolas Tripoul; Geoffrey Sanders; Roger Pearce (SC, 2018)

There are Trillions of Little Forks in the Road. Choose Wisely! - Estimating the Cost and Likelihood of Success of Constrained Walks to Optimize a Graph Pruning Pipeline. - Nicolas Tripoul; Hassan Halawa; Tahsin Reza; Geoffrey Sanders; Roger Pearce; Matei Ripeanu (IA3@SC, 2018)

Numerically approximating centrality for graph ranking guarantees. - Eisha Nathan; Geoffrey Sanders; Van Emden Henson; David A. Bader (J. Comput. Sci., 2018)

One Quadrillion Triangles Queried on One Million Processors. - Roger Pearce; Trevor Steil; Benjamin W. Priest; Geoffrey Sanders (HPEC, 2019)

Personalized Ranking in Dynamic Graphs Using Nonbacktracking Walks. - Eisha Nathan; Geoffrey Sanders; Van Emden Henson (ICCS (2), 2019)

You've Got Mail (YGM): Building Missing Asynchronous Communication Primitives. - Benjamin Priest; Trevor Steil; Geoffrey Sanders; Roger Pearce (IPDPS Workshops, 2019)

Distributed Kronecker Graph Generation with Ground Truth of Many Graph Properties. - Trevor Steil; Benjamin W. Priest; Geoffrey Sanders; Roger Pearce; Timothy La Fond; Keita Iwabuchi (IPDPS Workshops, 2019)

Mixed-Precision analysis of Householder QR Algorithms. - Lucia Minah Yang; Alyson Fox; Geoffrey Sanders (CoRR, 2019)

Error Analysis of ZFP Compression for Floating-Point Data. - James Diffenderfer; Alyson Fox; Jeffrey A. F. Hittinger; Geoffrey Sanders; Peter G. Lindstrom (SIAM J. Sci. Comput., 2019)

Scaling Graph Clustering with Distributed Sketches. - Benjamin W. Priest; Alec Michael Dunton; Geoffrey Sanders (HPEC, 2020)

Kronecker Graph Generation with Ground Truth for 4-Cycles and Dense Structure in Bipartite Graphs. - Trevor Steil; Scott McMillan; Geoffrey Sanders; Roger Pearce; Benjamin Priest (IPDPS Workshops, 2020)

Labeled Triangle Indexing for Efficiency Gains in Distributed Interactive Subgraph Search††This work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under Contract DE-AC52-07NA27344 (LLNL-CONF-814976). Experiments were performed at the Livermore Computing facility. - Tahsin Reza; Matei Ripeanu; Geoffrey Sanders; Roger Pearce (IA3@SC, 2020)

Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees. - Tahsin Reza; Matei Ripeanu; Geoffrey Sanders; Roger Pearce (SIGMOD Conference, 2020)

Towards Interactive Pattern Search in Massive Graphs. - Tahsin Reza; Matei Ripeanu; Geoffrey Sanders; Roger Pearce (GRADES-NDA@SIGMOD, 2020)

Stability Analysis of Inline ZFP Compression for Floating-Point Data in Iterative Methods. - Alyson Fox; James Diffenderfer; Jeffrey Hittinger; Geoffrey Sanders; Peter Lindstrom 001 (SIAM J. Sci. Comput., 2020)

Towards Distributed Square Counting in Large Graphs. - Trevor Steil; Geoffrey Sanders; Roger Pearce (HPEC, 2021)

Identifying Coherent Subgraphs In Dynamic Brain Networks. - Vikram Ravindra; Geoffrey Sanders; Ananth Grama (ICIP, 2021)

TriPoll: computing surveys of triangles in massive-scale temporal graphs with metadata. - Trevor Steil; Tahsin Reza; Keita Iwabuchi; Benjamin W. Priest; Geoffrey Sanders; Roger Pearce (SC, 2021)

Rounding Error Analysis of Mixed Precision Block Householder QR Algorithms. - Lucia Minah Yang; Alyson Fox; Geoffrey Sanders (SIAM J. Sci. Comput., 2021)

Scalable Pattern Matching in Metadata Graphs via Constraint Checking. - Tahsin Reza; Hassan Halawa; Matei Ripeanu; Geoffrey Sanders; Roger A. Pearce (ACM Trans. Parallel Comput., 2021)

Massive-Scale Distributed Triangle Computation and Applications. - Geoffrey Sanders; Roger Pearce; Benjamin W. Priest; Trevor Steil (Massive Graph Analytics, 2022)

Towards Distributed 2-Approximation Steiner Minimal Trees in Billion-edge Graphs. - Tahsin Reza; Geoffrey Sanders; Roger Pearce (IPDPS, 2022)

Efficient Algebraic Multigrid Methods for Multilevel Overlapping Coclustering of User-Item Relationships. - Haifeng Xu; Rasha F. Kashef; Hans De Sterck; Geoffrey Sanders (INFORMS J. Comput., 2022)

Towards A Massive-scale Distributed Neighborhood Graph Construction. - Keita Iwabuchi; Trevor Steil; Benjamin Priest; Roger Pearce; Geoffrey Sanders (SC Workshops, 2023)

Distributed approximate minimal Steiner trees with millions of seed vertices on billion-edge graphs. - Tahsin Reza; Trevor Steil; Geoffrey Sanders; Roger Pearce (J. Parallel Distributed Comput., 2023)

NEO-DNND: Communication-Optimized Distributed Nearest Neighbor Graph Construction. - Keita Iwabuchi; Trevor Steil; Benjamin W. Priest; Roger Pearce; Geoffrey Sanders (SC Workshops, 2024)

Scalable edge clustering of dynamic graphs via weighted line graphs. - Michael Ostroski; Geoffrey Sanders; Trevor Steil; Roger Pearce (J. Complex Networks, 2025)

Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees. - Nate Veldt; Thomas Stanley; Benjamin W. Priest; Trevor Steil; Keita Iwabuchi; T. S. Jayram; Geoffrey Sanders (CoRR, 2025)