Alon, Noga; Snir, Sagi; Yuster, Raphael On the compatibility of quartet trees. (English) Zbl 1422.92095 Chekuri, Chandra (ed.), Proceedings of the 25th annual ACM-SIAM symposium on discrete algorithms, SODA 2014, Portland, OR, USA, January 5–7, 2014. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 535-545 (2014). MSC: 92D15 PDFBibTeX XMLCite \textit{N. Alon} et al., in: Proceedings of the 25th annual ACM-SIAM symposium on discrete algorithms, SODA 2014, Portland, OR, USA, January 5--7, 2014. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 535--545 (2014; Zbl 1422.92095) Full Text: DOI Link
Alon, Noga; Snir, Sagi; Yuster, Raphael On the compatibility of quartet trees. (English) Zbl 1349.92102 SIAM J. Discrete Math. 28, No. 3, 1493-1507 (2014). MSC: 92D15 05C90 PDFBibTeX XMLCite \textit{N. Alon} et al., SIAM J. Discrete Math. 28, No. 3, 1493--1507 (2014; Zbl 1349.92102) Full Text: DOI
Alon, Noga; Yuster, Raphael The Turán number of sparse spanning graphs. (English) Zbl 1301.05201 J. Comb. Theory, Ser. B 103, No. 3, 337-343 (2013). MSC: 05C42 05C07 05C35 PDFBibTeX XMLCite \textit{N. Alon} and \textit{R. Yuster}, J. Comb. Theory, Ser. B 103, No. 3, 337--343 (2013; Zbl 1301.05201) Full Text: DOI arXiv
Alon, Noga; Yuster, Raphael Matrix sparsification and nested dissection over arbitrary fields. (English) Zbl 1281.65074 J. ACM 60, No. 4, Article No. 25, 18 p. (2013). MSC: 65F50 PDFBibTeX XMLCite \textit{N. Alon} and \textit{R. Yuster}, J. ACM 60, No. 4, Article No. 25, 18 p. (2013; Zbl 1281.65074)
Alon, Noga; Hall, H. Tracy; Knauer, Christian; Pinchasi, Rom; Yuster, Raphael On graphs and algebraic graphs that do not contain cycles of length 4. (English) Zbl 1232.05102 J. Graph Theory 68, No. 2, 91-102 (2011). MSC: 05C35 05C38 PDFBibTeX XMLCite \textit{N. Alon} et al., J. Graph Theory 68, No. 2, 91--102 (2011; Zbl 1232.05102) Full Text: DOI
Alon, Noga; Yuster, Raphael Fast algorithms for maximum subset matching and all-pairs shortest paths in graphs with a (not so) small vertex cover. (English) Zbl 1151.05329 Arge, Lars (ed.) et al., Algorithms – ESA 2007. 15th annual European symposium, Eilat, Israel, October 8–10, 2007, Proceedings. Berlin: Springer (ISBN 978-3-540-75519-7/pbk). Lecture Notes in Computer Science 4698, 175-186 (2007). MSC: 05C85 05C35 05C70 68Q25 68W20 PDFBibTeX XMLCite \textit{N. Alon} and \textit{R. Yuster}, Lect. Notes Comput. Sci. 4698, 175--186 (2007; Zbl 1151.05329) Full Text: DOI
Alon, Noga; Yuster, Raphael The number of oriantations having no fixed tournament. (English) Zbl 1107.05040 Combinatorica 26, No. 1, 1-16 (2006). Reviewer: Václav Koubek (Praha) MSC: 05C20 05C30 PDFBibTeX XMLCite \textit{N. Alon} and \textit{R. Yuster}, Combinatorica 26, No. 1, 1--16 (2006; Zbl 1107.05040) Full Text: DOI
Alon, Noga; Yuster, Raphael On a hypergraph matching problem. (English) Zbl 1090.05051 Graphs Comb. 21, No. 4, 377-384 (2005). MSC: 05C65 05C70 PDFBibTeX XMLCite \textit{N. Alon} and \textit{R. Yuster}, Graphs Comb. 21, No. 4, 377--384 (2005; Zbl 1090.05051) Full Text: DOI
Alon, N.; Kaplan, G.; Lev, A.; Roditty, Y.; Yuster, R. Dense graphs are antimagic. (English) Zbl 1055.05132 J. Graph Theory 47, No. 4, 297-309 (2004). MSC: 05C78 PDFBibTeX XMLCite \textit{N. Alon} et al., J. Graph Theory 47, No. 4, 297--309 (2004; Zbl 1055.05132) Full Text: DOI arXiv
Alon, Noga; Litsyn, Simon; Yuster, Raphael A coding theory bound and zero-sum square matrices. (English) Zbl 1037.94012 Graphs Comb. 19, No. 4, 449-457 (2003). MSC: 94B65 15B33 15A45 PDFBibTeX XMLCite \textit{N. Alon} et al., Graphs Comb. 19, No. 4, 449--457 (2003; Zbl 1037.94012) Full Text: DOI
Alon, Noga; Yuster, Raphael Every \(H\)-decomposition of \(K_n\) has a nearly resolvable alternative. (English) Zbl 0966.05058 Eur. J. Comb. 21, No. 7, 839-845 (2000). Reviewer: Katherine Heinrich (Regina) MSC: 05C70 PDFBibTeX XMLCite \textit{N. Alon} and \textit{R. Yuster}, Eur. J. Comb. 21, No. 7, 839--845 (2000; Zbl 0966.05058) Full Text: DOI
Alon, Noga; Caro, Yair; Yuster, Raphael Packing and covering dense graphs. (English) Zbl 0914.05013 J. Comb. Des. 6, No. 6, 451-472 (1998). Reviewer: J.H.Dinitz (Burlington) MSC: 05B40 05C70 PDFBibTeX XMLCite \textit{N. Alon} et al., J. Comb. Des. 6, No. 6, 451--472 (1998; Zbl 0914.05013) Full Text: DOI
Alon, N.; Yuster, R.; Zwick, U. Finding and counting given length cycles. (English) Zbl 0865.68093 Algorithmica 17, No. 3, 209-223 (1997). MSC: 68R10 PDFBibTeX XMLCite \textit{N. Alon} et al., Algorithmica 17, No. 3, 209--223 (1997; Zbl 0865.68093) Full Text: DOI
Alon, Noga; Caro, Yair; Yuster, Raphael Covering the edges of a graph by a prescribed tree with minimum overlap. (English) Zbl 0906.05053 J. Comb. Theory, Ser. B 71, No. 2, 144-161 (1997). Reviewer: Michael Raines (Kalamazoo) MSC: 05C70 05C05 68R10 PDFBibTeX XMLCite \textit{N. Alon} et al., J. Comb. Theory, Ser. B 71, No. 2, 144--161 (1997; Zbl 0906.05053) Full Text: DOI
Alon, Noga; Yuster, Raphael Threshold functions for \(H\)-factors. (English) Zbl 0874.05042 Bollobás, Béla (ed.) et al., Combinatorics, geometry and probability. A tribute to Paul Erdős. Proceedings of the conference dedicated to Paul Erdős on the occasion of his 80th birthday, Cambridge, UK, 26 March 1993. Cambridge: Cambridge University Press. 63-70 (1997). MSC: 05C70 05C80 PDFBibTeX XMLCite \textit{N. Alon} and \textit{R. Yuster}, in: Combinatorics, geometry and probability. A tribute to Paul Erdős. Proceedings of the conference dedicated to Paul Erdős on the occasion of his 80th birthday, Cambridge, UK, 26 March 1993. Cambridge: Cambridge University Press. 63--70 (1997; Zbl 0874.05042)
Alon, Noga; Yuster, Raphael \(H\)-factors in dense graphs. (English) Zbl 0855.05085 J. Comb. Theory, Ser. B 66, No. 2, 269-282 (1996). Reviewer: N.Alon and R.Yuster (Tel Aviv) MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{N. Alon} and \textit{R. Yuster}, J. Comb. Theory, Ser. B 66, No. 2, 269--282 (1996; Zbl 0855.05085) Full Text: DOI
Alon, Noga; Yuster, Raphael The 123 theorem and its extensions. (English) Zbl 0834.60015 J. Comb. Theory, Ser. A 72, No. 2, 322-331 (1995). MSC: 60C05 60E15 PDFBibTeX XMLCite \textit{N. Alon} and \textit{R. Yuster}, J. Comb. Theory, Ser. A 72, No. 2, 322--331 (1995; Zbl 0834.60015) Full Text: DOI
Alon, Noga; Yuster, Raphael; Zwick, Uri Color-coding. (English) Zbl 0885.68116 J. Assoc. Comput. Mach. 42, No. 4, 844-856 (1995). MSC: 68R10 PDFBibTeX XMLCite \textit{N. Alon} et al., J. Assoc. Comput. Mach. 42, No. 4, 844--856 (1995; Zbl 0885.68116) Full Text: DOI
Alon, N.; Duke, Richard A.; Lefmann, Hanno; Rödl, Vojtěch; Yuster, R. The algorithmic aspects of the regularity lemma. (English) Zbl 0794.05119 J. Algorithms 16, No. 1, 80-109 (1994). Reviewer: M.Loebl (Waterloo / Ontario) MSC: 05C85 68R05 05C99 PDFBibTeX XMLCite \textit{N. Alon} et al., J. Algorithms 16, No. 1, 80--109 (1994; Zbl 0794.05119) Full Text: DOI Link Backlinks: MO
Alon, Noga; Yuster, Raphael Threshold functions for \(H\)-factors. (English) Zbl 0794.05098 Comb. Probab. Comput. 2, No. 2, 137-144 (1993). MSC: 05C70 05C80 PDFBibTeX XMLCite \textit{N. Alon} and \textit{R. Yuster}, Comb. Probab. Comput. 2, No. 2, 137--144 (1993; Zbl 0794.05098) Full Text: DOI
Alon, Noga; Yuster, Raphael Almost \(H\)-factors in dense graphs. (English) Zbl 0769.05072 Graphs Comb. 8, No. 2, 95-102 (1992). Reviewer: P.Reichensperger (Oberasbach) MSC: 05C70 PDFBibTeX XMLCite \textit{N. Alon} and \textit{R. Yuster}, Graphs Comb. 8, No. 2, 95--102 (1992; Zbl 0769.05072) Full Text: DOI
Alon, N.; Duke, Richard A.; Lefmann, Hanno; Rödl, Vojtěch; Yuster, R. The algorithmic aspects of the regularity lemma (extended abstract). (English) Zbl 0915.05102 33rd annual symposium on Foundations of computer science (FOCS). Proceedings, Pittsburgh, PA, USA, October 24–27, 1992. Washington, DC: IEEE Computer Society Press, 473-481 (1992). MSC: 05C85 05C70 68R10 PDFBibTeX XMLCite \textit{N. Alon} et al., in: 33rd annual symposium on Foundations of computer science (FOCS). Proceedings, Pittsburgh, PA, USA, October 24--27, 1992. Washington, DC: IEEE Computer Society Press. 473--481 (1992; Zbl 0915.05102)