Testing satisfiability. - Noga Alon; Asaf Shapira (J. Algorithms, 2003)

Testing subgraphs in directed graphs. - Noga Alon; Asaf Shapira (J. Comput. Syst. Sci., 2004)

Additive Approximation for Edge-Deletion Problems. - Noga Alon; Asaf Shapira; Benny Sudakov (FOCS, 2005)

Homomorphisms in Graph Property Testing - A Survey - Asaf Shapira; Noga Alon (Electron. Colloquium Comput. Complex., 2005)

Linear Equations, Arithmetic Progressions and Hypergraph Property Testing. - Noga Alon; Asaf Shapira (Theory Comput., 2005)

Additive Approximation for Edge-Deletion Problems (Abstract). - Noga Alon; Asaf Shapira; Benny Sudakov (ICALP (1), 2006)

On An Extremal Hypergraph Problem Of Brown, Erdös And Sós. - Noga Alon; Asaf Shapira (Comb., 2006)

A Characterization of Easily Testable Induced Subgraphs. - Noga Alon; Asaf Shapira (Comb. Probab. Comput., 2006)

An Elementary Construction of Constant-Degree Expanders. - Noga Alon; Oded Schwartz; Asaf Shapira (Electron. Colloquium Comput. Complex., 2006)

Graph propert testing and related problems - Asaf Shapira (2006)

Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs. - Artur Czumaj; Asaf Shapira; Christian Sohler (Electron. Colloquium Comput. Complex., 2007)

Testing the Expansion of a Graph. - Asaf Nachmias; Asaf Shapira (Electron. Colloquium Comput. Complex., 2007)

Space Complexity Vs. Query Complexity. - Oded Lachish; Ilan Newman; Asaf Shapira (Comput. Complex., 2008)

A separation theorem in property testing. - Noga Alon; Asaf Shapira (Comb., 2008)

Quasi-randomness and the distribution of copies of a fixed graph. - Asaf Shapira (Comb., 2008)

Every Minor-Closed Property of Sparse Graphs is Testable. - Itai Benjamini; Oded Schramm; Asaf Shapira (Electron. Colloquium Comput. Complex., 2008)

A Characterization of the (Natural) Graph Properties Testable with One-Sided Error. - Noga Alon; Asaf Shapira (SIAM J. Comput., 2008)

Every Monotone Graph Property Is Testable. - Noga Alon; Asaf Shapira (SIAM J. Comput., 2008)

Green's conjecture and testing linear-invariant properties. - Asaf Shapira (STOC, 2009)

Multigraphs (Only) Satisfy a Weak Triangle Removal Lemma. - Asaf Shapira; Raphael Yuster (Electron. J. Comb., 2009)

A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity. - Noga Alon; Eldar Fischer; Ilan Newman; Asaf Shapira (SIAM J. Comput., 2009)

Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs. - Artur Czumaj; Asaf Shapira; Christian Sohler (SIAM J. Comput., 2009)

Can a Graph Have Distinct Regular Partitions? - Noga Alon; Asaf Shapira; Uri Stav (SIAM J. Discret. Math., 2009)

Green's Conjecture and Testing Linear Invariant Properties. - Asaf Shapira (Property Testing, 2010)

A Unified Framework for Testing Linear-Invariant Properties. - Arnab Bhattacharyya 001; Elena Grigorescu; Asaf Shapira (Electron. Colloquium Comput. Complex., 2010)

On the density of a graph and its blowup. - Asaf Shapira; Raphael Yuster (J. Comb. Theory B, 2010)

The effect of induced subgraphs on quasi-randomness. - Asaf Shapira; Raphael Yuster (Random Struct. Algorithms, 2010)

Approximate Hypergraph Partitioning and Applications. - Eldar Fischer; Arie Matsliah; Asaf Shapira (SIAM J. Comput., 2010)

Randomized greedy: new variants of some classic approximation algorithms. - Kevin P. Costello; Asaf Shapira; Prasad Tetali (SODA, 2011)

All-Pairs Bottleneck Paths in Vertex Weighted Graphs. - Asaf Shapira; Raphael Yuster; Uri Zwick (Algorithmica, 2011)

Testing Odd-Cycle-Freeness in Boolean Functions. - Arnab Bhattacharyya 001; Elena Grigorescu; Prasad Raghavendra; Asaf Shapira (Electron. Colloquium Comput. Complex., 2011)

Sublinear Time Algorithms. - Ronitt Rubinfeld; Asaf Shapira (Electron. Colloquium Comput. Complex., 2011)

A note on maximizing the spread of influence in social networks. - Eyal Even-Dar; Asaf Shapira (Inf. Process. Lett., 2011)

All-pairs shortest paths with a sublinear additive error. - Liam Roditty; Asaf Shapira (ACM Trans. Algorithms, 2011)

A Note on the Balanced ST-Connectivity - Shiva Kintali; Asaf Shapira (CoRR, 2012)

Finding Cycles and Trees in Sublinear Time. - Artur Czumaj; Oded Goldreich 001; Dana Ron; C. Seshadhri 001; Asaf Shapira; Christian Sohler (Electron. Colloquium Comput. Complex., 2012)

The quasi-randomness of hypergraph cut properties. - Asaf Shapira; Raphael Yuster (Random Struct. Algorithms, 2012)

A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma. - Domingos Dellamonica Jr.; Subrahmanyam Kalyanasundaram; Daniel M. Martin; Vojtech Rödl; Asaf Shapira (SIAM J. Discret. Math., 2012)

Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs. - Hao Huang 005; Jie Ma; Asaf Shapira; Benny Sudakov; Raphael Yuster (Comb. Probab. Comput., 2013)

