×

Found 10 Documents (Results 1–10)

Fair partitions. (English) Zbl 07784184

Nixon, Anthony (ed.) et al., Surveys in combinatorics 2022. Papers based on the 29th British combinatorial conference, Lancaster University, Lancaster, UK, July 11–15, 2022. Cambridge: Cambridge University Press. Lond. Math. Soc. Lect. Note Ser. 481, 1-20 (2022).
MSC:  05C70 05C85
PDFBibTeX XMLCite
Full Text: DOI

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

Routing permutations on graphs via matchings. (English) Zbl 1310.68155

Proceedings of the 25th annual ACM symposium on theory of computing, STOC ’93. San Diego, CA, USA, May 16–18, 1993. New York, NY: Association for Computing Machinery (ACM) (ISBN 0-89791-591-7). 583-591 (1993).
PDFBibTeX XMLCite
Full Text: DOI

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

Main Field