Anusch Taraz

2008
19	EE	Julia Böttcher, Klaas P. Pruessmann, Anusch Taraz, Andreas Würfl: Bandwidth, treewidth, separators, expansion, and universality. Electronic Notes in Discrete Mathematics 31: 91-96 (2008)
18	EE	Julia Böttcher, Mathias Schacht, Anusch Taraz: Spanning 3-colourable subgraphs of small bandwidth in dense graphs. J. Comb. Theory, Ser. B 98(4): 752-777 (2008)
17	EE	Stefanie Gerke, Dirk Schlatter, Angelika Steger, Anusch Taraz: The random planar graph process. Random Struct. Algorithms 32(2): 236-261 (2008)
2007
16	EE	Julia Böttcher, Mathias Schacht, Anusch Taraz: On the bandwidth conjecture for 3-colourable graphs. SODA 2007: 618-626
15	EE	Julia Böttcher, Mathias Schacht, Anusch Taraz: Embedding spanning subgraphs of small bandwidth. Electronic Notes in Discrete Mathematics 29: 485-489 (2007)
2006
14	EE	Michael Behrisch, Anusch Taraz: Efficiently covering complex networks with cliques of similar vertices. Theor. Comput. Sci. 355(1): 37-47 (2006)
2005
13	EE	Oleg Pikhurko, Anusch Taraz: Degree Sequences of F-Free Graphs. Electr. J. Comb. 12: (2005)
12	EE	Mathias Schacht, Anusch Taraz: Globally bounded local edge colourings of hypergraphs. Electronic Notes in Discrete Mathematics 19: 179-185 (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)

Coauthor Index

1	Michael Behrisch	[14]
2	Julia Böttcher	[15] [16] [18] [19]
3	Amin Coja-Oghlan	[9] [10]
4	Stefanie Gerke	[17]
5	Daniela Kühn	[11]
6	Deryk Osthus	[2] [7] [8] [11]
7	Oleg Pikhurko	[13]
8	Hans Jürgen Prömel	[3] [4] [5] [6] [7] [8]
9	Klaas P. Pruessmann	[19]
10	Vojtech Rödl	[1]
11	Andrzej Rucinski	[1]
12	Mathias Schacht	[12] [15] [16] [18]
13	Dirk Schlatter	[17]
14	Angelika Steger	[3] [4] [5] [17]
15	Andreas Würfl	[19]