Combinatorics, Probability and Computing, ‎0963-5483

Journal

Publications

  1. 2013
  2. Published

    Embedding Spanning Bipartite Graphs of Small Bandwidth

    Andrew Treglown, 1 Jan 2013, In: Combinatorics, Probability and Computing. 22, 01, p. 71-96 26 p.

    Research output: Contribution to journalArticlepeer-review

  3. Published

    Optimal packings of Hamilton cycles in graphs of high minimum degree

    Daniela Kuhn, & Deryk Osthus, 2013, In: Combinatorics, Probability and Computing. 22, p. 394-416 23 p.

    Research output: Contribution to journalArticlepeer-review

  4. Published
  5. 2011
  6. Published

    3-Connected Cores In Random Planar Graphs

    Nikolaos Fountoulakis & , 1 May 2011, In: Combinatorics, Probability and Computing. 20, 03, p. 381-412 32 p.

    Research output: Contribution to journalArticle

  7. 2010
  8. Published

    Tight Bounds for Blind Search on the Integers and the Reals

    Jon Rowe, & , 1 Nov 2010, In: Combinatorics, Probability and Computing. 19, 5-6, p. 711-728 18 p.

    Research output: Contribution to journalArticle

  9. Published

    Playing to Retain the Advantage

    Dan Hefetz & , 1 Jul 2010, In: Combinatorics, Probability and Computing. 19, 4, p. 481-491 11 p.

    Research output: Contribution to journalArticle

  10. 2008
  11. Published
  12. Published

    Linkedness and Ordered Cycles in Digraphs

    Daniela Kuhn & Deryk Osthus, 1 May 2008, In: Combinatorics, Probability and Computing. 17, 03

    Research output: Contribution to journalArticle

  13. 2007
  14. Published

    Maximizing Several Cuts Simultaneously

    Daniela Kuhn & Deryk Osthus, 1 Mar 2007, In: Combinatorics, Probability and Computing. 16, 02, p. 277-283 7 p.

    Research output: Contribution to journalArticle

  15. 2005
  16. Published

    Packings in dense regular graphs

    Daniela Kuhn & Deryk Osthus, 1 May 2005, In: Combinatorics, Probability and Computing. 14, p. 325-337 13 p.

    Research output: Contribution to journalArticle

  17. 2004
  18. Published

    Large topological cliques in graphs without a 4-cycle

    Deryk Osthus & Daniela Kuhn, 1 Jan 2004, In: Combinatorics, Probability and Computing. 13, p. 93-102 10 p.

    Research output: Contribution to journalArticle

  19. Published
Previous 1 2 Next