Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarAsaf Shapira
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2019
[j40]Lior Gishboliner, Asaf Shapira:
Efficient Removal Without Efficient Regularity. Combinatorica 39(3): 639-658 (2019)- [j39]Jacob Fox, Lior Gishboliner, Asaf Shapira, Raphael Yuster:
The removal lemma for tournaments. J. Comb. Theory, Ser. B 136: 110-134 (2019) - [c28]Lior Gishboliner, Asaf Shapira:
Testing graphs against an unknown distribution. STOC 2019: 535-546 - [i22]Lior Gishboliner, Asaf Shapira:
Testing Graphs against an Unknown Distribution. CoRR abs/1905.09903 (2019) - [i21]Lior Gishboliner, Asaf Shapira:
Testing Graphs against an Unknown Distribution. Electronic Colloquium on Computational Complexity (ECCC) 26: 83 (2019) - 2018
- [j38]Guy Moshkovitz, Asaf Shapira:
Decomposing a graph into expanding subgraphs. Random Struct. Algorithms 52(1): 158-178 (2018) - [c27]Lior Gishboliner, Asaf Shapira:
Efficient Testing without Efficient Regularity. ITCS 2018: 54:1-54:14 - [c26]Lior Gishboliner, Asaf Shapira:
A generalized Turán problem and its applications. STOC 2018: 760-772 - [i20]Lior Gishboliner, Asaf Shapira:
A Generalized Turan Problem and its Applications. Electronic Colloquium on Computational Complexity (ECCC) 25: 7 (2018) - 2017
- [j37]Reut Levi, Guy Moshkovitz, Dana Ron
, Ronitt Rubinfeld, Asaf Shapira:
Constructing near spanning trees with few local inspections. Random Struct. Algorithms 50(2): 183-200 (2017) - [c25]Lior Gishboliner, Asaf Shapira:
Removal lemmas with polynomial bounds. STOC 2017: 510-522 - [i19]Lior Gishboliner, Asaf Shapira:
A Generalized Turán Problem and its Applications. CoRR abs/1712.00831 (2017) - 2016
- [j36]Guy Moshkovitz, Asaf Shapira:
A short proof of Gowers' lower bound for the regularity lemma. Combinatorica 36(2): 187-194 (2016) - [j35]Asaf Shapira, Raphael Yuster:
Unavoidable tournaments. J. Comb. Theory, Ser. B 116: 191-207 (2016) - 2015
- [j34]Asaf Shapira, Benny Sudakov:
Small complete minors above the extremal edge density. Combinatorica 35(1): 75-94 (2015) - [j33]Domingos Dellamonica Jr., Subrahmanyam Kalyanasundaram, Daniel M. Martin, Vojtech Rödl, Asaf Shapira:
An Optimal Algorithm for Finding Frieze-Kannan Regular Partitions. Combinatorics, Probability & Computing 24(2): 407-437 (2015) - [j32]Guy Moshkovitz, Asaf Shapira:
Exact bounds for some hypergraph saturation problems. J. Comb. Theory, Ser. B 111: 242-248 (2015) - [j31]Arnab Bhattacharyya, Elena Grigorescu, Asaf Shapira:
A unified framework for testing linear-invariant properties. Random Struct. Algorithms 46(2): 232-260 (2015) - [c24]Guy Moshkovitz, Asaf Shapira:
Decomposing a Graph Into Expanding Subgraphs. SODA 2015: 1283-1295 - [i18]Reut Levi, Guy Moshkovitz, Dana Ron, Ronitt Rubinfeld, Asaf Shapira:
Constructing Near Spanning Trees with Few Local Inspections. CoRR abs/1502.00413 (2015) - [i17]Reut Levi, Guy Moshkovitz, Dana Ron, Ronitt Rubinfeld, Asaf Shapira:
Constructing Near Spanning Trees with Few Local Inspections. Electronic Colloquium on Computational Complexity (ECCC) 22: 19 (2015) - 2014
- [j30]Yair Caro, Asaf Shapira, Raphael Yuster:
Forcing $k$-repetitions in Degree Sequences. Electr. J. Comb. 21(1): P1.24 (2014) - [j29]Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler:
Finding cycles and trees in sublinear time. Random Struct. Algorithms 45(2): 139-184 (2014) - 2013
- [j28]Hao Huang, Jie Ma, Asaf Shapira, Benny Sudakov, Raphael Yuster:
Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs. Combinatorics, Probability & Computing 22(6): 859-873 (2013) - [j27]Subrahmanyam Kalyanasundaram, Asaf Shapira:
A Note on Even Cycles and Quasirandom Tournaments. Journal of Graph Theory 73(3): 260-266 (2013) - [i16]Lior Gishboliner, Asaf Shapira:
Deterministic vs Non-deterministic Graph Property Testing. Electronic Colloquium on Computational Complexity (ECCC) 20: 59 (2013) - 2012
- [j26]Arnab Bhattacharyya, Elena Grigorescu, Prasad Raghavendra, Asaf Shapira:
Testing Odd-Cycle-Freeness in Boolean Functions. Combinatorics, Probability & Computing 21(6): 835-855 (2012) - [j25]Asaf Shapira, Raphael Yuster:
The quasi-randomness of hypergraph cut properties. Random Struct. Algorithms 40(1): 105-131 (2012) - [j24]Domingos Dellamonica Jr., Subrahmanyam Kalyanasundaram, Daniel M. Martin, Vojtech Rödl, Asaf Shapira:
A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma. SIAM J. Discrete Math. 26(1): 15-29 (2012) - [c23]Arnab Bhattacharyya, Elena Grigorescu, Prasad Raghavendra, Asaf Shapira:
Testing odd-cycle-freeness in Boolean functions. SODA 2012: 1140-1149 - [i15]Shiva Kintali, Asaf Shapira:
A Note on the Balanced ST-Connectivity. CoRR abs/1204.0816 (2012) - [i14]Asaf Shapira, Benny Sudakov:
Small Complete Minors Above the Extremal Edge Density. CoRR abs/1208.3568 (2012) - [i13]Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler:
Finding Cycles and Trees in Sublinear Time. Electronic Colloquium on Computational Complexity (ECCC) 19: 35 (2012) - 2011
- [j23]Asaf Shapira, Raphael Yuster, Uri Zwick:
All-Pairs Bottleneck Paths in Vertex Weighted Graphs. Algorithmica 59(4): 621-633 (2011) - [j22]Eyal Even-Dar, Asaf Shapira:
A note on maximizing the spread of influence in social networks. Inf. Process. Lett. 111(4): 184-187 (2011) - [j21]Ronitt Rubinfeld, Asaf Shapira:
Sublinear Time Algorithms. SIAM J. Discrete Math. 25(4): 1562-1588 (2011) - [j20]Liam Roditty, Asaf Shapira:
All-pairs shortest paths with a sublinear additive error. ACM Trans. Algorithms 7(4): 45:1-45:12 (2011) - [c22]Domingos Dellamonica Jr., Subrahmanyam Kalyanasundaram, Daniel M. Martin, Vojtech Rödl, Asaf Shapira:
A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma. APPROX-RANDOM 2011: 495-506 - [c21]Kevin P. Costello, Asaf Shapira, Prasad Tetali:
Randomized greedy: new variants of some classic approximation algorithms. SODA 2011: 647-655 - [i12]Arnab Bhattacharyya, Elena Grigorescu, Prasad Raghavendra, Asaf Shapira:
Testing Odd-Cycle-Freeness in Boolean Functions. CoRR abs/1105.1325 (2011) - [i11]Ronitt Rubinfeld, Asaf Shapira:
Sublinear Time Algorithms. Electronic Colloquium on Computational Complexity (ECCC) 18: 13 (2011) - [i10]Arnab Bhattacharyya, Elena Grigorescu, Prasad Raghavendra, Asaf Shapira:
Testing Odd-Cycle-Freeness in Boolean Functions. Electronic Colloquium on Computational Complexity (ECCC) 18: 75 (2011) - 2010
- [j19]Asaf Nachmias, Asaf Shapira:
Testing the expansion of a graph. Inf. Comput. 208(4): 309-314 (2010) - [j18]Asaf Shapira, Raphael Yuster:
On the density of a graph and its blowup. J. Comb. Theory, Ser. B 100(6): 704-719 (2010) - [j17]Asaf Shapira, Raphael Yuster:
The effect of induced subgraphs on quasi-randomness. Random Struct. Algorithms 36(1): 90-109 (2010) - [j16]Eldar Fischer, Arie Matsliah, Asaf Shapira:
Approximate Hypergraph Partitioning and Applications. SIAM J. Comput. 39(7): 3155-3185 (2010) - [c20]Arnab Bhattacharyya, Elena Grigorescu, Asaf Shapira:
A Unified Framework for Testing Linear-Invariant Properties. FOCS 2010: 478-487 - [p1]Asaf Shapira:
Green's Conjecture and Testing Linear Invariant Properties. Property Testing 2010: 355-358 - [i9]Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler:
Finding Cycles and Trees in Sublinear Time. CoRR abs/1007.4230 (2010) - [i8]Arnab Bhattacharyya, Elena Grigorescu, Asaf Shapira:
A Unified Framework for Testing Linear-Invariant Properties. CoRR abs/1010.5016 (2010) - [i7]Arnab Bhattacharyya, Elena Grigorescu, Asaf Shapira:
A Unified Framework for Testing Linear-Invariant Properties. Electronic Colloquium on Computational Complexity (ECCC) 17: 161 (2010)
2000 – 2009
- 2009
- [j15]Asaf Shapira, Raphael Yuster:
Multigraphs (Only) Satisfy a Weak Triangle Removal Lemma. Electr. J. Comb. 16(1) (2009) - [j14]Artur Czumaj, Asaf Shapira, Christian Sohler:
Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs. SIAM J. Comput. 38(6): 2499-2510 (2009) - [j13]Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapira:
A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity. SIAM J. Comput. 39(1): 143-167 (2009) - [j12]Noga Alon, Asaf Shapira, Uri Stav:
Can a Graph Have Distinct Regular Partitions? SIAM J. Discrete Math. 23(1): 278-287 (2009) - [c19]Asaf Shapira:
Green's conjecture and testing linear-invariant properties. STOC 2009: 159-166 - 2008
- [j11]Oded Lachish, Ilan Newman, Asaf Shapira:
Space Complexity Vs. Query Complexity. Computational Complexity 17(1): 70-93 (2008) - [j10]Noga Alon, Asaf Shapira:
A separation theorem in property testing. Combinatorica 28(3): 261-281 (2008) - [j9]Asaf Shapira:
Quasi-randomness and the distribution of copies of a fixed graph. Combinatorica 28(6): 735-745 (2008) - [j8]Noga Alon, Oded Schwartz, Asaf Shapira:
An Elementary Construction of Constant-Degree Expanders. Combinatorics, Probability & Computing 17(3): 319-327 (2008) - [j7]Noga Alon, Asaf Shapira:
A Characterization of the (Natural) Graph Properties Testable with One-Sided Error. SIAM J. Comput. 37(6): 1703-1727 (2008) - [j6]Noga Alon, Asaf Shapira:
Every Monotone Graph Property Is Testable. SIAM J. Comput. 38(2): 505-522 (2008) - [c18]Liam Roditty, Asaf Shapira:
All-Pairs Shortest Paths with a Sublinear Additive Error. ICALP (1) 2008: 622-633 - [c17]Asaf Shapira, Raphael Yuster:
The effect of induced subgraphs on quasi-randomness. SODA 2008: 789-798 - [c16]Itai Benjamini, Oded Schramm, Asaf Shapira:
Every minor-closed property of sparse graphs is testable. STOC 2008: 393-402 - [i6]Itai Benjamini, Oded Schramm, Asaf Shapira:
Every Minor-Closed Property of Sparse Graphs is Testable. Electronic Colloquium on Computational Complexity (ECCC) 15(010) (2008) - 2007
- [c15]Noga Alon, Asaf Shapira, Uri Stav:
Can a Graph Have Distinct Regular Partitions? COCOON 2007: 428-438 - [c14]Eldar Fischer, Arie Matsliah, Asaf Shapira:
Approximate Hypergraph Partitioning and Applications. FOCS 2007: 579-589 - [c13]Noga Alon, Oded Schwartz, Asaf Shapira:
An elementary construction of constant-degree expanders. SODA 2007: 454-458 - [c12]Asaf Shapira, Raphael Yuster, Uri Zwick:
All-pairs bottleneck paths in vertex weighted graphs. SODA 2007: 978-985 - [c11]Eyal Even-Dar, Asaf Shapira:
A Note on Maximizing the Spread of Influence in Social Networks. WINE 2007: 281-286 - [i5]Artur Czumaj, Asaf Shapira, Christian Sohler:
Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs. Electronic Colloquium on Computational Complexity (ECCC) 14(083) (2007) - [i4]Asaf Nachmias, Asaf Shapira:
Testing the Expansion of a Graph. Electronic Colloquium on Computational Complexity (ECCC) 14(118) (2007) - 2006
- [j5]Noga Alon, Asaf Shapira:
On An Extremal Hypergraph Problem Of Brown, Erdös And Sós. Combinatorica 26(6): 627-645 (2006) - [j4]Noga Alon, Asaf Shapira:
A Characterization of Easily Testable Induced Subgraphs. Combinatorics, Probability & Computing 15(6): 791-805 (2006) - [c10]Oded Lachish, Ilan Newman, Asaf Shapira:
Space Complexity vs. Query Complexity. APPROX-RANDOM 2006: 426-437 - [c9]Noga Alon, Asaf Shapira, Benny Sudakov:
Additive Approximation for Edge-Deletion Problems (Abstract). ICALP (1) 2006: 1-2 - [c8]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 - [i3]Oded Lachish, Ilan Newman, Asaf Shapira:
Space Complexity vs. Query Complexity. Electronic Colloquium on Computational Complexity (ECCC) 13(103) (2006) - [i2]Noga Alon, Oded Schwartz, Asaf Shapira:
An Elementary Construction of Constant-Degree Expanders. Electronic Colloquium on Computational Complexity (ECCC) 13(119) (2006) - 2005
- [j3]Noga Alon, Asaf Shapira:
Linear Equations, Arithmetic Progressions and Hypergraph Property Testing. Theory of Computing 1(1): 177-216 (2005) - [c7]Noga Alon, Asaf Shapira, Benny Sudakov:
Additive Approximation for Edge-Deletion Problems. FOCS 2005: 419-428 - [c6]Noga Alon, Asaf Shapira:
A Characterization of the (natural) Graph Properties Testable with One-Sided Error. FOCS 2005: 429-438 - [c5]Noga Alon, Asaf Shapira:
Linear equations, arithmetic progressions and hypergraph property testing. SODA 2005: 708-717 - [c4]Noga Alon, Asaf Shapira:
Every monotone graph property is testable. STOC 2005: 128-137 - [i1]Asaf Shapira, Noga Alon:
Homomorphisms in Graph Property Testing - A Survey. Electronic Colloquium on Computational Complexity (ECCC)(085) (2005) - 2004
- [j2]Noga Alon, Asaf Shapira:
Testing subgraphs in directed graphs. J. Comput. Syst. Sci. 69(3): 354-382 (2004) - [c3]Noga Alon, Asaf Shapira:
A characterization of easily testable induced subgraphs. SODA 2004: 942-951 - 2003
- [j1]Noga Alon, Asaf Shapira:
Testing satisfiability. J. Algorithms 47(2): 87-103 (2003) - [c2]Noga Alon, Asaf Shapira:
Testing subgraphs in directed graphs. STOC 2003: 700-709 - 2002
- [c1]Noga Alon, Asaf Shapira:
Testing satisfiability. SODA 2002: 645-654
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org and opencitations.net to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy.
Citation data
Add a list of citing articles from to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter accout. At the same time, Twitter will persitently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2019-10-02 03:49 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
