Symmetry Detection from RealWorld Images Competition 2013: Summary and Results. - Jingchen Liu; George M. Slota; Gang Zheng; Zhaohui Wu; Minwoo Park; Seungkyu Lee 001; Ingmar Rauschert; Yanxi Liu 001 (CVPR Workshops, 2013)

Fast Approximate Subgraph Counting and Enumeration. - George M. Slota; Kamesh Madduri (ICPP, 2013)

PuLP: Scalable multi-objective multi-constraint partitioning for small-world networks. - George M. Slota; Kamesh Madduri; Sivasankaran Rajamanickam (IEEE BigData, 2014)

Simple parallel biconnectivity algorithms for multicore platforms. - George M. Slota; Kamesh Madduri (HiPC, 2014)

Complex Network Analysis Using Parallel Approximate Motif Counting. - George M. Slota; Kamesh Madduri (IPDPS, 2014)

BFS and Coloring-Based Parallel Algorithms for Strongly Connected Components and Related Problems. - George M. Slota; Sivasankaran Rajamanickam; Kamesh Madduri (IPDPS, 2014)

High-Performance Graph Analytics on Manycore Processors. - George M. Slota; Sivasankaran Rajamanickam; Kamesh Madduri (IPDPS, 2015)

Parallel color-coding. - George M. Slota; Kamesh Madduri (Parallel Comput., 2015)

A Case Study of Complex Graph Analysis in Distributed Memory: Implementation and Optimization. - George M. Slota; Sivasankaran Rajamanickam; Kamesh Madduri (IPDPS, 2016)

Complex Network Partitioning Using Label Propagation. - George M. Slota; Kamesh Madduri; Sivasankaran Rajamanickam (SIAM J. Sci. Comput., 2016)

Fast Parallel Graph Triad Census and Triangle Counting on Shared-Memory Platforms. - Sindhuja Parimalarangan; George M. Slota; Kamesh Madduri (IPDPS Workshops, 2017)

Partitioning Trillion-Edge Graphs in Minutes. - George M. Slota; Sivasankaran Rajamanickam; Karen D. Devine; Kamesh Madduri (IPDPS, 2017)

Order or Shuffle: Empirically Evaluating Vertex Order Impact on Parallel Graph Computations. - George M. Slota; Sivasankaran Rajamanickam; Kamesh Madduri (IPDPS Workshops, 2017)

Distributed Graph Layout for Scalable Small-world Network Analysis. - George M. Slota; Sivasankaran Rajamanickam; Kamesh Madduri (CoRR, 2017)

Experimental Design of Work Chunking for Graph Algorithms on High Bandwidth Memory Architectures. - George M. Slota; Sivasankaran Rajamanickam (IPDPS, 2018)

A Parallel Graph Algorithm for Detecting Mesh Singularities in Distributed Memory Ice Sheet Simulations. - Ian Bogle; Karen D. Devine; Mauro Perego; Sivasankaran Rajamanickam; George M. Slota (ICPP, 2019)

Scalable generation of graphs for benchmarking HPC community-detection algorithms. - George M. Slota; Jonathan W. Berry; Simon D. Hammond; Stephen L. Olivier; Cynthia A. Phillips; Sivasankaran Rajamanickam (SC, 2019)

Parallel Generation of Simple Null Graph Models. - Jack Garbus; Christopher Brissette; George M. Slota (IPDPS Workshops, 2020)

Fast and High Quality Graph Alignment via Treelets. - Morgan Lee; George M. Slota (IPDPS Workshops, 2020)

A Parallel LFR-like Benchmark for Evaluating Community Detection Algorithms. - George M. Slota; Jack Garbus (IPDPS Workshops, 2020)

Distributed Memory Graph Coloring Algorithms for Multiple GPUs. - Ian Bogle; Erik G. Boman; Karen D. Devine; Sivasankaran Rajamanickam; George M. Slota (IA3@SC, 2020)

Scalable, Multi-Constraint, Complex-Objective Graph Partitioning. - George M. Slota; Cameron Root; Karen D. Devine; Kamesh Madduri; Sivasankaran Rajamanickam (IEEE Trans. Parallel Distributed Syst., 2020)

Limitations of Chung Lu Random Graph Generation. - Christopher Brissette; George M. Slota (COMPLEX NETWORKS, 2021)

A simple method for improving the accuracy of Chung-Lu random graph generation. - Christopher Brissette; George M. Slota (CoRR, 2021)

Partitioning Trillion-Edge Graphs. - George M. Slota; Karen D. Devine; Kamesh Madduri; Sivasankaran Rajamanickam (Massive Graph Analytics, 2022)

Multicore Algorithms for Graph Connectivity Problems. - George M. Slota; Sivasankaran Rajamanickam; Kamesh Madduri (Massive Graph Analytics, 2022)

Correcting Output Degree Sequences in Chung-Lu Random Graph Generation. - Christopher Brissette; David Liu; George M. Slota (COMPLEX NETWORKS (2), 2022)

Achieving Speedups for Distributed Graph Biconnectivity. - Ian Bogle; George M. Slota (HPEC, 2022)

Explicit Ordering Refinement for Accelerating Irregular Graph Analysis. - Michael Mandulak; Ruochen Hu; George M. Slota (HPEC, 2022)

Distributed Algorithms for the Graph Biconnectivity and Least Common Ancestor Problems. - Ian Bogle; George M. Slota (IPDPS Workshops, 2022)

Parallel coarsening of graph data with spectral guarantees. - Christopher Brissette; Andy Huang; George M. Slota (CoRR, 2022)

Parallel graph coloring algorithms for distributed GPU environments. - Ian Bogle; George M. Slota; Erik G. Boman; Karen D. Devine; Sivasankaran Rajamanickam (Parallel Comput., 2022)

Effects of Null Model Choice on Modularity Maximization. - Christopher Brissette; Ujwal Pandey; George M. Slota (COMPLEX NETWORKS (2), 2023)

Spectrum Consistent Coarsening Approximates Edge Weights. - Christopher Brissette; Andy Huang; George M. Slota (SIAM J. Matrix Anal. Appl., 2023)

On the Robustness of Graph Reduction Against GNN Backdoor. - Yuxuan Zhu; Michael Mandulak; Kerui Wu; George M. Slota; Yuseok Jeon; Ka-Ho Chow; Lei Yu 002 (AISec@CCS, 2024)

Constant-Memory Graph Coarsening. - George M. Slota; Christopher Brissette (HPEC, 2024)

Efficient Weighted Graph Matching on GPUs. - Michael Mandulak; Sayan Ghosh; S. M. Ferdous; Mahantesh Halappanavar; George M. Slota (SC, 2024)

Compressed Decentralized Momentum Stochastic Gradient Methods for Nonconvex Optimization. - Wei Liu; Anweshit Panda; Ujwal Pandey; Christopher Brissette; Yikang Shen; George M. Slota; Naigang Wang; Jie Chen; Yangyang Xu (Trans. Mach. Learn. Res., 2025)

ApproxJoin: Approximate Matching for Efficient Verification in Fuzzy Set Similarity Join. - Michael Mandulak; S. M. Ferdous; Sayan Ghosh; Mahantesh Halappanavar; George M. Slota (CoRR, 2025)