Hypergraph Packing And Graph Embedding. - Vojtech Rödl; Andrzej Rucinski 001; Anusch Taraz (Comb. Probab. Comput., 1999)

Phase transitions in the evolution of partially ordered sets - Anusch Taraz (1999)

Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders. - Hans Jürgen Prömel; Anusch Taraz (Computational Discrete Mathematics, 2001)

Counting Partial Orders With A Fixed Number Of Comparable Pairs. - Hans Jürgen Prömel; Angelika Steger; Anusch Taraz (Comb. Probab. Comput., 2001)

Asymptotic enumeration, global structure, and constrained evolution. - Hans Jürgen Prömel; Angelika Steger; Anusch Taraz (Discret. Math., 2001)

Phase Transitions in the Evolution of Partial Orders. - Hans Jürgen Prömel; Angelika Steger; Anusch Taraz (J. Comb. Theory A, 2001)

Almost all graphs with high girth and suitable density have high chromatic number. - Deryk Osthus; Hans Jürgen Prömel; Anusch Taraz (J. Graph Theory, 2001)

Random maximal H-free graphs. - Deryk Osthus; Anusch Taraz (Random Struct. Algorithms, 2001)

Colouring Random Graphs in Expected Polynomial Time. - Amin Coja-Oghlan; Anusch Taraz (STACS, 2003)

For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite? - Deryk Osthus; Hans Jürgen Prömel; Anusch Taraz (Comb., 2003)

On random planar graphs, the number of planar graphs and their triangulations. - Deryk Osthus; Hans Jürgen Prömel; Anusch Taraz (J. Comb. Theory B, 2003)

Exact and approximative algorithms for coloring G(n, p). - Amin Coja-Oghlan; Anusch Taraz (Random Struct. Algorithms, 2004)

Degree Sequences of F-Free Graphs. - Oleg Pikhurko; Anusch Taraz (Electron. J. Comb., 2005)

Globally bounded local edge colourings of hypergraphs. - Mathias Schacht; Anusch Taraz (Electron. Notes Discret. Math., 2005)

Large planar subgraphs in dense graphs. - Daniela Kühn; Deryk Osthus; Anusch Taraz (J. Comb. Theory B, 2005)

Efficiently covering complex networks with cliques of similar vertices. - Michael Behrisch 002; Anusch Taraz (Theor. Comput. Sci., 2006)

On the bandwidth conjecture for 3-colourable graphs. - Julia Böttcher; Mathias Schacht; Anusch Taraz (SODA, 2007)

K 4-free subgraphs of random graphs revisited. - Stefanie Gerke; Hans Jürgen Prömel; Thomas Schickinger; Angelika Steger; Anusch Taraz (Comb., 2007)

Embedding spanning subgraphs of small bandwidth. - Julia Böttcher; Mathias Schacht; Anusch Taraz (Electron. Notes Discret. Math., 2007)

Bandwidth, treewidth, separators, expansion, and universality. - Julia Böttcher; Klaas Paul Pruessmann; Anusch Taraz; Andreas Würfl (Electron. Notes Discret. Math., 2008)

Spanning 3-colourable subgraphs of small bandwidth in dense graphs. - Julia Böttcher; Mathias Schacht; Anusch Taraz (J. Comb. Theory B, 2008)

The random planar graph process. - Stefanie Gerke; Dirk Schlatter; Angelika Steger; Anusch Taraz (Random Struct. Algorithms, 2008)

Almost spanning subgraphs of random graphs after adversarial edge removal. - Julia Böttcher; Yoshiharu Kohayakawa; Anusch Taraz (Electron. Notes Discret. Math., 2009)

Coloring Random Intersection Graphs and Complex Networks. - Michael Behrisch 002; Anusch Taraz; Michael Ueckerdt (SIAM J. Discret. Math., 2009)

Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs. - Julia Böttcher; Klaas Paul Pruessmann; Anusch Taraz; Andreas Würfl (Eur. J. Comb., 2010)

Embedding into Bipartite Graphs. - Julia Böttcher; Peter Heinig; Anusch Taraz (SIAM J. Discret. Math., 2010)

