Остановите войну!
for scientists:
default search action
Asaf Shapira
- > Home > Persons > Asaf Shapira
Publications
- 2023
- [j52]Lior Gishboliner, Asaf Shapira:
On Rödl's Theorem for Cographs. Electron. J. Comb. 30(4) (2023) - [j51]David Conlon, Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira:
A new bound for the Brown-Erdős-Sós problem. J. Comb. Theory, Ser. B 158(Part): 1-35 (2023) - [j50]Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira, Raphael Yuster:
Counting Homomorphic Cycles in Degenerate Graphs. ACM Trans. Algorithms 19(1): 2:1-2:22 (2023) - [c31]Lior Gishboliner, Nick Kushnir, Asaf Shapira:
Testing Versus Estimation of Graph Properties, Revisited. APPROX/RANDOM 2023: 46:1-46:18 - [i29]Lior Gishboliner, Nick Kushnir, Asaf Shapira:
Testing versus estimation of graph properties, revisited. CoRR abs/2305.05487 (2023) - [i28]Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira:
Trimming forests is hard (unless they are made of stars). CoRR abs/2310.11277 (2023) - 2022
- [j48]Suman K. Bera, Lior Gishboliner, Yevgeny Levanzov, C. Seshadhri, Asaf Shapira:
Counting Subgraphs in Degenerate Graphs. J. ACM 69(3): 23:1-23:21 (2022) - [c30]Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira, Raphael Yuster:
Counting Homomorphic Cycles in Degenerate Graphs. SODA 2022: 417-430 - 2021
- [j45]Lior Gishboliner, Asaf Shapira, Henrique Stagni:
Testing linear inequalities of subgraph statistics. Random Struct. Algorithms 58(3): 468-479 (2021) - 2020
- [c29]Lior Gishboliner, Asaf Shapira, Henrique Stagni:
Testing Linear Inequalities of Subgraph Statistics. ITCS 2020: 43:1-43:9 - [i27]Lior Gishboliner, Asaf Shapira, Henrique Stagni:
Testing linear inequalities of subgraph statistics. CoRR abs/2007.10390 (2020) - [i26]Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira:
Counting Subgraphs in Degenerate Graphs. CoRR abs/2010.05998 (2020) - [i25]Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira, Raphael Yuster:
Counting Homomorphic Cycles in Degenerate Graphs. CoRR abs/2011.05957 (2020) - [i24]Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira:
Counting Subgraphs in Degenerate Graphs. Electron. Colloquium Comput. Complex. TR20 (2020) - [i23]Lior Gishboliner, Asaf Shapira, Henrique Stagni:
Testing linear inequalities of subgraph statistics. Electron. Colloquium Comput. Complex. TR20 (2020) - 2019
- [j40]Lior Gishboliner, Asaf Shapira:
Efficient Removal Without Efficient Regularity. Comb. 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. Electron. Colloquium Comput. Complex. TR19 (2019) - 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. Electron. Colloquium Comput. Complex. TR18 (2018) - 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) - 2013
- [i16]Lior Gishboliner, Asaf Shapira:
Deterministic vs Non-deterministic Graph Property Testing. Electron. Colloquium Comput. Complex. TR13 (2013)
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).
Privacy notice: By enabling the option above, your browser will contact the API of 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, opencitations.net, and semanticscholar.org to load article reference 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, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and 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 and semanticscholar.org 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 as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional 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 information given by OpenAlex.
last updated on 2024-04-07 22:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint