Search the dblp DataBase

Publications of Author

1. Hans Jürgen Prömel, Anusch Taraz
   Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders. [Citation Graph (0, 0)][DBLP]
   Computational Discrete Mathematics, 2001, pp:98-118 [Conf]
   
2. Amin Coja-Oghlan, Anusch Taraz
   Colouring Random Graphs in Expected Polynomial Time. [Citation Graph (0, 0)][DBLP]
   STACS, 2003, pp:487-498 [Conf]
   
3. 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]
   
4. Hans Jürgen Prömel, Angelika Steger, Anusch Taraz
   Counting Partial Orders With A Fixed Number Of Comparable Pairs. [Citation Graph (0, 0)][DBLP]
   Combinatorics, Probability & Computing, 2001, v:10, n:2, pp:- [Journal]
   
5. Vojtech Rödl, Andrzej Rucinski, Anusch Taraz
   Hypergraph Packing And Graph Embedding. [Citation Graph (0, 0)][DBLP]
   Combinatorics, Probability & Computing, 1999, v:8, n:4, pp:- [Journal]
   
6. Hans Jürgen Prömel, Angelika Steger, Anusch Taraz
   Asymptotic enumeration, global structure, and constrained evolution. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:229, n:1-3, pp:213-233 [Journal]
   
7. 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]
   
8. 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]
   
9. Hans Jürgen Prömel, Angelika Steger, Anusch Taraz
   Phase Transitions in the Evolution of Partial Orders. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. A, 2001, v:94, n:2, pp:230-275 [Journal]
   
10. Amin Coja-Oghlan, Anusch Taraz
    Exact and approximative algorithms for coloring G(n, p). [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:24, n:3, pp:259-278 [Journal]
    
11. 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]
    
12. Michael Behrisch, Anusch Taraz
    Efficiently covering complex networks with cliques of similar vertices. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:355, n:1, pp:37-47 [Journal]
    
13. Julia Böttcher, Mathias Schacht, Anusch Taraz
    On the bandwidth conjecture for 3-colourable graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:618-626 [Conf]
    
14. 
    K ₄-free subgraphs of random graphs revisited. [Citation Graph (, )][DBLP]
    
    
15. 
    Degree Sequences of F-Free Graphs. [Citation Graph (, )][DBLP]
    
    
16. 
    Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs. [Citation Graph (, )][DBLP]