Alon, Noga; Jartoux, Bruno; Keller, Chaya; Smorodinsky, Shakhar; Yuditsky, Yelena The \(\varepsilon\)-\(t\)-net problem. (English) Zbl 1495.05197 Discrete Comput. Geom. 68, No. 2, 618-644 (2022). MSC: 05C65 52A35 PDFBibTeX XMLCite \textit{N. Alon} et al., Discrete Comput. Geom. 68, No. 2, 618--644 (2022; Zbl 1495.05197) Full Text: DOI
Alon, Noga; Mehrabian, Abbas Chasing a fast robber on planar graphs and random graphs. (English) Zbl 1305.05142 J. Graph Theory 78, No. 2, 81-96 (2015). MSC: 05C57 05C10 05C80 05C69 91A43 91A24 PDFBibTeX XMLCite \textit{N. Alon} and \textit{A. Mehrabian}, J. Graph Theory 78, No. 2, 81--96 (2015; Zbl 1305.05142) Full Text: DOI
Alon, Noga; Prałat, Paweł Chasing robbers on random geometric graphs-an alternative approach. (English) Zbl 1300.05176 Discrete Appl. Math. 178, 149-152 (2014). MSC: 05C57 05C80 91A43 91A24 PDFBibTeX XMLCite \textit{N. Alon} and \textit{P. Prałat}, Discrete Appl. Math. 178, 149--152 (2014; Zbl 1300.05176) Full Text: DOI arXiv
Alon, Noga; Balogh, József; Bollobás, Béla; Morris, Robert The structure of almost all graphs in a hereditary property. (English) Zbl 1217.05193 J. Comb. Theory, Ser. B 101, No. 2, 85-110 (2011). Reviewer: Anders Sune Pedersen (Aarhus) MSC: 05C75 05C80 05C78 05C15 PDFBibTeX XMLCite \textit{N. Alon} et al., J. Comb. Theory, Ser. B 101, No. 2, 85--110 (2011; Zbl 1217.05193) Full Text: DOI arXiv
Alon, Noga; Bollobás, Béla; Krivelevich, Michael; Sudakov, Benny Maximum cuts and judicious partitions in graphs without short cycles. (English) Zbl 1030.05060 J. Comb. Theory, Ser. B 88, No. 2, 329-346 (2003). Reviewer: Béla Andrásfai (Budapest) MSC: 05C35 PDFBibTeX XMLCite \textit{N. Alon} et al., J. Comb. Theory, Ser. B 88, No. 2, 329--346 (2003; Zbl 1030.05060) Full Text: DOI