A
Asaf Shapira
Researcher at Tel Aviv University
Publications - 167
Citations - 3633
Asaf Shapira is an academic researcher from Tel Aviv University. The author has contributed to research in topics: Graph property & Complement graph. The author has an hindex of 29, co-authored 159 publications receiving 3384 citations. Previous affiliations of Asaf Shapira include Microsoft & Georgia Institute of Technology.
Papers
More filters
Journal Article
Finding Cycles and Trees in Sublinear Time.
TL;DR: This work presents sublinear‐time (randomized) algorithms for finding simple cycles of length at least k≥3 and tree‐minors in bounded‐degree graphs and shows that this time complexity is optimal up to polylogarithmic factors.
Posted Content
Finding Cycles and Trees in Sublinear Time
TL;DR: In this paper, the authors studied the complexity of one-sided error property testing in the bounded-degree graph model and showed that the complexity is optimal up to polylogarithmic factors.
Proceedings ArticleDOI
Decomposing a graph into expanding subgraphs
Guy Moshkovitz,Asaf Shapira +1 more
TL;DR: The results imply that the eigenspace enumeration approach of Arora-Barak-Steurer cannot give (even quasi-) polynomial time algorithms for unique games.
Book ChapterDOI
Can a graph have distinct regular partitions
Noga Alon,Asaf Shapira,Uri Stav +2 more
TL;DR: It turns out that for the standard notion of a regular partition, one can construct a graph that has very distinct regular partitions, and all such regular partitions of the same graph must be very "similar".
Testing Graphs against an Unknown Distribution.
Lior Gishboliner,Asaf Shapira +1 more
TL;DR: In this article, the authors give a characterization of the properties that are testable in the VDF model, and show that a property P is testable if and only ifP is hereditary and extendable.