| 2024 | SODA | A Tight Bound for Testing Partition Properties. | Asaf Shapira, Henrique Stagni |
| 2022 | SODA | Counting Homomorphic Cycles in Degenerate Graphs. | Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira, Raphael Yuster |
| 2019 | STOC | Testing graphs against an unknown distribution. | Lior Gishboliner, Asaf Shapira |
| 2018 | STOC | A generalized Turn problem and its applications. | Lior Gishboliner, Asaf Shapira |
| 2017 | STOC | Removal lemmas with polynomial bounds. | Lior Gishboliner, Asaf Shapira |
| 2015 | SODA | Decomposing a Graph Into Expanding Subgraphs. | Guy Moshkovitz, Asaf Shapira |
| 2012 | SODA | Testing odd-cycle-freeness in Boolean functions. | Arnab Bhattacharyya, Elena Grigorescu, Prasad Raghavendra, Asaf Shapira |
| 2011 | SODA | Randomized greedy: new variants of some classic approximation algorithms. | Kevin P. Costello, Asaf Shapira, Prasad Tetali |
| 2010 | FOCS | A Unified Framework for Testing Linear-Invariant Properties. | Arnab Bhattacharyya, Elena Grigorescu, Asaf Shapira |
| 2009 | STOC | Green's conjecture and testing linear-invariant properties. | Asaf Shapira |
| 2008 | ICALP | All-Pairs Shortest Paths with a Sublinear Additive Error. | Liam Roditty, Asaf Shapira |
| 2008 | SODA | The effect of induced subgraphs on quasi-randomness. | Asaf Shapira, Raphael Yuster |
| 2008 | STOC | Every minor-closed property of sparse graphs is testable. | Itai Benjamini, Oded Schramm, Asaf Shapira |
| 2007 | COCOON | Can a Graph Have Distinct Regular Partitions? | Noga Alon, Asaf Shapira, Uri Stav |
| 2007 | FOCS | Approximate Hypergraph Partitioning and Applications. | Eldar Fischer, Arie Matsliah, Asaf Shapira |
| 2007 | SODA | An elementary construction of constant-degree expanders. | Noga Alon, Oded Schwartz, Asaf Shapira |
| 2007 | SODA | All-pairs bottleneck paths in vertex weighted graphs. | Asaf Shapira, Raphael Yuster, Uri Zwick |
| 2006 | ICALP | Additive Approximation for Edge-Deletion Problems (Abstract). | Noga Alon, Asaf Shapira, Benny Sudakov |
| 2006 | STOC | A combinatorial characterization of the testable graph properties: it's all about regularity. | Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapira |
| 2005 | FOCS | A Characterization of the (natural) Graph Properties Testable with One-Sided Error. | Noga Alon, Asaf Shapira |
| 2005 | FOCS | Additive Approximation for Edge-Deletion Problems. | Noga Alon, Asaf Shapira, Benny Sudakov |
| 2005 | SODA | Linear equations, arithmetic progressions and hypergraph property testing. | Noga Alon, Asaf Shapira |
| 2005 | STOC | Every monotone graph property is testable. | Noga Alon, Asaf Shapira |
| 2004 | SODA | A characterization of easily testable induced subgraphs. | Noga Alon, Asaf Shapira |
| 2003 | STOC | Testing subgraphs in directed graphs. | Noga Alon, Asaf Shapira |
| 2002 | SODA | Testing satisfiability. | Noga Alon, Asaf Shapira |