A cloud-based approach to big graphs. - Paul Burkhardt; Christopher A. Waring (HPEC, 2015)

Graphing trillions of triangles. - Paul Burkhardt (Inf. Vis., 2017)

Bounds and algorithms for k-truss. - Paul Burkhardt; Vance Faber; David G. Harris 001 (CoRR, 2018)

Graph connectivity in log-diameter steps using label propagation. - Paul Burkhardt (CoRR, 2018)

A Linear Time Algorithm for Finding Minimum Spanning Tree Replacement Edges. - David A. Bader; Paul Burkhardt (CoRR, 2019)

Bounds and algorithms for graph trusses. - Paul Burkhardt; Vance Faber; David G. Harris 001 (J. Graph Algorithms Appl., 2020)

Graph Connectivity in Log Steps Using Label Propagation. - Paul Burkhardt (Parallel Process. Lett., 2021)

Optimal Algebraic Breadth-First Search for Sparse Graphs. - Paul Burkhardt (ACM Trans. Knowl. Discov. Data, 2021)

A Cloud-Based Approach to Big Graphs. - Paul Burkhardt; Christopher A. Waring (Massive Graph Analytics, 2022)

A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges. - David A. Bader; Paul Burkhardt (J. Graph Algorithms Appl., 2022)

Simple and efficient four-cycle counting on sparse graphs. - Paul Burkhardt; David G. Harris 001 (CoRR, 2023)

Triangle Centrality. - Paul Burkhardt (ACM Trans. Knowl. Discov. Data, 2024)