| Counting Subgraphs in Degenerate Graphs | 0 | 0.34 | 2022 |
| Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling | 0 | 0.34 | 2022 |
| Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles | 0 | 0.34 | 2021 |
| Efficiently Counting Vertex Orbits of All 5-vertex Subgraphs, by EVOKE. | 0 | 0.34 | 2020 |
| Faster sublinear approximation of the number of k-cliques in low-arboricity graphs. | 0 | 0.34 | 2020 |
| The Power of Pivoting for Exact Clique Counting. | 0 | 0.34 | 2020 |
| Domain Reduction for Monotonicity Testing - A o(d) Tester for Boolean Functions in d-Dimensions. | 0 | 0.34 | 2020 |
| The Impossibility Of Low-Rank Representations For Triangle-Rich Complex Networks | 0 | 0.34 | 2020 |
| How to Count Triangles, without Seeing the Whole Graph | 2 | 0.37 | 2020 |
| Provably and Efficiently Approximating Near-cliques using the Turán Shadow: PEANUTS | 0 | 0.34 | 2020 |
| How the Degeneracy Helps for Triangle Counting in Graph Streams | 1 | 0.34 | 2020 |
| Random walks and forbidden minors II: A poly(dε)-query tester for minor-closed properties of bounded-degree graphs. | 0 | 0.34 | 2019 |
| Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection | 2 | 0.39 | 2019 |
| Local Algorithms for Hierarchical Dense Subgraph Discovery. | 0 | 0.34 | 2019 |
| andom walks and forbidden minors II: A $\poly(d\eps^{-1})$-query tester for minor-closed properties of bounded degree graphs. | 0 | 0.34 | 2019 |
| Random walks and forbidden minors II: a poly( d ε -1 )-query tester for minor-closed properties of bounded degree graphs | 0 | 0.34 | 2019 |
| FINDING CLIQUES IN SOCIAL NETWORKS: A NEW DISTRIBUTION-FREE MODEL | 1 | 0.36 | 2018 |
| Adaptive Boolean Monotonicity Testing in Total Influence Time. | 0 | 0.34 | 2018 |
| Domain Reduction for Monotonicity Testing: A o(d) Tester for Boolean Functions on Hypergrids. | 0 | 0.34 | 2018 |
| Faster sublinear approximations of k-cliques for low arboricity graphs. | 0 | 0.34 | 2018 |
| Local algorithms for hierarchical dense subgraph discovery | 2 | 0.35 | 2018 |
| Finding Forbidden Minors in Sublinear Time: A n^1/2+o(1)-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs | 0 | 0.34 | 2018 |
| A o(d) · polylog n Monotonicity Tester for Boolean Functions over the Hypergrid [n]d. | 0 | 0.34 | 2018 |
| ON APPROXIMATING THE NUMBER OF k-CLIQUES IN SUBLINEAR TIME | 0 | 0.34 | 2017 |
| A $o(d) \cdot \text{polylog}~n$ Monotonicity Tester for Boolean Functions over the Hypergrid $[n]^d$. | 0 | 0.34 | 2017 |
| Nucleus Decompositions for Identifying Hierarchy of Dense Subgraphs. | 1 | 0.34 | 2017 |
| Provable and practical approximations for the degree distribution using sublinear graph samples | 3 | 0.38 | 2017 |
| Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy Connection. | 7 | 0.48 | 2017 |
| Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps | 3 | 0.45 | 2017 |
| Accurate and Nearly Optimal Sublinear Approximations to Ulam Distance. | 1 | 0.36 | 2017 |
| A Lower Bound for Nonadaptive, One-Sided Error Testing of Unateness of Boolean Functions over the Hypercube. | 1 | 0.36 | 2017 |
| When Hashes Met Wedges: A Distributed Algorithm for Finding High Similarity Vectors. | 4 | 0.40 | 2017 |
| ESCAPE: Efficiently Counting All 5-Vertex Subgraphs. | 13 | 0.55 | 2017 |
| A Fast and Provable Method for Estimating Clique Counts Using Turán's Theorem. | 7 | 0.42 | 2017 |
| Parallel Local Algorithms for Core, Truss, and Nucleus Decompositions. | 4 | 0.42 | 2017 |
| A Õ(n) Non-Adaptive Tester for Unateness. | 1 | 0.35 | 2016 |
| Avoiding the Global Sort: A Faster Contour Tree Algorithm | 2 | 0.37 | 2016 |
| A $\widetilde{O}(n)$ Non-Adaptive Tester for Unateness. | 1 | 0.36 | 2016 |
| Counting Triangles In Real-World Graph Streams: Dealing With Repeated Edges And Time Windows | 1 | 0.35 | 2015 |
| A Space-Efficient Streaming Algorithm for Estimating Transitivity and Triangle Counts Using the Birthday Paradox | 20 | 0.76 | 2015 |
| Trigger detection for adaptive scientific workflows using percentile sampling | 2 | 0.43 | 2015 |
| Diamond Sampling for Approximate Maximum All-Pairs Dot-Product (MAD) Search | 10 | 0.53 | 2015 |
| Approximately Counting Triangles in Sublinear Time. | 28 | 0.95 | 2015 |
| Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts. | 30 | 0.99 | 2014 |
| FAST-PPR: Scaling Personalized PageRank Estimation for Large Graphs. | 42 | 1.18 | 2014 |
| Is submodularity testable? | 3 | 0.46 | 2014 |
| Property testing on product distributions: optimal testers for bounded derivative properties | 2 | 0.40 | 2014 |
| Decompositions of triangle-dense graphs | 5 | 0.51 | 2014 |
| Characterizing short-term stability for Boolean networks over any distribution of transfer functions. | 0 | 0.34 | 2014 |
| Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions. | 28 | 0.79 | 2014 |
