Asaf Shapira

2008
22	EE	Asaf Shapira, Raphael Yuster: The effect of induced subgraphs on quasi-randomness. SODA 2008: 789-798
21	EE	Itai Benjamini, Oded Schramm, Asaf Shapira: Every minor-closed property of sparse graphs is testable. STOC 2008: 393-402
2007
20	EE	Noga Alon, Asaf Shapira, Uri Stav: Can a Graph Have Distinct Regular Partitions? COCOON 2007: 428-438
19	EE	Eldar Fischer, Arie Matsliah, Asaf Shapira: Approximate Hypergraph Partitioning and Applications. FOCS 2007: 579-589
18	EE	Noga Alon, Oded Schwartz, Asaf Shapira: An elementary construction of constant-degree expanders. SODA 2007: 454-458
17	EE	Asaf Shapira, Raphael Yuster, Uri Zwick: All-pairs bottleneck paths in vertex weighted graphs. SODA 2007: 978-985
16	EE	Eyal Even-Dar, Asaf Shapira: A Note on Maximizing the Spread of Influence in Social Networks. WINE 2007: 281-286
2006
15	EE	Oded Lachish, Ilan Newman, Asaf Shapira: Space Complexity vs. Query Complexity. APPROX-RANDOM 2006: 426-437
14	EE	Noga Alon, Asaf Shapira, Benny Sudakov: Additive Approximation for Edge-Deletion Problems (Abstract). ICALP (1) 2006: 1-2
13	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
12	EE	Noga Alon, Asaf Shapira: On An Extremal Hypergraph Problem Of Brown, Erdös And Sós. Combinatorica 26(6): 627-645 (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] [13] [14] [18] [20]
2	Itai Benjamini	[21]
3	Eyal Even-Dar	[16]
4	Eldar Fischer	[13] [19]
5	Oded Lachish	[15]
6	Arie Matsliah	[19]
7	Ilan Newman	[13] [15]
8	Oded Schramm	[21]
9	Oded Schwartz	[18]
10	Uri Stav	[20]
11	Benny Sudakov	[11] [14]
12	Raphael Yuster	[17] [22]
13	Uri Zwick	[17]

Colors in the list of coauthors