Induced C5-free graphs of fixed density: counting and homogeneous sets. - Julia Böttcher; Anusch Taraz; Andreas Würfl (Electron. Notes Discret. Math., 2011)

Diskrete Mathematik - Grundlagen und Methoden. - Anusch Taraz (Birkhäuser, 2012)

Perfect Graphs of Fixed Density: Counting and Homogeneous Sets. - Julia Böttcher; Anusch Taraz; Andreas Würfl (Comb. Probab. Comput., 2012)

An Approximate Version of the Tree Packing Conjecture via Random Embeddings. - Julia Böttcher; Jan Hladký; Diana Piguet; Anusch Taraz (APPROX-RANDOM, 2014)

Coloring d-Embeddable k-Uniform Hypergraphs. - Carl Georg Heise; Konstantinos Panagiotou; Oleg Pikhurko; Anusch Taraz (Discret. Comput. Geom., 2014)

Ramsey numbers for bipartite graphs with small bandwidth. - Guilherme Oliveira Mota; Gábor N. Sárközy; Mathias Schacht; Anusch Taraz (Eur. J. Comb., 2015)

Local resilience of spanning subgraphs in sparse random graphs. - Peter Allen 001; Julia Böttcher; Julia Ehrenmüller; Anusch Taraz (Electron. Notes Discret. Math., 2015)

On Minimum Bisection and Related Partition Problems in Graphs with Bounded Tree Width. - Cristina G. Fernandes; Tina Janne Schmidt; Anusch Taraz (Electron. Notes Discret. Math., 2015)

Approximating Minimum k-Section in Trees with Linear Diameter. - Cristina G. Fernandes; Tina Janne Schmidt; Anusch Taraz (Electron. Notes Discret. Math., 2015)

A counting lemma for sparse pseudorandom hypergraphs. - Yoshiharu Kohayakawa; Guilherme Oliveira Mota; Mathias Schacht; Anusch Taraz (Electron. Notes Discret. Math., 2015)

An Extension of the Blow-up Lemma to Arrangeable Graphs. - Julia Böttcher; Yoshiharu Kohayakawa; Anusch Taraz; Andreas Würfl (SIAM J. Discret. Math., 2015)

Spanning embeddings of arrangeable graphs with sublinear bandwidth. - Julia Böttcher; Anusch Taraz; Andreas Würfl (Random Struct. Algorithms, 2016)

Approximating the Minimum k-Section Width in Bounded-Degree Trees with Linear Diameter. - Cristina G. Fernandes; Tina Janne Schmidt; Anusch Taraz (CoRR, 2017)

Counting results for sparse pseudorandom hypergraphs I. - Yoshiharu Kohayakawa; Guilherme Oliveira Mota; Mathias Schacht; Anusch Taraz (Eur. J. Comb., 2017)

Counting results for sparse pseudorandom hypergraphs II. - Yoshiharu Kohayakawa; Guilherme Oliveira Mota; Mathias Schacht; Anusch Taraz (Eur. J. Comb., 2017)

Logical limit laws for minor-closed classes of graphs. - Peter Heinig; Tobias Müller 001; Marc Noy; Anusch Taraz (J. Comb. Theory B, 2018)

On minimum bisection and related cut problems in trees and tree-like graphs. - Cristina G. Fernandes; Tina Janne Schmidt; Anusch Taraz (J. Graph Theory, 2018)

On the size-Ramsey number of grid graphs. - Dennis Clemens; Meysam Miralaei; Damian Reding; Mathias Schacht; Anusch Taraz (Comb. Probab. Comput., 2021)

A spanning bandwidth theorem in random graphs. - Peter Allen 001; Julia Böttcher; Julia Ehrenmüller; Jakob Schnitzer; Anusch Taraz (Comb. Probab. Comput., 2022)

Randomized Algorithms to Generate Hypergraphs with Given Degree Sequences. - Michela Ascolese; Matthias Lienau; Matthias Schulte; Anusch Taraz (Electron. J. Comb., 2025)