Deterministic vs Non-deterministic Graph Property Testing. - Lior Gishboliner; Asaf Shapira (Electron. Colloquium Comput. Complex., 2013)

A Note on Even Cycles and Quasirandom Tournaments. - Subrahmanyam Kalyanasundaram; Asaf Shapira (J. Graph Theory, 2013)

Forcing $k$-repetitions in Degree Sequences. - Yair Caro; Asaf Shapira; Raphael Yuster (Electron. J. Comb., 2014)

Small complete minors above the extremal edge density. - Asaf Shapira; Benny Sudakov (Comb., 2015)

An Optimal Algorithm for Finding Frieze-Kannan Regular Partitions. - Domingos Dellamonica Jr.; Subrahmanyam Kalyanasundaram; Daniel M. Martin; Vojtech Rödl; Asaf Shapira (Comb. Probab. Comput., 2015)

Constructing Near Spanning Trees with Few Local Inspections. - Reut Levi; Guy Moshkovitz; Dana Ron; Ronitt Rubinfeld; Asaf Shapira (Electron. Colloquium Comput. Complex., 2015)

Exact bounds for some hypergraph saturation problems. - Guy Moshkovitz; Asaf Shapira (J. Comb. Theory B, 2015)

A short proof of Gowers' lower bound for the regularity lemma. - Guy Moshkovitz; Asaf Shapira (Comb., 2016)

Unavoidable tournaments. - Asaf Shapira; Raphael Yuster (J. Comb. Theory B, 2016)

Removal lemmas with polynomial bounds. - Lior Gishboliner; Asaf Shapira (STOC, 2017)

Efficient Testing without Efficient Regularity. - Lior Gishboliner; Asaf Shapira (ITCS, 2018)

A Generalized Turan Problem and its Applications. - Lior Gishboliner; Asaf Shapira (Electron. Colloquium Comput. Complex., 2018)

Decomposing a graph into expanding subgraphs. - Guy Moshkovitz; Asaf Shapira (Random Struct. Algorithms, 2018)

Efficient Removal Without Efficient Regularity. - Lior Gishboliner; Asaf Shapira (Comb., 2019)

Testing Graphs against an Unknown Distribution. - Lior Gishboliner; Asaf Shapira (Electron. Colloquium Comput. Complex., 2019)

The removal lemma for tournaments. - Jacob Fox; Lior Gishboliner; Asaf Shapira; Raphael Yuster (J. Comb. Theory B, 2019)

A quantitative Lovász criterion for Property B. - Asaf Ferber; Asaf Shapira (Comb. Probab. Comput., 2020)

The Induced Removal Lemma in Sparse Graphs. - Shachar Sapir; Asaf Shapira (Comb. Probab. Comput., 2020)

Counting Subgraphs in Degenerate Graphs. - Lior Gishboliner; Yevgeny Levanzov; Asaf Shapira (Electron. Colloquium Comput. Complex., 2020)

Testing linear inequalities of subgraph statistics. - Lior Gishboliner; Asaf Shapira; Henrique Stagni (Electron. Colloquium Comput. Complex., 2020)

Tournament Quasirandomness from Local Counting. - Matija Bucic; Eoin Long; Asaf Shapira; Benny Sudakov (Comb., 2021)

Two Erdős-Hajnal-type theorems in hypergraphs. - Michal Amir; Asaf Shapira; Mykhaylo Tyomkyn (J. Comb. Theory B, 2021)

On Erdős's Method for Bounding the Partition Function. - Asaf Cohen Antonir; Asaf Shapira (Am. Math. Mon., 2021)

Quasirandom Graphs and the Pantograph Equation. - Asaf Shapira; Mykhaylo Tyomkyn (Am. Math. Mon., 2021)

Every Orientation of a $4$-Chromatic Graph has a Non-Bipartite Acyclic Subgraph. - Asaf Shapira (Electron. J. Comb., 2022)

Counting Subgraphs in Degenerate Graphs. - Suman K. Bera 001; Lior Gishboliner; Yevgeny Levanzov; C. Seshadhri 001; Asaf Shapira (J. ACM, 2022)

On Rödl's Theorem for Cographs. - Lior Gishboliner; Asaf Shapira (Electron. J. Comb., 2023)

A new bound for the Brown-Erdős-Sós problem. - David Conlon; Lior Gishboliner; Yevgeny Levanzov; Asaf Shapira (J. Comb. Theory B, 2023)

Counting Homomorphic Cycles in Degenerate Graphs. - Lior Gishboliner; Yevgeny Levanzov; Asaf Shapira; Raphael Yuster (ACM Trans. Algorithms, 2023)

A Tight Bound for Testing Partition Properties. - Asaf Shapira; Henrique Stagni (SODA, 2024)

A generalisation of Varnavides's theorem. - Asaf Shapira (Comb. Probab. Comput., 2024)

Bounding the number of odd paths in planar graphs via convex optimization. - Asaf Cohen Antonir; Asaf Shapira (J. Graph Theory, 2024)

Testing versus estimation of graph properties, revisited. - Asaf Shapira; Nick Kushnir; Lior Gishboliner (Random Struct. Algorithms, 2024)

Trimming Forests Is Hard (Unless They Are Made of Stars). - Lior Gishboliner; Yevgeny Levanzov; Asaf Shapira (SIAM J. Discret. Math., 2024)

A Fast Coloring Oracle for Average Case Hypergraphs. - Cassandra Marcussen; Edward Pyne; Ronitt Rubinfeld; Asaf Shapira; Shlomo Tauber (APPROX/RANDOM, 2025)

Hardness of Hypergraph Edge Modification Problems. - Lior Gishboliner; Yevgeny Levanzov; Asaf Shapira (CoRR, 2025)