Asaf Shapira

2009
35	EE	Artur Czumaj, Asaf Shapira, Christian Sohler: Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs. SIAM J. Comput. 38(6): 2499-2510 (2009)
2008
34	EE	Liam Roditty, Asaf Shapira: All-Pairs Shortest Paths with a Sublinear Additive Error. ICALP (1) 2008: 622-633
33	EE	Asaf Shapira, Raphael Yuster: The effect of induced subgraphs on quasi-randomness. SODA 2008: 789-798
32	EE	Itai Benjamini, Oded Schramm, Asaf Shapira: Every minor-closed property of sparse graphs is testable. STOC 2008: 393-402
31	EE	Noga Alon, Asaf Shapira: A separation theorem in property testing. Combinatorica 28(3): 261-281 (2008)
30	EE	Noga Alon, Oded Schwartz, Asaf Shapira: An Elementary Construction of Constant-Degree Expanders. Combinatorics, Probability & Computing 17(3): 319-327 (2008)
29	EE	Oded Lachish, Ilan Newman, Asaf Shapira: Space Complexity Vs. Query Complexity. Computational Complexity 17(1): 70-93 (2008)
28	EE	Itai Benjamini, Oded Schramm, Asaf Shapira: Every Minor-Closed Property of Sparse Graphs is Testable. Electronic Colloquium on Computational Complexity (ECCC) 15(010): (2008)
27	EE	Noga Alon, Asaf Shapira: A Characterization of the (Natural) Graph Properties Testable with One-Sided Error. SIAM J. Comput. 37(6): 1703-1727 (2008)
26	EE	Noga Alon, Asaf Shapira: Every Monotone Graph Property Is Testable. SIAM J. Comput. 38(2): 505-522 (2008)
2007
25	EE	Noga Alon, Asaf Shapira, Uri Stav: Can a Graph Have Distinct Regular Partitions? COCOON 2007: 428-438
24	EE	Eldar Fischer, Arie Matsliah, Asaf Shapira: Approximate Hypergraph Partitioning and Applications. FOCS 2007: 579-589
23	EE	Noga Alon, Oded Schwartz, Asaf Shapira: An elementary construction of constant-degree expanders. SODA 2007: 454-458
22	EE	Asaf Shapira, Raphael Yuster, Uri Zwick: All-pairs bottleneck paths in vertex weighted graphs. SODA 2007: 978-985
21	EE	Eyal Even-Dar, Asaf Shapira: A Note on Maximizing the Spread of Influence in Social Networks. WINE 2007: 281-286
20	EE	Artur Czumaj, Asaf Shapira, Christian Sohler: Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs. Electronic Colloquium on Computational Complexity (ECCC) 14(083): (2007)
19	EE	Asaf Nachmias, Asaf Shapira: Testing the Expansion of a Graph. Electronic Colloquium on Computational Complexity (ECCC) 14(118): (2007)
2006
18	EE	Oded Lachish, Ilan Newman, Asaf Shapira: Space Complexity vs. Query Complexity. APPROX-RANDOM 2006: 426-437
17	EE	Noga Alon, Asaf Shapira, Benny Sudakov: Additive Approximation for Edge-Deletion Problems (Abstract). ICALP (1) 2006: 1-2
16	EE	Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapira: A combinatorial characterization of the testable graph properties: it's all about regularity. STOC 2006: 251-260
15	EE	Noga Alon, Asaf Shapira: On An Extremal Hypergraph Problem Of Brown, Erdös And Sós. Combinatorica 26(6): 627-645 (2006)
14	EE	Noga Alon, Asaf Shapira: A Characterization of Easily Testable Induced Subgraphs. Combinatorics, Probability & Computing 15(6): 791-805 (2006)
13	EE	Oded Lachish, Ilan Newman, Asaf Shapira: Space Complexity vs. Query Complexity. Electronic Colloquium on Computational Complexity (ECCC) 13(103): (2006)
12	EE	Noga Alon, Oded Schwartz, Asaf Shapira: An Elementary Construction of Constant-Degree Expanders. Electronic Colloquium on Computational Complexity (ECCC) 13(119): (2006)
2005
11	EE	Noga Alon, Asaf Shapira, Benny Sudakov: Additive Approximation for Edge-Deletion Problems. FOCS 2005: 419-428
10	EE	Noga Alon, Asaf Shapira: A Characterization of the (natural) Graph Properties Testable with One-Sided Error. FOCS 2005: 429-438
9	EE	Noga Alon, Asaf Shapira: Linear equations, arithmetic progressions and hypergraph property testing. SODA 2005: 708-717
8	EE	Noga Alon, Asaf Shapira: Every monotone graph property is testable. STOC 2005: 128-137
7	EE	Asaf Shapira, Noga Alon: Homomorphisms in Graph Property Testing - A Survey Electronic Colloquium on Computational Complexity (ECCC)(085): (2005)
6	EE	Noga Alon, Asaf Shapira: Linear Equations, Arithmetic Progressions and Hypergraph Property Testing. Theory of Computing 1(1): 177-216 (2005)
2004
5	EE	Noga Alon, Asaf Shapira: A characterization of easily testable induced subgraphs. SODA 2004: 942-951
4	EE	Noga Alon, Asaf Shapira: Testing subgraphs in directed graphs. J. Comput. Syst. Sci. 69(3): 354-382 (2004)
2003
3	EE	Noga Alon, Asaf Shapira: Testing subgraphs in directed graphs. STOC 2003: 700-709
2	EE	Noga Alon, Asaf Shapira: Testing satisfiability. J. Algorithms 47(2): 87-103 (2003)
2002
1	EE	Noga Alon, Asaf Shapira: Testing satisfiability. SODA 2002: 645-654

Coauthor Index

1	Noga Alon	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [14] [15] [16] [17] [23] [25] [26] [27] [30] [31]
2	Itai Benjamini	[28] [32]
3	Artur Czumaj	[20] [35]
4	Eyal Even-Dar	[21]
5	Eldar Fischer	[16] [24]
6	Oded Lachish	[13] [18] [29]
7	Arie Matsliah	[24]
8	Asaf Nachmias	[19]
9	Ilan Newman	[13] [16] [18] [29]
10	Liam Roditty	[34]
11	Oded Schramm	[28] [32]
12	Oded Schwartz	[12] [23] [30]
13	Christian Sohler	[20] [35]
14	Uri Stav	[25]
15	Benny Sudakov	[11] [17]
16	Raphael Yuster	[22] [33]
17	Uri Zwick	[22]

Colors in the list of coauthors