Anusch Taraz

Orcid: 0000-0003-3646-3683

According to our database1, Anusch Taraz authored at least 45 papers between 1999 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


Online presence:



A spanning bandwidth theorem in random graphs.
Comb. Probab. Comput., 2022

On the size-Ramsey number of grid graphs.
Comb. Probab. Comput., 2021

On minimum bisection and related cut problems in trees and tree-like graphs.
J. Graph Theory, 2018

Logical limit laws for minor-closed classes of graphs.
J. Comb. Theory B, 2018

Counting results for sparse pseudorandom hypergraphs II.
Eur. J. Comb., 2017

Counting results for sparse pseudorandom hypergraphs I.
Eur. J. Comb., 2017

Approximating the Minimum k-Section Width in Bounded-Degree Trees with Linear Diameter.
CoRR, 2017

Spanning embeddings of arrangeable graphs with sublinear bandwidth.
Random Struct. Algorithms, 2016

An Extension of the Blow-up Lemma to Arrangeable Graphs.
SIAM J. Discret. Math., 2015

A counting lemma for sparse pseudorandom hypergraphs.
Electron. Notes Discret. Math., 2015

Approximating Minimum k-Section in Trees with Linear Diameter.
Electron. Notes Discret. Math., 2015

On Minimum Bisection and Related Partition Problems in Graphs with Bounded Tree Width.
Electron. Notes Discret. Math., 2015

Local resilience of spanning subgraphs in sparse random graphs.
Electron. Notes Discret. Math., 2015

Ramsey numbers for bipartite graphs with small bandwidth.
Eur. J. Comb., 2015

Coloring d-Embeddable k-Uniform Hypergraphs.
Discret. Comput. Geom., 2014

An Approximate Version of the Tree Packing Conjecture via Random Embeddings.
Proceedings of the Approximation, 2014

Perfect Graphs of Fixed Density: Counting and Homogeneous Sets.
Comb. Probab. Comput., 2012

Diskrete Mathematik - Grundlagen und Methoden.
Mathematik Kompakt, Birkhäuser, ISBN: 978-3-7643-8898-0, 2012

Induced C<sub>5</sub>-free graphs of fixed density: counting and homogeneous sets.
Electron. Notes Discret. Math., 2011

Embedding into Bipartite Graphs.
SIAM J. Discret. Math., 2010

Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs.
Eur. J. Comb., 2010

Coloring Random Intersection Graphs and Complex Networks.
SIAM J. Discret. Math., 2009

Almost spanning subgraphs of random graphs after adversarial edge removal.
Electron. Notes Discret. Math., 2009

The random planar graph process.
Random Struct. Algorithms, 2008

Spanning 3-colourable subgraphs of small bandwidth in dense graphs.
J. Comb. Theory B, 2008

Bandwidth, treewidth, separators, expansion, and universality.
Electron. Notes Discret. Math., 2008

Embedding spanning subgraphs of small bandwidth.
Electron. Notes Discret. Math., 2007

<i>K</i> <sub>4</sub>-free subgraphs of random graphs revisited.
Comb., 2007

On the bandwidth conjecture for 3-colourable graphs.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Efficiently covering complex networks with cliques of similar vertices.
Theor. Comput. Sci., 2006

Large planar subgraphs in dense graphs.
J. Comb. Theory B, 2005

Globally bounded local edge colourings of hypergraphs.
Electron. Notes Discret. Math., 2005

Degree Sequences of F-Free Graphs.
Electron. J. Comb., 2005

Exact and approximative algorithms for coloring G(n, p).
Random Struct. Algorithms, 2004

On random planar graphs, the number of planar graphs and their triangulations.
J. Comb. Theory B, 2003

For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite?
Comb., 2003

Colouring Random Graphs in Expected Polynomial Time.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Random maximal H-free graphs.
Random Struct. Algorithms, 2001

Almost all graphs with high girth and suitable density have high chromatic number.
J. Graph Theory, 2001

Phase Transitions in the Evolution of Partial Orders.
J. Comb. Theory A, 2001

Asymptotic enumeration, global structure, and constrained evolution.
Discret. Math., 2001

Counting Partial Orders With A Fixed Number Of Comparable Pairs.
Comb. Probab. Comput., 2001

Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders.
Proceedings of the Computational Discrete Mathematics, Advanced Lectures, 2001

Phase transitions in the evolution of partially ordered sets
PhD thesis, 1999

Hypergraph Packing And Graph Embedding.
Comb. Probab. Comput., 1999