| 2007 |
|---|
| 14 | EE | Julia Böttcher,
Mathias Schacht,
Anusch Taraz:
On the bandwidth conjecture for 3-colourable graphs.
SODA 2007: 618-626 |
| 2006 |
|---|
| 13 | EE | Michael Behrisch,
Anusch Taraz:
Efficiently covering complex networks with cliques of similar vertices.
Theor. Comput. Sci. 355(1): 37-47 (2006) |
| 2005 |
|---|
| 12 | EE | Oleg Pikhurko,
Anusch Taraz:
Degree Sequences of F-Free Graphs.
Electr. J. Comb. 12: (2005) |
| 11 | EE | Daniela Kühn,
Deryk Osthus,
Anusch Taraz:
Large planar subgraphs in dense graphs.
J. Comb. Theory, Ser. B 95(2): 263-282 (2005) |
| 2004 |
|---|
| 10 | EE | Amin Coja-Oghlan,
Anusch Taraz:
Exact and approximative algorithms for coloring G(n, p).
Random Struct. Algorithms 24(3): 259-278 (2004) |
| 2003 |
|---|
| 9 | EE | Amin Coja-Oghlan,
Anusch Taraz:
Colouring Random Graphs in Expected Polynomial Time.
STACS 2003: 487-498 |
| 8 | EE | Deryk Osthus,
Hans Jürgen Prömel,
Anusch Taraz:
For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite?
Combinatorica 23(1): 105-150 (2003) |
| 7 | EE | Deryk Osthus,
Hans Jürgen Prömel,
Anusch Taraz:
On random planar graphs, the number of planar graphs and their triangulations.
J. Comb. Theory, Ser. B 88(1): 119-134 (2003) |
| 2001 |
|---|
| 6 | EE | Hans Jürgen Prömel,
Anusch Taraz:
Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders.
Computational Discrete Mathematics 2001: 98-118 |
| 5 | | Hans Jürgen Prömel,
Angelika Steger,
Anusch Taraz:
Counting Partial Orders With A Fixed Number Of Comparable Pairs.
Combinatorics, Probability & Computing 10(2): (2001) |
| 4 | EE | Hans Jürgen Prömel,
Angelika Steger,
Anusch Taraz:
Asymptotic enumeration, global structure, and constrained evolution.
Discrete Mathematics 229(1-3): 213-233 (2001) |
| 3 | EE | Hans Jürgen Prömel,
Angelika Steger,
Anusch Taraz:
Phase Transitions in the Evolution of Partial Orders.
J. Comb. Theory, Ser. A 94(2): 230-275 (2001) |
| 2 | | Deryk Osthus,
Anusch Taraz:
Random maximal H-free graphs.
Random Struct. Algorithms 18(1): 61-82 (2001) |
| 1999 |
|---|
| 1 | | Vojtech Rödl,
Andrzej Rucinski,
Anusch Taraz:
Hypergraph Packing And Graph Embedding.
Combinatorics, Probability & Computing 8(4): (1999) |
