×

Found 22 Documents (Results 1–22)

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
Full Text: DOI Link

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).
PDFBibTeX XMLCite
Full Text: DOI

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

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

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field