The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Deryk Osthus: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Daniela Kühn, Deryk Osthus
    Critical chromatic number and the complexity of perfect packings in graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:851-859 [Conf]
  2. Daniela Kühn, Deryk Osthus
    Every Graph of Sufficiently Large Average Degree Contains a C4-Free Subgraph of Large Average Degree. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:24, n:1, pp:155-162 [Journal]
  3. Daniela Kühn, Deryk Osthus
    Induced Subdivisions In Ks, s-Free Graphs of Large Average Degree. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:24, n:2, pp:287-304 [Journal]
  4. Daniela Kühn, Deryk Osthus
    Complete Minors In Ks, s-Free Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:25, n:1, pp:49-64 [Journal]
  5. Deryk Osthus, Hans Jürgen Prömel, Anusch Taraz
    For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite? [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2003, v:23, n:1, pp:105-150 [Journal]
  6. Daniela Kühn, Deryk Osthus
    Large Topological Cliques in Graphs Without a 4-Cycle. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2004, v:13, n:1, pp:93-102 [Journal]
  7. Daniela Kühn, Deryk Osthus
    Subdivisions of Kr+2 in Graphs of Average Degree at Least r+epsilon and Large but Constant Girth. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2004, v:13, n:3, pp:361-371 [Journal]
  8. Daniela Kühn, Deryk Osthus
    Packings in Dense Regular Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2005, v:14, n:3, pp:325-337 [Journal]
  9. Pierce G. Buckley, Deryk Osthus
    Popularity based random graph models leading to a scale-free degree sequence. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:282, n:1-3, pp:53-68 [Journal]
  10. Daniela Kühn, Deryk Osthus
    Forcing unbalanced complete bipartite minors. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:1, pp:75-81 [Journal]
  11. Daniela Kühn, Deryk Osthus
    Topological Minors in Graphs of Large Girth. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:86, n:2, pp:364-380 [Journal]
  12. Daniela Kühn, Deryk Osthus
    Partitions of graphs with high minimum degree or connectivity. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:88, n:1, pp:29-43 [Journal]
  13. Daniela Kühn, Deryk Osthus
    Extremal connectivity for topological cliques in bipartite graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:1, pp:73-99 [Journal]
  14. Daniela Kühn, Deryk Osthus, Anusch Taraz
    Large planar subgraphs in dense graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:95, n:2, pp:263-282 [Journal]
  15. Deryk Osthus
    Maximum Antichains in Random Subsets of a Finite Set. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2000, v:90, n:2, pp:336-346 [Journal]
  16. Deryk Osthus, Hans Jürgen Prömel, Anusch Taraz
    On random planar graphs, the number of planar graphs and their triangulations. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:88, n:1, pp:119-134 [Journal]
  17. Daniela Kühn, Deryk Osthus
    Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:6, pp:767-821 [Journal]
  18. Yoshiharu Kohayakawa, Bernd Kreuter, Deryk Osthus
    The length of random subsets of Boolean lattices. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:16, n:2, pp:177-194 [Journal]
  19. Daniela Kühn, Deryk Osthus
    Minors in graphs of large girth. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2003, v:22, n:2, pp:213-225 [Journal]
  20. Deryk Osthus, Anusch Taraz
    Random maximal H-free graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2001, v:18, n:1, pp:61-82 [Journal]
  21. Daniela Kühn, Deryk Osthus
    Improved Bounds for Topological Cliques in Graphs of Large Girth. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2006, v:20, n:1, pp:62-78 [Journal]
  22. Daniela Kühn, Deryk Osthus
    Four-cycles in graphs without a given even cycle. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:48, n:2, pp:147-156 [Journal]
  23. Daniela Kühn, Deryk Osthus
    Spanning triangulations in graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:49, n:3, pp:205-233 [Journal]
  24. Daniela Kühn, Deryk Osthus
    Matchings in hypergraphs of large minimum degree. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:51, n:4, pp:269-280 [Journal]

  25. Embeddings and Ramsey numbers of sparse kappa-uniform hypergraphs. [Citation Graph (, )][DBLP]


  26. The minimum degree threshold for perfect graph packings. [Citation Graph (, )][DBLP]


  27. Maximizing Several Cuts Simultaneously. [Citation Graph (, )][DBLP]


  28. Linkedness and Ordered Cycles in Digraphs. [Citation Graph (, )][DBLP]


  29. A Dirac-Type Result on Hamilton Cycles in Oriented Graphs. [Citation Graph (, )][DBLP]


  30. Perfect packings with complete graphs minus an edge. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002