Anusch Taraz

Publication Activity (10 Years)

Years Active: 1999-2022
Publications (10 Years): 9

Top Topics

Uniformly Distributed

Bounded Tree Width

Johnson Lindenstrauss

Top Venues

Electron. Notes Discret. Math.

Comb. Probab. Comput.

Publications

Peter Allen, Julia Böttcher, Julia Ehrenmüller, Jakob Schnitzer, Anusch Taraz
A spanning bandwidth theorem in random graphs. Comb. Probab. Comput. 31 (4) (2022)
Dennis Clemens, Meysam Miralaei, Damian Reding, Mathias Schacht, Anusch Taraz
On the size-Ramsey number of grid graphs. Comb. Probab. Comput. 30 (5) (2021)
Peter Heinig, Tobias Müller, Marc Noy, Anusch Taraz
Logical limit laws for minor-closed classes of graphs. J. Comb. Theory, Ser. B 130 (2018)
Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz
On minimum bisection and related cut problems in trees and tree-like graphs. J. Graph Theory 89 (2) (2018)
Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz
On Minimum Bisection and Related Cut Problems in Trees and Tree-Like Graphs. CoRR (2017)
Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz
Counting results for sparse pseudorandom hypergraphs I. Eur. J. Comb. 65 (2017)
Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz
Approximating the Minimum k-Section Width in Bounded-Degree Trees with Linear Diameter. CoRR (2017)
Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz
Counting results for sparse pseudorandom hypergraphs II. Eur. J. Comb. 65 (2017)
Julia Böttcher, Anusch Taraz, Andreas Würfl
Spanning embeddings of arrangeable graphs with sublinear bandwidth. Random Struct. Algorithms 48 (2) (2016)
Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz
On Minimum Bisection and Related Partition Problems in Graphs with Bounded Tree Width. Electron. Notes Discret. Math. 49 (2015)
Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz
Approximating Minimum k-Section in Trees with Linear Diameter. Electron. Notes Discret. Math. 50 (2015)
Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz
A counting lemma for sparse pseudorandom hypergraphs. Electron. Notes Discret. Math. 50 (2015)
Peter Allen, Julia Böttcher, Julia Ehrenmüller, Anusch Taraz
Local resilience of spanning subgraphs in sparse random graphs. Electron. Notes Discret. Math. 49 (2015)
Julia Böttcher, Yoshiharu Kohayakawa, Anusch Taraz, Andreas Würfl
An Extension of the Blow-up Lemma to Arrangeable Graphs. SIAM J. Discret. Math. 29 (2) (2015)
Guilherme Oliveira Mota, Gábor N. Sárközy, Mathias Schacht, Anusch Taraz
Ramsey numbers for bipartite graphs with small bandwidth. Eur. J. Comb. 48 (2015)
Julia Böttcher, Jan Hladký, Diana Piguet, Anusch Taraz
An Approximate Version of the Tree Packing Conjecture via Random Embeddings. APPROX-RANDOM (2014)
Carl Georg Heise, Konstantinos Panagiotou, Oleg Pikhurko, Anusch Taraz
Coloring d-Embeddable k-Uniform Hypergraphs. Discret. Comput. Geom. 52 (4) (2014)
Julia Böttcher, Yoshiharu Kohayakawa, Anusch Taraz
Almost Spanning Subgraphs of Random Graphs After Adversarial Edge Removal. Comb. Probab. Comput. 22 (5) (2013)
Julia Böttcher, Anusch Taraz, Andreas Würfl
Perfect Graphs of Fixed Density: Counting and Homogeneous Sets. Comb. Probab. Comput. 21 (5) (2012)
Julia Böttcher, Anusch Taraz, Andreas Würfl
-free graphs of fixed density: counting and homogeneous sets. Electron. Notes Discret. Math. 38 (2011)
Julia Böttcher, Klaas Paul Pruessmann, Anusch Taraz, Andreas Würfl
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs. Eur. J. Comb. 31 (5) (2010)
Julia Böttcher, Peter Heinig, Anusch Taraz
Embedding into Bipartite Graphs. SIAM J. Discret. Math. 24 (4) (2010)
Julia Böttcher, Yoshiharu Kohayakawa, Anusch Taraz
Almost spanning subgraphs of random graphs after adversarial edge removal. Electron. Notes Discret. Math. 35 (2009)
Michael Behrisch, Anusch Taraz, Michael Ueckerdt
Coloring Random Intersection Graphs and Complex Networks. SIAM J. Discret. Math. 23 (1) (2009)
Stefanie Gerke, Dirk Schlatter, Angelika Steger, Anusch Taraz
The random planar graph process. Random Struct. Algorithms 32 (2) (2008)
Julia Böttcher, Mathias Schacht, Anusch Taraz
Spanning 3-colourable subgraphs of small bandwidth in dense graphs. J. Comb. Theory, Ser. B 98 (4) (2008)
Julia Böttcher, Klaas Paul Pruessmann, Anusch Taraz, Andreas Würfl
Bandwidth, treewidth, separators, expansion, and universality. Electron. Notes Discret. Math. 31 (2008)
Stefanie Gerke, Hans Jürgen Prömel, Thomas Schickinger, Angelika Steger, Anusch Taraz
-free subgraphs of random graphs revisited. Comb. 27 (3) (2007)
Julia Böttcher, Mathias Schacht, Anusch Taraz
Embedding spanning subgraphs of small bandwidth. Electron. Notes Discret. Math. 29 (2007)
Julia Böttcher, Mathias Schacht, Anusch Taraz
On the bandwidth conjecture for 3-colourable graphs. SODA (2007)
Michael Behrisch, Anusch Taraz
Efficiently covering complex networks with cliques of similar vertices. Theor. Comput. Sci. 355 (1) (2006)
Oleg Pikhurko, Anusch Taraz
Degree Sequences of F-Free Graphs. Electron. J. Comb. 12 (2005)
Mathias Schacht, Anusch Taraz
Globally bounded local edge colourings of hypergraphs. Electron. Notes Discret. Math. 19 (2005)
Daniela Kühn, Deryk Osthus, Anusch Taraz
Large planar subgraphs in dense graphs. J. Comb. Theory, Ser. B 95 (2) (2005)
Amin Coja-Oghlan, Anusch Taraz
Exact and approximative algorithms for coloring G(n, p). Random Struct. Algorithms 24 (3) (2004)
Deryk Osthus, Hans Jürgen Prömel, Anusch Taraz
For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite? Comb. 23 (1) (2003)
Amin Coja-Oghlan, Anusch Taraz
Colouring Random Graphs in Expected Polynomial Time. STACS (2003)
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) (2003)
Hans Jürgen Prömel, Angelika Steger, Anusch Taraz
Phase Transitions in the Evolution of Partial Orders. J. Comb. Theory, Ser. A 94 (2) (2001)
Hans Jürgen Prömel, Anusch Taraz
Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders. Computational Discrete Mathematics (2001)
Hans Jürgen Prömel, Angelika Steger, Anusch Taraz
Counting Partial Orders With A Fixed Number Of Comparable Pairs. Comb. Probab. Comput. 10 (2) (2001)
Deryk Osthus, Hans Jürgen Prömel, Anusch Taraz
Almost all graphs with high girth and suitable density have high chromatic number. J. Graph Theory 37 (4) (2001)
Hans Jürgen Prömel, Angelika Steger, Anusch Taraz
Asymptotic enumeration, global structure, and constrained evolution. Discret. Math. 229 (1-3) (2001)
Deryk Osthus, Anusch Taraz
Random maximal H-free graphs. Random Struct. Algorithms 18 (1) (2001)
Vojtech Rödl, Andrzej Rucinski, Anusch Taraz
Hypergraph Packing And Graph Embedding. Comb. Probab. Comput. 8 (4) (1999)