HyperHeadTail: a Streaming Algorithm for Estimating the Degree Distribution of Dynamic Multigraphs. - Andrew Stolman; Kevin Matulef (ASONAM, 2017)

Finding Forbidden Minors in Sublinear Time: A n^1/2+o(1)-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs. - Akash Kumar 003; C. Seshadhri 001; Andrew Stolman (FOCS, 2018)

Fiding forbidden minors in sublinear time: a O(n1/2 + o(1))-query one-sided tester for minor closed properties on bounded degree graphs. - Akash Kumar 003; C. Seshadhri 001; Andrew Stolman (CoRR, 2018)

Finding forbidden minors in sublinear time: a n1/2+o(1)-query one-sided tester for minor closed properties on bounded degree graphs. - Akash Kumar 003; C. Seshadhri 001; Andrew Stolman (Electron. Colloquium Comput. Complex., 2018)

Finding forbidden minors in sublinear time: a O(n1/2+o(1))-query one-sided tester for minor closed properties on bounded degree graphs. - Akash Kumar 003; C. Seshadhri 001; Andrew Stolman (Electron. Colloquium Comput. Complex., 2018)

Random walks and forbidden minors II: a poly(d ε-1)-query tester for minor-closed properties of bounded degree graphs. - Akash Kumar 003; C. Seshadhri 001; Andrew Stolman (STOC, 2019)

Random walks and forbidden minors II: A poly(dε-1)-query tester for minor-closed properties of bounded-degree graphs. - Akash Kumar 003; C. Seshadhri 001; Andrew Stolman (CoRR, 2019)

andom walks and forbidden minors II: A poly(dε-1)$-query tester for minor-closed properties of bounded degree graphs. - Akash Kumar 003; C. Seshadhri 001; Andrew Stolman (Electron. Colloquium Comput. Complex., 2019)

Random Walks and Forbidden Minors II: A $ mathrm{poly}(d varepsilon^{-1})$-Query Tester for Minor-Closed Properties of Bounded-Degree Graphs. - Akash Kumar 003; C. Seshadhri 001; Andrew Stolman (SIAM J. Comput., 2019)

The impossibility of low-rank representations for triangle-rich complex networks. - C. Seshadhri 001; Aneesh Sharma; Andrew Stolman; Ashish Goel (Proc. Natl. Acad. Sci. USA, 2020)

Random walks and forbidden minors III: $ text{poly} left(d varepsilon ^{-1} right)$-time partition oracles for minor-free graph classes. - Akash Kumar 003; C. Seshadhri 001; Andrew Stolman (FOCS, 2021)

Random walks and forbidden minors III: poly(d/ε)-time partition oracles for minor-free graph classes. - Akash Kumar 003; C. Seshadhri 001; Andrew Stolman (CoRR, 2021)

Random walks and forbidden minors III: poly(d/?)-time partition oracles for minor-free graph classes. - Akash Kumar 003; C. Seshadhri 001; Andrew Stolman (Electron. Colloquium Comput. Complex., 2021)

Big Data & Spectral Graph Theory. - Andrew Stolman (2021)

Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling. - Andrew Stolman; Caleb C. Levy; C. Seshadhri 001; Aneesh Sharma (SDM, 2022)

Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs. - Akash Kumar 003; C. Seshadhri 001; Andrew Stolman (SIAM J. Comput., 2023)

HiTA: A RAG-Based Educational Platform that Centers Educators in the Instructional Loop. - Chang Liu 122; Loc Hoang; Andrew Stolman; Bo Wu 002 (AIED (2), 2024)

Understanding Student Engagement with Large Language Model-Powered Course Assistants. - Chang Liu 122; Loc Hoang; Andrew Stolman; René F. Kizilcec; Bo Wu 002 (AIED (6), 2025)