Anusch Taraz

According to our database1, Anusch Taraz authored at least 42 papers between 1999 and 2018.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

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

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

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

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

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

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

A counting lemma for sparse pseudorandom hypergraphs.
Electronic Notes in Discrete Mathematics, 2015

Approximating Minimum k-Section in Trees with Linear Diameter.
Electronic Notes in Discrete Mathematics, 2015

On Minimum Bisection and Related Partition Problems in Graphs with Bounded Tree Width.
Electronic Notes in Discrete Mathematics, 2015

Local resilience of spanning subgraphs in sparse random graphs.
Electronic Notes in Discrete Mathematics, 2015

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

2014
Coloring d-Embeddable k-Uniform Hypergraphs.
Discrete & Computational Geometry, 2014

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

2013
Almost Spanning Subgraphs of Random Graphs After Adversarial Edge Removal.
Combinatorics, Probability & Computing, 2013

2012
Perfect Graphs of Fixed Density: Counting and Homogeneous Sets.
Combinatorics, Probability & Computing, 2012

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

2011
Induced C5-free graphs of fixed density: counting and homogeneous sets.
Electronic Notes in Discrete Mathematics, 2011

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

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

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

Almost spanning subgraphs of random graphs after adversarial edge removal.
Electronic Notes in Discrete Mathematics, 2009

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

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

Bandwidth, treewidth, separators, expansion, and universality.
Electronic Notes in Discrete Mathematics, 2008

2007
Embedding spanning subgraphs of small bandwidth.
Electronic Notes in Discrete Mathematics, 2007

K 4-free subgraphs of random graphs revisited.
Combinatorica, 2007

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

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

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

Globally bounded local edge colourings of hypergraphs.
Electronic Notes in Discrete Mathematics, 2005

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

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

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

For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite?
Combinatorica, 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

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

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

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

Asymptotic enumeration, global structure, and constrained evolution.
Discrete Mathematics, 2001

Counting Partial Orders With A Fixed Number Of Comparable Pairs.
Combinatorics, Probability & Computing, 2001

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

1999
Hypergraph Packing And Graph Embedding.
Combinatorics, Probability & Computing, 1999


  Loading...