Andrew Stolman

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 18

Top Topics

Graph Theoretic

Complex Networks

Query Evaluation

Graph Properties

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Chang Liu, Loc Hoang, Andrew Stolman, Bo Wu
HiTA: A RAG-Based Educational Platform that Centers Educators in the Instructional Loop. AIED (2) (2024)
Akash Kumar, C. Seshadhri, Andrew Stolman
Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs. SIAM J. Comput. 52 (6) (2023)
Andrew Stolman, Caleb Levy, C. Seshadhri, Aneesh Sharma
Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling. CoRR (2022)
Andrew Stolman, Caleb Levy, C. Seshadhri, Aneesh Sharma
Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling. SDM (2022)
Akash Kumar, C. Seshadhri, Andrew Stolman
Random walks and forbidden minors III: $\text{poly}\left(d\varepsilon ^{-1}\right)$-time partition oracles for minor-free graph classes. FOCS (2022)
Akash Kumar, C. Seshadhri, Andrew Stolman
Random walks and forbidden minors III: poly(d/?)-time partition oracles for minor-free graph classes. Electron. Colloquium Comput. Complex. 28 (2021)
Akash Kumar, C. Seshadhri, Andrew Stolman
Random walks and forbidden minors III: $\text{poly}\left(d\varepsilon ^{-1}\right)$-time partition oracles for minor-free graph classes. FOCS (2021)
Akash Kumar, C. Seshadhri, Andrew Stolman
Random walks and forbidden minors III: poly(d/ε)-time partition oracles for minor-free graph classes. CoRR (2021)
C. Seshadhri, Aneesh Sharma, Andrew Stolman, Ashish Goel
The impossibility of low-rank representations for triangle-rich complex networks. Proc. Natl. Acad. Sci. USA 117 (11) (2020)
C. Seshadhri, Aneesh Sharma, Andrew Stolman, Ashish Goel
The impossibility of low rank representations for triangle-rich complex networks. CoRR (2020)
Akash Kumar, C. Seshadhri, Andrew Stolman
andom walks and forbidden minors II: A $\poly(d\eps^{-1})$-query tester for minor-closed properties of bounded degree graphs. Electron. Colloquium Comput. Complex. 26 (2019)
Akash Kumar, C. Seshadhri, Andrew Stolman
)-query tester for minor-closed properties of bounded degree graphs. STOC (2019)
Akash Kumar, C. Seshadhri, Andrew Stolman
)-query tester for minor-closed properties of bounded-degree graphs. CoRR (2019)
Akash Kumar, C. Seshadhri, Andrew Stolman
-query one-sided tester for minor closed properties on bounded degree graphs. Electron. Colloquium Comput. Complex. 25 (2018)
Akash Kumar, C. Seshadhri, Andrew Stolman
Finding Forbidden Minors in Sublinear Time: A n^1/2+o(1)-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs. FOCS (2018)
Akash Kumar, C. Seshadhri, Andrew Stolman
)-query one-sided tester for minor closed properties on bounded degree graphs. Electron. Colloquium Comput. Complex. 25 (2018)
Akash Kumar, C. Seshadhri, Andrew Stolman
)-query one-sided tester for minor closed properties on bounded degree graphs. CoRR (2018)
Andrew Stolman, Kevin Matulef
HyperHeadTail: a Streaming Algorithm for Estimating the Degree Distribution of Dynamic Multigraphs. ASONAM (2017)