| A note on maximizing the spread of influence in social networks E Even-Dar, A Shapira Information Processing Letters 111 (4), 184-187, 2011 | 316* | 2011 |
| A combinatorial characterization of the testable graph properties: it's all about regularity N Alon, E Fischer, I Newman, A Shapira Proceedings of the thirty-eighth annual ACM Symposium on Theory of Computing …, 2006 | 292 | 2006 |
| A characterization of the (natural) graph properties testable with one-sided error N Alon, A Shapira SIAM Journal on Computing 37 (6), 1703-1727, 2008 | 263 | 2008 |
| Testing subgraphs in directed graphs N Alon, A Shapira Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003 | 202 | 2003 |
| Sublinear time algorithms R Rubinfeld, A Shapira SIAM Journal on Discrete Mathematics 25 (4), 1562-1588, 2011 | 201 | 2011 |
| Every monotone graph property is testable N Alon, A Shapira Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005 | 175 | 2005 |
| Every minor-closed property of sparse graphs is testable I Benjamini, O Schramm, A Shapira Proceedings of the fortieth annual ACM symposium on Theory of computing, 393-402, 2008 | 162 | 2008 |
| A characterization of easily testable induced subgraphs N Alon, A Shapira Combinatorics, Probability and Computing 15 (6), 791-805, 2006 | 105 | 2006 |
| A proof of Green's conjecture regarding the removal properties of sets of linear equations A Shapira Journal of the London Mathematical Society 81 (2), 355-373, 2010 | 80* | 2010 |
| Testing hereditary properties of nonexpanding bounded-degree graphs A Czumaj, A Shapira, C Sohler SIAM Journal on Computing 38 (6), 2499-2510, 2009 | 80 | 2009 |
| Additive approximation for edge-deletion problems N Alon, A Shapira, B Sudakov Annals of mathematics, 371-411, 2009 | 79* | 2009 |
| Testing the expansion of a graph A Nachmias, A Shapira Information and Computation 208 (4), 309-314, 2010 | 71 | 2010 |
| A unified framework for testing linear‐invariant properties A Bhattacharyya, E Grigorescu, A Shapira Random Structures & Algorithms 46 (2), 232-260, 2015 | 69 | 2015 |
| A generalized Turán problem and its applications L Gishboliner, A Shapira Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 68 | 2018 |
| Ramsey theory, integer partitions and a new proof of the Erdős–Szekeres theorem G Moshkovitz, A Shapira Advances in Mathematics 262, 1107-1129, 2014 | 66 | 2014 |
| An elementary construction of constant-degree expanders N Alon, O Schwartz, A Shapira Combinatorics, Probability and Computing 17 (3), 319-327, 2008 | 63 | 2008 |
| Finding cycles and trees in sublinear time A Czumaj, O Goldreich, D Ron, C Seshadhri, A Shapira, C Sohler Random Structures & Algorithms 45 (2), 139-184, 2014 | 57 | 2014 |
| Testing satisfiability N Alon, A Shapira Journal of Algorithms 47 (2), 87-103, 2003 | 53 | 2003 |
| Exact bounds for some hypergraph saturation problems G Moshkovitz, A Shapira Journal of Combinatorial Theory, Series B 111, 242-248, 2015 | 48 | 2015 |
| On an extremal hypergraph problem of Brown, Erdos and Sós N Alon, A Shapira Combinatorica 26 (6), 627-646, 2006 | 48 | 2006 |
Noga AlonPrinceton University and Tel Aviv Universitytau.ac.il의 이메일 확인됨
