Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Anusch Taraz
2010 – today
- 2012
[b1]Anusch Taraz: Diskrete Mathematik - Grundlagen und Methoden. Mathematik Kompakt, Birkhäuser 2012, ISBN 978-3-7643-8898-0, pp. I-IX, 1-137- [j24]Julia Böttcher, Anusch Taraz, Andreas Würfl: Perfect Graphs of Fixed Density: Counting and Homogeneous Sets. Combinatorics, Probability & Computing 21(5): 661-682 (2012)
- 2011
- [j23]Julia Böttcher, Anusch Taraz, Andreas Würfl: Induced C5-free graphs of fixed density: counting and homogeneous sets. Electronic Notes in Discrete Mathematics 38: 181-186 (2011)
- 2010
- [j22]Julia Böttcher, Klaas P. Pruessmann, Anusch Taraz, Andreas Würfl: Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs. Eur. J. Comb. 31(5): 1217-1227 (2010)
- [j21]Julia Böttcher, Peter Heinig, Anusch Taraz: Embedding into Bipartite Graphs. SIAM J. Discrete Math. 24(4): 1215-1233 (2010)
2000 – 2009
- 2009
- [j20]Julia Böttcher, Yoshiharu Kohayakawa, Anusch Taraz: Almost spanning subgraphs of random graphs after adversarial edge removal. Electronic Notes in Discrete Mathematics 35: 335-340 (2009)
- [j19]Michael Behrisch, Anusch Taraz, Michael Ueckerdt: Coloring Random Intersection Graphs and Complex Networks. SIAM J. Discrete Math. 23(1): 288-299 (2009)
- 2008
- [j18]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)
- [j17]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)
- [j16]Stefanie Gerke, Dirk Schlatter, Angelika Steger, Anusch Taraz: The random planar graph process. Random Struct. Algorithms 32(2): 236-261 (2008)
- 2007
- [j15]Stefanie Gerke, Hans Jürgen Prömel, Thomas Schickinger, Angelika Steger, Anusch Taraz: K 4-free subgraphs of random graphs revisited. Combinatorica 27(3): 329-365 (2007)
- [j14]Julia Böttcher, Mathias Schacht, Anusch Taraz: Embedding spanning subgraphs of small bandwidth. Electronic Notes in Discrete Mathematics 29: 485-489 (2007)
- [c3]Julia Böttcher, Mathias Schacht, Anusch Taraz: On the bandwidth conjecture for 3-colourable graphs. SODA 2007: 618-626
- 2006
- [j13]Michael Behrisch, Anusch Taraz: Efficiently covering complex networks with cliques of similar vertices. Theor. Comput. Sci. 355(1): 37-47 (2006)
- 2005
- [j12]
- [j11]Mathias Schacht, Anusch Taraz: Globally bounded local edge colourings of hypergraphs. Electronic Notes in Discrete Mathematics 19: 179-185 (2005)
- [j10]Daniela Kühn, Deryk Osthus, Anusch Taraz: Large planar subgraphs in dense graphs. J. Comb. Theory, Ser. B 95(2): 263-282 (2005)
- 2004
- [j9]Amin Coja-Oghlan, Anusch Taraz: Exact and approximative algorithms for coloring G(n, p). Random Struct. Algorithms 24(3): 259-278 (2004)
- 2003
- [j8]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)
- [j7]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)
- [c2]Amin Coja-Oghlan, Anusch Taraz: Colouring Random Graphs in Expected Polynomial Time. STACS 2003: 487-498
- 2001
- [j6]Hans Jürgen Prömel, Angelika Steger, Anusch Taraz: Counting Partial Orders With A Fixed Number Of Comparable Pairs. Combinatorics, Probability & Computing 10(2): 159-177 (2001)
- [j5]Hans Jürgen Prömel, Angelika Steger, Anusch Taraz: Asymptotic enumeration, global structure, and constrained evolution. Discrete Mathematics 229(1-3): 213-233 (2001)
- [j4]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)
- [j3]Deryk Osthus, Hans Jürgen Prömel, Anusch Taraz: Almost all graphs with high girth and suitable density have high chromatic number. Journal of Graph Theory 37(4): 220-226 (2001)
- [j2]Deryk Osthus, Anusch Taraz: Random maximal H-free graphs. Random Struct. Algorithms 18(1): 61-82 (2001)
- [c1]Hans Jürgen Prömel, Anusch Taraz: Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders. Computational Discrete Mathematics 2001: 98-118
1990 – 1999
- 1999
- [j1]Vojtech Rödl, Andrzej Rucinski, Anusch Taraz: Hypergraph Packing And Graph Embedding. Combinatorics, Probability & Computing 8(4): 363-376 (1999)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-05 22:15 CEST by the dblp team