Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Asaf Shapira
@inproceedings{DBLP:conf/soda/ShapiraS24,
author = {Asaf Shapira and
Henrique Stagni},
editor = {David P. Woodruff},
title = {A Tight Bound for Testing Partition Properties},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {4305--4320},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.150},
doi = {10.1137/1.9781611977912.150},
timestamp = {Thu, 04 Apr 2024 19:38:10 +0200},
biburl = {https://dblp.org/rec/conf/soda/ShapiraS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/GishbolinerS23,
author = {Lior Gishboliner and
Asaf Shapira},
title = {On R{\"{o}}dl's Theorem for Cographs},
journal = {Electron. J. Comb.},
volume = {30},
number = {4},
year = {2023},
url = {https://doi.org/10.37236/12189},
doi = {10.37236/12189},
timestamp = {Wed, 22 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorics/GishbolinerS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jctb/ConlonGLS23,
author = {David Conlon and
Lior Gishboliner and
Yevgeny Levanzov and
Asaf Shapira},
title = {A new bound for the Brown-Erd{\H{o}}s-S{\'{o}}s problem},
journal = {J. Comb. Theory, Ser. {B}},
volume = {158},
number = {Part},
pages = {1--35},
year = {2023},
url = {https://doi.org/10.1016/j.jctb.2022.08.005},
doi = {10.1016/J.JCTB.2022.08.005},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jctb/ConlonGLS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GishbolinerLSY23,
author = {Lior Gishboliner and
Yevgeny Levanzov and
Asaf Shapira and
Raphael Yuster},
title = {Counting Homomorphic Cycles in Degenerate Graphs},
journal = {{ACM} Trans. Algorithms},
volume = {19},
number = {1},
pages = {2:1--2:22},
year = {2023},
url = {https://doi.org/10.1145/3560820},
doi = {10.1145/3560820},
timestamp = {Sat, 29 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/GishbolinerLSY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GishbolinerKS23,
author = {Lior Gishboliner and
Nick Kushnir and
Asaf Shapira},
editor = {Nicole Megow and
Adam D. Smith},
title = {Testing Versus Estimation of Graph Properties, Revisited},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta,
Georgia, {USA}},
series = {LIPIcs},
volume = {275},
pages = {46:1--46:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.46},
doi = {10.4230/LIPICS.APPROX/RANDOM.2023.46},
timestamp = {Sat, 09 Sep 2023 00:04:38 +0200},
biburl = {https://dblp.org/rec/conf/approx/GishbolinerKS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-05487,
author = {Lior Gishboliner and
Nick Kushnir and
Asaf Shapira},
title = {Testing versus estimation of graph properties, revisited},
journal = {CoRR},
volume = {abs/2305.05487},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.05487},
doi = {10.48550/ARXIV.2305.05487},
eprinttype = {arXiv},
eprint = {2305.05487},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-05487.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-11277,
author = {Lior Gishboliner and
Yevgeny Levanzov and
Asaf Shapira},
title = {Trimming forests is hard (unless they are made of stars)},
journal = {CoRR},
volume = {abs/2310.11277},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.11277},
doi = {10.48550/ARXIV.2310.11277},
eprinttype = {arXiv},
eprint = {2310.11277},
timestamp = {Thu, 26 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-11277.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/Shapira22,
author = {Asaf Shapira},
title = {Every Orientation of a {\textdollar}4{\textdollar}-Chromatic Graph
has a Non-Bipartite Acyclic Subgraph},
journal = {Electron. J. Comb.},
volume = {29},
number = {1},
year = {2022},
url = {https://doi.org/10.37236/10727},
doi = {10.37236/10727},
timestamp = {Fri, 04 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorics/Shapira22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BeraGLSS22,
author = {Suman K. Bera and
Lior Gishboliner and
Yevgeny Levanzov and
C. Seshadhri and
Asaf Shapira},
title = {Counting Subgraphs in Degenerate Graphs},
journal = {J. {ACM}},
volume = {69},
number = {3},
pages = {23:1--23:21},
year = {2022},
url = {https://doi.org/10.1145/3520240},
doi = {10.1145/3520240},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BeraGLSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GishbolinerLSY22,
author = {Lior Gishboliner and
Yevgeny Levanzov and
Asaf Shapira and
Raphael Yuster},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {Counting Homomorphic Cycles in Degenerate Graphs},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {417--430},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.21},
doi = {10.1137/1.9781611977073.21},
timestamp = {Tue, 12 Apr 2022 11:24:56 +0200},
biburl = {https://dblp.org/rec/conf/soda/GishbolinerLSY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/BucicLSS21,
author = {Matija Bucic and
Eoin Long and
Asaf Shapira and
Benny Sudakov},
title = {Tournament Quasirandomness from Local Counting},
journal = {Comb.},
volume = {41},
number = {2},
pages = {175--208},
year = {2021},
url = {https://doi.org/10.1007/s00493-020-4371-y},
doi = {10.1007/S00493-020-4371-Y},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/BucicLSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jctb/AmirST21,
author = {Michal Amir and
Asaf Shapira and
Mykhaylo Tyomkyn},
title = {Two Erd{\H{o}}s-Hajnal-type theorems in hypergraphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {146},
pages = {417--438},
year = {2021},
url = {https://doi.org/10.1016/j.jctb.2020.03.001},
doi = {10.1016/J.JCTB.2020.03.001},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jctb/AmirST21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GishbolinerSS21,
author = {Lior Gishboliner and
Asaf Shapira and
Henrique Stagni},
title = {Testing linear inequalities of subgraph statistics},
journal = {Random Struct. Algorithms},
volume = {58},
number = {3},
pages = {468--479},
year = {2021},
url = {https://doi.org/10.1002/rsa.20983},
doi = {10.1002/RSA.20983},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GishbolinerSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tamm/ShapiraT21,
author = {Asaf Shapira and
Mykhaylo Tyomkyn},
title = {Quasirandom Graphs and the Pantograph Equation},
journal = {Am. Math. Mon.},
volume = {128},
number = {7},
pages = {630--639},
year = {2021},
url = {https://doi.org/10.1080/00029890.2021.1926187},
doi = {10.1080/00029890.2021.1926187},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tamm/ShapiraT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tamm/AntonirS21,
author = {Asaf Cohen Antonir and
Asaf Shapira},
title = {On Erd{\H{o}}s's Method for Bounding the Partition Function},
journal = {Am. Math. Mon.},
volume = {128},
number = {8},
pages = {744--747},
year = {2021},
url = {https://doi.org/10.1080/00029890.2021.1944756},
doi = {10.1080/00029890.2021.1944756},
timestamp = {Tue, 23 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tamm/AntonirS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/SapirS20,
author = {Shachar Sapir and
Asaf Shapira},
title = {The Induced Removal Lemma in Sparse Graphs},
journal = {Comb. Probab. Comput.},
volume = {29},
number = {1},
pages = {153--162},
year = {2020},
url = {https://doi.org/10.1017/S0963548319000233},
doi = {10.1017/S0963548319000233},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/SapirS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/FerberS20,
author = {Asaf Ferber and
Asaf Shapira},
title = {A quantitative Lov{\'{a}}sz criterion for Property {B}},
journal = {Comb. Probab. Comput.},
volume = {29},
number = {6},
pages = {956--960},
year = {2020},
url = {https://doi.org/10.1017/S0963548320000334},
doi = {10.1017/S0963548320000334},
timestamp = {Mon, 16 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/FerberS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GishbolinerSS20,
author = {Lior Gishboliner and
Asaf Shapira and
Henrique Stagni},
editor = {Thomas Vidick},
title = {Testing Linear Inequalities of Subgraph Statistics},
booktitle = {11th Innovations in Theoretical Computer Science Conference, {ITCS}
2020, January 12-14, 2020, Seattle, Washington, {USA}},
series = {LIPIcs},
volume = {151},
pages = {43:1--43:9},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2020.43},
doi = {10.4230/LIPICS.ITCS.2020.43},
timestamp = {Mon, 06 Jan 2020 16:50:09 +0100},
biburl = {https://dblp.org/rec/conf/innovations/GishbolinerSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-10390,
author = {Lior Gishboliner and
Asaf Shapira and
Henrique Stagni},
title = {Testing linear inequalities of subgraph statistics},
journal = {CoRR},
volume = {abs/2007.10390},
year = {2020},
url = {https://arxiv.org/abs/2007.10390},
eprinttype = {arXiv},
eprint = {2007.10390},
timestamp = {Wed, 29 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-10390.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-05998,
author = {Lior Gishboliner and
Yevgeny Levanzov and
Asaf Shapira},
title = {Counting Subgraphs in Degenerate Graphs},
journal = {CoRR},
volume = {abs/2010.05998},
year = {2020},
url = {https://arxiv.org/abs/2010.05998},
eprinttype = {arXiv},
eprint = {2010.05998},
timestamp = {Tue, 20 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-05998.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-05957,
author = {Lior Gishboliner and
Yevgeny Levanzov and
Asaf Shapira and
Raphael Yuster},
title = {Counting Homomorphic Cycles in Degenerate Graphs},
journal = {CoRR},
volume = {abs/2011.05957},
year = {2020},
url = {https://arxiv.org/abs/2011.05957},
eprinttype = {arXiv},
eprint = {2011.05957},
timestamp = {Thu, 12 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-05957.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GishbolinerLS20,
author = {Lior Gishboliner and
Yevgeny Levanzov and
Asaf Shapira},
title = {Counting Subgraphs in Degenerate Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-177}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/177},
eprinttype = {ECCC},
eprint = {TR20-177},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GishbolinerLS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GishbolinerSS20,
author = {Lior Gishboliner and
Asaf Shapira and
Henrique Stagni},
title = {Testing linear inequalities of subgraph statistics},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-107}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/107},
eprinttype = {ECCC},
eprint = {TR20-107},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GishbolinerSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/GishbolinerS19,
author = {Lior Gishboliner and
Asaf Shapira},
title = {Efficient Removal Without Efficient Regularity},
journal = {Comb.},
volume = {39},
number = {3},
pages = {639--658},
year = {2019},
url = {https://doi.org/10.1007/s00493-018-3899-6},
doi = {10.1007/S00493-018-3899-6},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/GishbolinerS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FoxGSY19,
author = {Jacob Fox and
Lior Gishboliner and
Asaf Shapira and
Raphael Yuster},
title = {The removal lemma for tournaments},
journal = {J. Comb. Theory, Ser. {B}},
volume = {136},
pages = {110--134},
year = {2019},
url = {https://doi.org/10.1016/j.jctb.2018.10.001},
doi = {10.1016/J.JCTB.2018.10.001},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/FoxGSY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GishbolinerS19,
author = {Lior Gishboliner and
Asaf Shapira},
editor = {Moses Charikar and
Edith Cohen},
title = {Testing graphs against an unknown distribution},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {535--546},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316308},
doi = {10.1145/3313276.3316308},
timestamp = {Sat, 22 Jun 2019 17:42:26 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GishbolinerS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-09903,
author = {Lior Gishboliner and
Asaf Shapira},
title = {Testing Graphs against an Unknown Distribution},
journal = {CoRR},
volume = {abs/1905.09903},
year = {2019},
url = {http://arxiv.org/abs/1905.09903},
eprinttype = {arXiv},
eprint = {1905.09903},
timestamp = {Wed, 29 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-09903.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GishbolinerS19,
author = {Lior Gishboliner and
Asaf Shapira},
title = {Testing Graphs against an Unknown Distribution},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-083}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/083},
eprinttype = {ECCC},
eprint = {TR19-083},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GishbolinerS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MoshkovitzS18,
author = {Guy Moshkovitz and
Asaf Shapira},
title = {Decomposing a graph into expanding subgraphs},
journal = {Random Struct. Algorithms},
volume = {52},
number = {1},
pages = {158--178},
year = {2018},
url = {https://doi.org/10.1002/rsa.20727},
doi = {10.1002/RSA.20727},
timestamp = {Fri, 01 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/MoshkovitzS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GishbolinerS18,
author = {Lior Gishboliner and
Asaf Shapira},
editor = {Anna R. Karlin},
title = {Efficient Testing without Efficient Regularity},
booktitle = {9th Innovations in Theoretical Computer Science Conference, {ITCS}
2018, January 11-14, 2018, Cambridge, MA, {USA}},
series = {LIPIcs},
volume = {94},
pages = {54:1--54:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2018.54},
doi = {10.4230/LIPICS.ITCS.2018.54},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/innovations/GishbolinerS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GishbolinerS18,
author = {Lior Gishboliner and
Asaf Shapira},
editor = {Ilias Diakonikolas and
David Kempe and
Monika Henzinger},
title = {A generalized Tur{\'{a}}n problem and its applications},
booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
pages = {760--772},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3188745.3188778},
doi = {10.1145/3188745.3188778},
timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GishbolinerS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GishbolinerS18,
author = {Lior Gishboliner and
Asaf Shapira},
title = {A Generalized Turan Problem and its Applications},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-007}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/007},
eprinttype = {ECCC},
eprint = {TR18-007},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GishbolinerS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LeviMRRS17,
author = {Reut Levi and
Guy Moshkovitz and
Dana Ron and
Ronitt Rubinfeld and
Asaf Shapira},
title = {Constructing near spanning trees with few local inspections},
journal = {Random Struct. Algorithms},
volume = {50},
number = {2},
pages = {183--200},
year = {2017},
url = {https://doi.org/10.1002/rsa.20652},
doi = {10.1002/RSA.20652},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/LeviMRRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GishbolinerS17,
author = {Lior Gishboliner and
Asaf Shapira},
editor = {Hamed Hatami and
Pierre McKenzie and
Valerie King},
title = {Removal lemmas with polynomial bounds},
booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
pages = {510--522},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3055399.3055404},
doi = {10.1145/3055399.3055404},
timestamp = {Sun, 02 Jun 2019 21:10:31 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GishbolinerS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1712-00831,
author = {Lior Gishboliner and
Asaf Shapira},
title = {A Generalized Tur{\'{a}}n Problem and its Applications},
journal = {CoRR},
volume = {abs/1712.00831},
year = {2017},
url = {http://arxiv.org/abs/1712.00831},
eprinttype = {arXiv},
eprint = {1712.00831},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1712-00831.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/MoshkovitzS16,
author = {Guy Moshkovitz and
Asaf Shapira},
title = {A short proof of Gowers' lower bound for the regularity lemma},
journal = {Comb.},
volume = {36},
number = {2},
pages = {187--194},
year = {2016},
url = {https://doi.org/10.1007/s00493-014-3166-4},
doi = {10.1007/S00493-014-3166-4},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/MoshkovitzS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/ShapiraY16,
author = {Asaf Shapira and
Raphael Yuster},
title = {Unavoidable tournaments},
journal = {J. Comb. Theory, Ser. {B}},
volume = {116},
pages = {191--207},
year = {2016},
url = {https://doi.org/10.1016/j.jctb.2015.07.005},
doi = {10.1016/J.JCTB.2015.07.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/ShapiraY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/ShapiraS15,
author = {Asaf Shapira and
Benny Sudakov},
title = {Small complete minors above the extremal edge density},
journal = {Comb.},
volume = {35},
number = {1},
pages = {75--94},
year = {2015},
url = {https://doi.org/10.1007/s00493-015-3013-2},
doi = {10.1007/S00493-015-3013-2},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/ShapiraS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/DellamonicaKMRS15,
author = {Domingos Dellamonica Jr. and
Subrahmanyam Kalyanasundaram and
Daniel M. Martin and
Vojtech R{\"{o}}dl and
Asaf Shapira},
title = {An Optimal Algorithm for Finding Frieze-Kannan Regular Partitions},
journal = {Comb. Probab. Comput.},
volume = {24},
number = {2},
pages = {407--437},
year = {2015},
url = {https://doi.org/10.1017/S0963548314000200},
doi = {10.1017/S0963548314000200},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/DellamonicaKMRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/MoshkovitzS15,
author = {Guy Moshkovitz and
Asaf Shapira},
title = {Exact bounds for some hypergraph saturation problems},
journal = {J. Comb. Theory, Ser. {B}},
volume = {111},
pages = {242--248},
year = {2015},
url = {https://doi.org/10.1016/j.jctb.2014.08.004},
doi = {10.1016/J.JCTB.2014.08.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/MoshkovitzS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BhattacharyyaGS15,
author = {Arnab Bhattacharyya and
Elena Grigorescu and
Asaf Shapira},
title = {A unified framework for testing linear-invariant properties},
journal = {Random Struct. Algorithms},
volume = {46},
number = {2},
pages = {232--260},
year = {2015},
url = {https://doi.org/10.1002/rsa.20507},
doi = {10.1002/RSA.20507},
timestamp = {Thu, 07 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BhattacharyyaGS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/MoshkovitzS15,
author = {Guy Moshkovitz and
Asaf Shapira},
editor = {Piotr Indyk},
title = {Decomposing a Graph Into Expanding Subgraphs},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {1283--1295},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.85},
doi = {10.1137/1.9781611973730.85},
timestamp = {Tue, 02 Feb 2021 17:07:30 +0100},
biburl = {https://dblp.org/rec/conf/soda/MoshkovitzS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LeviMRRS15,
author = {Reut Levi and
Guy Moshkovitz and
Dana Ron and
Ronitt Rubinfeld and
Asaf Shapira},
title = {Constructing Near Spanning Trees with Few Local Inspections},
journal = {CoRR},
volume = {abs/1502.00413},
year = {2015},
url = {http://arxiv.org/abs/1502.00413},
eprinttype = {arXiv},
eprint = {1502.00413},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LeviMRRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/LeviMRRS15,
author = {Reut Levi and
Guy Moshkovitz and
Dana Ron and
Ronitt Rubinfeld and
Asaf Shapira},
title = {Constructing Near Spanning Trees with Few Local Inspections},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-019}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/019},
eprinttype = {ECCC},
eprint = {TR15-019},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/LeviMRRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/CaroSY14,
author = {Yair Caro and
Asaf Shapira and
Raphael Yuster},
title = {Forcing {\textdollar}k{\textdollar}-repetitions in Degree Sequences},
journal = {Electron. J. Comb.},
volume = {21},
number = {1},
pages = {1},
year = {2014},
url = {https://doi.org/10.37236/3503},
doi = {10.37236/3503},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/CaroSY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CzumajGRSSS14,
author = {Artur Czumaj and
Oded Goldreich and
Dana Ron and
C. Seshadhri and
Asaf Shapira and
Christian Sohler},
title = {Finding cycles and trees in sublinear time},
journal = {Random Struct. Algorithms},
volume = {45},
number = {2},
pages = {139--184},
year = {2014},
url = {https://doi.org/10.1002/rsa.20462},
doi = {10.1002/RSA.20462},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CzumajGRSSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/HuangMSSY13,
author = {Hao Huang and
Jie Ma and
Asaf Shapira and
Benny Sudakov and
Raphael Yuster},
title = {Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles
in Eulerian Digraphs},
journal = {Comb. Probab. Comput.},
volume = {22},
number = {6},
pages = {859--873},
year = {2013},
url = {https://doi.org/10.1017/S0963548313000394},
doi = {10.1017/S0963548313000394},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/HuangMSSY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KalyanasundaramS13,
author = {Subrahmanyam Kalyanasundaram and
Asaf Shapira},
title = {A Note on Even Cycles and Quasirandom Tournaments},
journal = {J. Graph Theory},
volume = {73},
number = {3},
pages = {260--266},
year = {2013},
url = {https://doi.org/10.1002/jgt.21671},
doi = {10.1002/JGT.21671},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/KalyanasundaramS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GishbolinerS13,
author = {Lior Gishboliner and
Asaf Shapira},
title = {Deterministic vs Non-deterministic Graph Property Testing},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-059}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/059},
eprinttype = {ECCC},
eprint = {TR13-059},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GishbolinerS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BhattacharyyaGRS12,
author = {Arnab Bhattacharyya and
Elena Grigorescu and
Prasad Raghavendra and
Asaf Shapira},
title = {Testing Odd-Cycle-Freeness in Boolean Functions},
journal = {Comb. Probab. Comput.},
volume = {21},
number = {6},
pages = {835--855},
year = {2012},
url = {https://doi.org/10.1017/S0963548312000363},
doi = {10.1017/S0963548312000363},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/BhattacharyyaGRS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ShapiraY12,
author = {Asaf Shapira and
Raphael Yuster},
title = {The quasi-randomness of hypergraph cut properties},
journal = {Random Struct. Algorithms},
volume = {40},
number = {1},
pages = {105--131},
year = {2012},
url = {https://doi.org/10.1002/rsa.20364},
doi = {10.1002/RSA.20364},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ShapiraY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DellamonicaKMRS12,
author = {Domingos Dellamonica Jr. and
Subrahmanyam Kalyanasundaram and
Daniel M. Martin and
Vojtech R{\"{o}}dl and
Asaf Shapira},
title = {A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma},
journal = {{SIAM} J. Discret. Math.},
volume = {26},
number = {1},
pages = {15--29},
year = {2012},
url = {https://doi.org/10.1137/110846373},
doi = {10.1137/110846373},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/DellamonicaKMRS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BhattacharyyaGRS12,
author = {Arnab Bhattacharyya and
Elena Grigorescu and
Prasad Raghavendra and
Asaf Shapira},
editor = {Yuval Rabani},
title = {Testing odd-cycle-freeness in Boolean functions},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {1140--1149},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.90},
doi = {10.1137/1.9781611973099.90},
timestamp = {Tue, 02 Feb 2021 17:07:31 +0100},
biburl = {https://dblp.org/rec/conf/soda/BhattacharyyaGRS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-0816,
author = {Shiva Kintali and
Asaf Shapira},
title = {A Note on the Balanced ST-Connectivity},
journal = {CoRR},
volume = {abs/1204.0816},
year = {2012},
url = {http://arxiv.org/abs/1204.0816},
eprinttype = {arXiv},
eprint = {1204.0816},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1204-0816.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1208-3568,
author = {Asaf Shapira and
Benny Sudakov},
title = {Small Complete Minors Above the Extremal Edge Density},
journal = {CoRR},
volume = {abs/1208.3568},
year = {2012},
url = {http://arxiv.org/abs/1208.3568},
eprinttype = {arXiv},
eprint = {1208.3568},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1208-3568.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CzumajGRSSS12,
author = {Artur Czumaj and
Oded Goldreich and
Dana Ron and
C. Seshadhri and
Asaf Shapira and
Christian Sohler},
title = {Finding Cycles and Trees in Sublinear Time},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-035}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/035},
eprinttype = {ECCC},
eprint = {TR12-035},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CzumajGRSSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ShapiraYZ11,
author = {Asaf Shapira and
Raphael Yuster and
Uri Zwick},
title = {All-Pairs Bottleneck Paths in Vertex Weighted Graphs},
journal = {Algorithmica},
volume = {59},
number = {4},
pages = {621--633},
year = {2011},
url = {https://doi.org/10.1007/s00453-009-9328-x},
doi = {10.1007/S00453-009-9328-X},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ShapiraYZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Even-DarS11,
author = {Eyal Even{-}Dar and
Asaf Shapira},
title = {A note on maximizing the spread of influence in social networks},
journal = {Inf. Process. Lett.},
volume = {111},
number = {4},
pages = {184--187},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.11.015},
doi = {10.1016/J.IPL.2010.11.015},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Even-DarS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/RubinfeldS11,
author = {Ronitt Rubinfeld and
Asaf Shapira},
title = {Sublinear Time Algorithms},
journal = {{SIAM} J. Discret. Math.},
volume = {25},
number = {4},
pages = {1562--1588},
year = {2011},
url = {https://doi.org/10.1137/100791075},
doi = {10.1137/100791075},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/RubinfeldS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/RodittyS11,
author = {Liam Roditty and
Asaf Shapira},
title = {All-pairs shortest paths with a sublinear additive error},
journal = {{ACM} Trans. Algorithms},
volume = {7},
number = {4},
pages = {45:1--45:12},
year = {2011},
url = {https://doi.org/10.1145/2000807.2000813},
doi = {10.1145/2000807.2000813},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/RodittyS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DellamonicaKMRS11,
author = {Domingos Dellamonica Jr. and
Subrahmanyam Kalyanasundaram and
Daniel M. Martin and
Vojtech R{\"{o}}dl and
Asaf Shapira},
editor = {Leslie Ann Goldberg and
Klaus Jansen and
R. Ravi and
Jos{\'{e}} D. P. Rolim},
title = {A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
17-19, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6845},
pages = {495--506},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22935-0\_42},
doi = {10.1007/978-3-642-22935-0\_42},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/approx/DellamonicaKMRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CostelloST11,
author = {Kevin P. Costello and
Asaf Shapira and
Prasad Tetali},
editor = {Dana Randall},
title = {Randomized greedy: new variants of some classic approximation algorithms},
booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
2011},
pages = {647--655},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973082.50},
doi = {10.1137/1.9781611973082.50},
timestamp = {Tue, 02 Feb 2021 17:07:23 +0100},
biburl = {https://dblp.org/rec/conf/soda/CostelloST11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-1325,
author = {Arnab Bhattacharyya and
Elena Grigorescu and
Prasad Raghavendra and
Asaf Shapira},
title = {Testing Odd-Cycle-Freeness in Boolean Functions},
journal = {CoRR},
volume = {abs/1105.1325},
year = {2011},
url = {http://arxiv.org/abs/1105.1325},
eprinttype = {arXiv},
eprint = {1105.1325},
timestamp = {Thu, 07 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1105-1325.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BhattacharyyaGRS11,
author = {Arnab Bhattacharyya and
Elena Grigorescu and
Prasad Raghavendra and
Asaf Shapira},
title = {Testing Odd-Cycle-Freeness in Boolean Functions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-075}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/075},
eprinttype = {ECCC},
eprint = {TR11-075},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BhattacharyyaGRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/RubinfeldS11,
author = {Ronitt Rubinfeld and
Asaf Shapira},
title = {Sublinear Time Algorithms},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-013}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/013},
eprinttype = {ECCC},
eprint = {TR11-013},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/RubinfeldS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/NachmiasS10,
author = {Asaf Nachmias and
Asaf Shapira},
title = {Testing the expansion of a graph},
journal = {Inf. Comput.},
volume = {208},
number = {4},
pages = {309--314},
year = {2010},
url = {https://doi.org/10.1016/j.ic.2009.09.002},
doi = {10.1016/J.IC.2009.09.002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/NachmiasS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/ShapiraY10,
author = {Asaf Shapira and
Raphael Yuster},
title = {On the density of a graph and its blowup},
journal = {J. Comb. Theory, Ser. {B}},
volume = {100},
number = {6},
pages = {704--719},
year = {2010},
url = {https://doi.org/10.1016/j.jctb.2010.07.004},
doi = {10.1016/J.JCTB.2010.07.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/ShapiraY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ShapiraY10,
author = {Asaf Shapira and
Raphael Yuster},
title = {The effect of induced subgraphs on quasi-randomness},
journal = {Random Struct. Algorithms},
volume = {36},
number = {1},
pages = {90--109},
year = {2010},
url = {https://doi.org/10.1002/rsa.20289},
doi = {10.1002/RSA.20289},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ShapiraY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FischerMS10,
author = {Eldar Fischer and
Arie Matsliah and
Asaf Shapira},
title = {Approximate Hypergraph Partitioning and Applications},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {7},
pages = {3155--3185},
year = {2010},
url = {https://doi.org/10.1137/080717584},
doi = {10.1137/080717584},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FischerMS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BhattacharyyaGS10,
author = {Arnab Bhattacharyya and
Elena Grigorescu and
Asaf Shapira},
title = {A Unified Framework for Testing Linear-Invariant Properties},
booktitle = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2010, October 23-26, 2010, Las Vegas, Nevada, {USA}},
pages = {478--487},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/FOCS.2010.53},
doi = {10.1109/FOCS.2010.53},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BhattacharyyaGS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:conf/propertytesting/Shapira10,
author = {Asaf Shapira},
editor = {Oded Goldreich},
title = {Green's Conjecture and Testing Linear Invariant Properties},
booktitle = {Property Testing - Current Research and Surveys},
series = {Lecture Notes in Computer Science},
volume = {6390},
pages = {355--358},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-16367-8\_30},
doi = {10.1007/978-3-642-16367-8\_30},
timestamp = {Tue, 01 Jun 2021 15:22:56 +0200},
biburl = {https://dblp.org/rec/conf/propertytesting/Shapira10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-4230,
author = {Artur Czumaj and
Oded Goldreich and
Dana Ron and
C. Seshadhri and
Asaf Shapira and
Christian Sohler},
title = {Finding Cycles and Trees in Sublinear Time},
journal = {CoRR},
volume = {abs/1007.4230},
year = {2010},
url = {http://arxiv.org/abs/1007.4230},
eprinttype = {arXiv},
eprint = {1007.4230},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1007-4230.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1010-5016,
author = {Arnab Bhattacharyya and
Elena Grigorescu and
Asaf Shapira},
title = {A Unified Framework for Testing Linear-Invariant Properties},
journal = {CoRR},
volume = {abs/1010.5016},
year = {2010},
url = {http://arxiv.org/abs/1010.5016},
eprinttype = {arXiv},
eprint = {1010.5016},
timestamp = {Thu, 07 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1010-5016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BhattacharyyaGS10,
author = {Arnab Bhattacharyya and
Elena Grigorescu and
Asaf Shapira},
title = {A Unified Framework for Testing Linear-Invariant Properties},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-161}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/161},
eprinttype = {ECCC},
eprint = {TR10-161},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BhattacharyyaGS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/ShapiraY09,
author = {Asaf Shapira and
Raphael Yuster},
title = {Multigraphs (Only) Satisfy a Weak Triangle Removal Lemma},
journal = {Electron. J. Comb.},
volume = {16},
number = {1},
year = {2009},
url = {https://doi.org/10.37236/249},
doi = {10.37236/249},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/ShapiraY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CzumajSS09,
author = {Artur Czumaj and
Asaf Shapira and
Christian Sohler},
title = {Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs},
journal = {{SIAM} J. Comput.},
volume = {38},
number = {6},
pages = {2499--2510},
year = {2009},
url = {https://doi.org/10.1137/070681831},
doi = {10.1137/070681831},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CzumajSS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AlonFNS09,
author = {Noga Alon and
Eldar Fischer and
Ilan Newman and
Asaf Shapira},
title = {A Combinatorial Characterization of the Testable Graph Properties:
It's All About Regularity},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {1},
pages = {143--167},
year = {2009},
url = {https://doi.org/10.1137/060667177},
doi = {10.1137/060667177},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AlonFNS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AlonSS09,
author = {Noga Alon and
Asaf Shapira and
Uri Stav},
title = {Can a Graph Have Distinct Regular Partitions?},
journal = {{SIAM} J. Discret. Math.},
volume = {23},
number = {1},
pages = {278--287},
year = {2009},
url = {https://doi.org/10.1137/070695952},
doi = {10.1137/070695952},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AlonSS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Shapira09,
author = {Asaf Shapira},
editor = {Michael Mitzenmacher},
title = {Green's conjecture and testing linear-invariant properties},
booktitle = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing,
{STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009},
pages = {159--166},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1536414.1536438},
doi = {10.1145/1536414.1536438},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Shapira09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/LachishNS08,
author = {Oded Lachish and
Ilan Newman and
Asaf Shapira},
title = {Space Complexity Vs. Query Complexity},
journal = {Comput. Complex.},
volume = {17},
number = {1},
pages = {70--93},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0239-z},
doi = {10.1007/S00037-008-0239-Z},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/LachishNS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/AlonS08,
author = {Noga Alon and
Asaf Shapira},
title = {A separation theorem in property testing},
journal = {Comb.},
volume = {28},
number = {3},
pages = {261--281},
year = {2008},
url = {https://doi.org/10.1007/s00493-008-2321-1},
doi = {10.1007/S00493-008-2321-1},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/AlonS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Shapira08,
author = {Asaf Shapira},
title = {Quasi-randomness and the distribution of copies of a fixed graph},
journal = {Comb.},
volume = {28},
number = {6},
pages = {735--745},
year = {2008},
url = {https://doi.org/10.1007/s00493-008-2375-0},
doi = {10.1007/S00493-008-2375-0},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Shapira08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/AlonSS08,
author = {Noga Alon and
Oded Schwartz and
Asaf Shapira},
title = {An Elementary Construction of Constant-Degree Expanders},
journal = {Comb. Probab. Comput.},
volume = {17},
number = {3},
pages = {319--327},
year = {2008},
url = {https://doi.org/10.1017/S0963548307008851},
doi = {10.1017/S0963548307008851},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/AlonSS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AlonS08,
author = {Noga Alon and
Asaf Shapira},
title = {A Characterization of the (Natural) Graph Properties Testable with
One-Sided Error},
journal = {{SIAM} J. Comput.},
volume = {37},
number = {6},
pages = {1703--1727},
year = {2008},
url = {https://doi.org/10.1137/06064888X},
doi = {10.1137/06064888X},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AlonS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AlonS08a,
author = {Noga Alon and
Asaf Shapira},
title = {Every Monotone Graph Property Is Testable},
journal = {{SIAM} J. Comput.},
volume = {38},
number = {2},
pages = {505--522},
year = {2008},
url = {https://doi.org/10.1137/050633445},
doi = {10.1137/050633445},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AlonS08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/RodittyS08,
author = {Liam Roditty and
Asaf Shapira},
editor = {Luca Aceto and
Ivan Damg{\aa}rd and
Leslie Ann Goldberg and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Igor Walukiewicz},
title = {All-Pairs Shortest Paths with a Sublinear Additive Error},
booktitle = {Automata, Languages and Programming, 35th International Colloquium,
{ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
{I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
series = {Lecture Notes in Computer Science},
volume = {5125},
pages = {622--633},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70575-8\_51},
doi = {10.1007/978-3-540-70575-8\_51},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/RodittyS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ShapiraY08,
author = {Asaf Shapira and
Raphael Yuster},
editor = {Shang{-}Hua Teng},
title = {The effect of induced subgraphs on quasi-randomness},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {789--798},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347169},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/ShapiraY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BenjaminiSS08,
author = {Itai Benjamini and
Oded Schramm and
Asaf Shapira},
editor = {Cynthia Dwork},
title = {Every minor-closed property of sparse graphs is testable},
booktitle = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing,
Victoria, British Columbia, Canada, May 17-20, 2008},
pages = {393--402},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1374376.1374433},
doi = {10.1145/1374376.1374433},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BenjaminiSS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BenjaminiSS08,
author = {Itai Benjamini and
Oded Schramm and
Asaf Shapira},
title = {Every Minor-Closed Property of Sparse Graphs is Testable},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR08-010}},
year = {2008},
url = {https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-010/index.html},
eprinttype = {ECCC},
eprint = {TR08-010},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BenjaminiSS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/AlonSS07,
author = {Noga Alon and
Asaf Shapira and
Uri Stav},
editor = {Guohui Lin},
title = {Can a Graph Have Distinct Regular Partitions?},
booktitle = {Computing and Combinatorics, 13th Annual International Conference,
{COCOON} 2007, Banff, Canada, July 16-19, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4598},
pages = {428--438},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73545-8\_42},
doi = {10.1007/978-3-540-73545-8\_42},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/AlonSS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FischerMS07,
author = {Eldar Fischer and
Arie Matsliah and
Asaf Shapira},
title = {Approximate Hypergraph Partitioning and Applications},
booktitle = {48th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2007), October 20-23, 2007, Providence, RI, USA, Proceedings},
pages = {579--589},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/FOCS.2007.11},
doi = {10.1109/FOCS.2007.11},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FischerMS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AlonSS07,
author = {Noga Alon and
Oded Schwartz and
Asaf Shapira},
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {An elementary construction of constant-degree expanders},
booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
pages = {454--458},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383.1283431},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/soda/AlonSS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ShapiraYZ07,
author = {Asaf Shapira and
Raphael Yuster and
Uri Zwick},
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {All-pairs bottleneck paths in vertex weighted graphs},
booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
pages = {978--985},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383.1283488},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ShapiraYZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/Even-DarS07,
author = {Eyal Even{-}Dar and
Asaf Shapira},
editor = {Xiaotie Deng and
Fan Chung Graham},
title = {A Note on Maximizing the Spread of Influence in Social Networks},
booktitle = {Internet and Network Economics, Third International Workshop, {WINE}
2007, San Diego, CA, USA, December 12-14, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4858},
pages = {281--286},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77105-0\_27},
doi = {10.1007/978-3-540-77105-0\_27},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/wine/Even-DarS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CzumajSS07,
author = {Artur Czumaj and
Asaf Shapira and
Christian Sohler},
title = {Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR07-083}},
year = {2007},
url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-083/index.html},
eprinttype = {ECCC},
eprint = {TR07-083},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CzumajSS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/NachmiasS07,
author = {Asaf Nachmias and
Asaf Shapira},
title = {Testing the Expansion of a Graph},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR07-118}},
year = {2007},
url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-118/index.html},
eprinttype = {ECCC},
eprint = {TR07-118},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/NachmiasS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/il/Shapira06,
author = {Asaf Shapira},
title = {Graph propert testing and related problems},
school = {Tel Aviv University, Israel},
year = {2006},
url = {https://tau.primo.exlibrisgroup.com/permalink/972TAU\_INST/bai57q/alma990020799780204146},
timestamp = {Fri, 03 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/phd/il/Shapira06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/AlonS06,
author = {Noga Alon and
Asaf Shapira},
title = {On An Extremal Hypergraph Problem Of Brown, Erd{\"{o}}s And S{\'{o}}s},
journal = {Comb.},
volume = {26},
number = {6},
pages = {627--645},
year = {2006},
url = {https://doi.org/10.1007/s00493-006-0035-9},
doi = {10.1007/S00493-006-0035-9},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/AlonS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/AlonS06,
author = {Noga Alon and
Asaf Shapira},
title = {A Characterization of Easily Testable Induced Subgraphs},
journal = {Comb. Probab. Comput.},
volume = {15},
number = {6},
pages = {791--805},
year = {2006},
url = {https://doi.org/10.1017/S0963548306007759},
doi = {10.1017/S0963548306007759},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/AlonS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/LachishNS06,
author = {Oded Lachish and
Ilan Newman and
Asaf Shapira},
editor = {Josep D{\'{\i}}az and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Uri Zwick},
title = {Space Complexity vs. Query Complexity},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 9th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2006 and 10th International
Workshop on Randomization and Computation, {RANDOM} 2006, Barcelona,
Spain, August 28-30 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4110},
pages = {426--437},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11830924\_39},
doi = {10.1007/11830924\_39},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/LachishNS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AlonSS06,
author = {Noga Alon and
Asaf Shapira and
Benny Sudakov},
editor = {Michele Bugliesi and
Bart Preneel and
Vladimiro Sassone and
Ingo Wegener},
title = {Additive Approximation for Edge-Deletion Problems (Abstract)},
booktitle = {Automata, Languages and Programming, 33rd International Colloquium,
{ICALP} 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {4051},
pages = {1--2},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11786986\_1},
doi = {10.1007/11786986\_1},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AlonSS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Shapira06,
author = {Noga Alon and
Eldar Fischer and
Ilan Newman and
Asaf Shapira},
editor = {Jon M. Kleinberg},
title = {A combinatorial characterization of the testable graph properties:
it's all about regularity},
booktitle = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing,
Seattle, WA, USA, May 21-23, 2006},
pages = {251--260},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1132516.1132555},
doi = {10.1145/1132516.1132555},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Shapira06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AlonSS06,
author = {Noga Alon and
Oded Schwartz and
Asaf Shapira},
title = {An Elementary Construction of Constant-Degree Expanders},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-119}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-119/index.html},
eprinttype = {ECCC},
eprint = {TR06-119},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AlonSS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/LachishNS06,
author = {Oded Lachish and
Ilan Newman and
Asaf Shapira},
title = {Space Complexity vs. Query Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-103}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-103/index.html},
eprinttype = {ECCC},
eprint = {TR06-103},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/LachishNS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/AlonS05,
author = {Noga Alon and
Asaf Shapira},
title = {Linear Equations, Arithmetic Progressions and Hypergraph Property
Testing},
journal = {Theory Comput.},
volume = {1},
number = {1},
pages = {177--216},
year = {2005},
url = {https://doi.org/10.4086/toc.2005.v001a009},
doi = {10.4086/TOC.2005.V001A009},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/AlonS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlonSS05,
author = {Noga Alon and
Asaf Shapira and
Benny Sudakov},
title = {Additive Approximation for Edge-Deletion Problems},
booktitle = {46th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings},
pages = {419--428},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/SFCS.2005.11},
doi = {10.1109/SFCS.2005.11},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AlonSS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlonS05,
author = {Noga Alon and
Asaf Shapira},
title = {A Characterization of the (natural) Graph Properties Testable with
One-Sided Error},
booktitle = {46th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings},
pages = {429--438},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/SFCS.2005.5},
doi = {10.1109/SFCS.2005.5},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AlonS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AlonS05,
author = {Noga Alon and
Asaf Shapira},
title = {Linear equations, arithmetic progressions and hypergraph property
testing},
booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
23-25, 2005},
pages = {708--717},
publisher = {{SIAM}},
year = {2005},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070532},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/AlonS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlonS05,
author = {Noga Alon and
Asaf Shapira},
editor = {Harold N. Gabow and
Ronald Fagin},
title = {Every monotone graph property is testable},
booktitle = {Proceedings of the 37th Annual {ACM} Symposium on Theory of Computing,
Baltimore, MD, USA, May 22-24, 2005},
pages = {128--137},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1060590.1060611},
doi = {10.1145/1060590.1060611},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AlonS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-085,
author = {Asaf Shapira and
Noga Alon},
title = {Homomorphisms in Graph Property Testing - {A} Survey},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-085}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-085/index.html},
eprinttype = {ECCC},
eprint = {TR05-085},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-085.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/AlonS04,
author = {Noga Alon and
Asaf Shapira},
title = {Testing subgraphs in directed graphs},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {3},
pages = {354--382},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.04.008},
doi = {10.1016/J.JCSS.2004.04.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/AlonS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AlonS04,
author = {Noga Alon and
Asaf Shapira},
editor = {J. Ian Munro},
title = {A characterization of easily testable induced subgraphs},
booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
2004},
pages = {942--951},
publisher = {{SIAM}},
year = {2004},
url = {http://dl.acm.org/citation.cfm?id=982792.982934},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/AlonS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/AlonS03,
author = {Noga Alon and
Asaf Shapira},
title = {Testing satisfiability},
journal = {J. Algorithms},
volume = {47},
number = {2},
pages = {87--103},
year = {2003},
url = {https://doi.org/10.1016/S0196-6774(03)00019-1},
doi = {10.1016/S0196-6774(03)00019-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/AlonS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlonS03,
author = {Noga Alon and
Asaf Shapira},
editor = {Lawrence L. Larmore and
Michel X. Goemans},
title = {Testing subgraphs in directed graphs},
booktitle = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing,
June 9-11, 2003, San Diego, CA, {USA}},
pages = {700--709},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/780542.780644},
doi = {10.1145/780542.780644},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AlonS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AlonS02,
author = {Noga Alon and
Asaf Shapira},
editor = {David Eppstein},
title = {Testing satisfiability},
booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
pages = {645--654},
publisher = {{ACM/SIAM}},
year = {2002},
url = {http://dl.acm.org/citation.cfm?id=545381.545467},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/AlonS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
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
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
