Author of the publication

Vertex neighborhoods, low conductance cuts, and good seeds for local community methods.

, and . KDD, page 597-605. ACM, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Self-improving algorithms for coordinate-wise maxima., , and . SCG, page 277-286. ACM, (2012)From the Birthday Paradox to a Practical Sublinear Space Streaming Algorithm for Triangle Counting, , and . CoRR, (2012)A Scalable Generative Graph Model with Community Structure, , , and . CoRR, (2013)FPT Algorithms for Finding Near-Cliques in c-Closed Graphs., , , , and . ITCS, volume 215 of LIPIcs, page 17:1-17:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Accurate and Nearly Optimal Sublinear Approximations to Ulam Distance., , and . SODA, page 2012-2031. SIAM, (2017)Self-improving Algorithms for Convex Hulls., , and . SODA, page 1546-1565. SIAM, (2010)Provable and Practical Approximations for the Degree Distribution using Sublinear Graph Samples., , , , and . WWW, page 449-458. ACM, (2018)Provably and Efficiently Approximating Near-cliques using the Turán Shadow: PEANUTS., and . WWW, page 1966-1976. ACM / IW3C2, (2020)Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an Õ(n√d) Monotonicity Tester., , and . STOC, page 233-241. ACM, (2023)On approximating the number of k-cliques in sublinear time., , and . STOC, page 722-734. ACM, (2018)