Anusch Taraz

48 papers A* 1A 1Journal 41Unranked 3
YearRankTypeTitle / Venue / Authors
2025 — conf
A Hybrid Quantum-Inspired and Deep Learning Approach for the Capacitated Vehicle Routing Problem with Time Windows.
LION (2)
Jorin Dornemann, Salwa Shaglel, Martin Kliesch, Anusch Taraz
2025 J jnl
Randomized Algorithms to Generate Hypergraphs with Given Degree Sequences.
Electron. J. Comb.
Michela Ascolese, Matthias Lienau, Matthias Schulte, Anusch Taraz
2022 J jnl
A spanning bandwidth theorem in random graphs.
Comb. Probab. Comput.
Peter Allen, Julia Böttcher, Julia Ehrenmüller, Jakob Schnitzer, Anusch Taraz
2021 J jnl
On the size-Ramsey number of grid graphs.
Comb. Probab. Comput.
Dennis Clemens, Meysam Miralaei, Damian Reding, Mathias Schacht, Anusch Taraz
2018 J jnl
Logical limit laws for minor-closed classes of graphs.
J. Comb. Theory B
Peter Heinig, Tobias Müller, Marc Noy, Anusch Taraz
2018 J jnl
On minimum bisection and related cut problems in trees and tree-like graphs.
J. Graph Theory
Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz
2017 J jnl
Approximating the Minimum k-Section Width in Bounded-Degree Trees with Linear Diameter.
CoRR
Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz
2017 J jnl
Counting results for sparse pseudorandom hypergraphs I.
Eur. J. Comb.
Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz
2017 J jnl
Counting results for sparse pseudorandom hypergraphs II.
Eur. J. Comb.
Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz
2017 J jnl
On Minimum Bisection and Related Cut Problems in Trees and Tree-Like Graphs.
CoRR
Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz
2016 J jnl
Spanning embeddings of arrangeable graphs with sublinear bandwidth.
Random Struct. Algorithms
Julia Böttcher, Anusch Taraz, Andreas Würfl
2015 J jnl
A counting lemma for sparse pseudorandom hypergraphs.
Electron. Notes Discret. Math.
Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz
2015 J jnl
An Extension of the Blow-up Lemma to Arrangeable Graphs.
SIAM J. Discret. Math.
Julia Böttcher, Yoshiharu Kohayakawa, Anusch Taraz, Andreas Würfl
2015 J jnl
Approximating Minimum k-Section in Trees with Linear Diameter.
Electron. Notes Discret. Math.
Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz
2015 J jnl
Local resilience of spanning subgraphs in sparse random graphs.
Electron. Notes Discret. Math.
Peter Allen, Julia Böttcher, Julia Ehrenmüller, Anusch Taraz
2015 J jnl
On Minimum Bisection and Related Partition Problems in Graphs with Bounded Tree Width.
Electron. Notes Discret. Math.
Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz
2015 J jnl
Ramsey numbers for bipartite graphs with small bandwidth.
Eur. J. Comb.
Guilherme Oliveira Mota, Gábor N. Sárközy, Mathias Schacht, Anusch Taraz
2014 — conf
An Approximate Version of the Tree Packing Conjecture via Random Embeddings.
APPROX-RANDOM
Julia Böttcher, Jan Hladký, Diana Piguet, Anusch Taraz
2014 J jnl
Coloring d-Embeddable k-Uniform Hypergraphs.
Discret. Comput. Geom.
Carl Georg Heise, Konstantinos Panagiotou, Oleg Pikhurko, Anusch Taraz
2013 J jnl
Almost Spanning Subgraphs of Random Graphs After Adversarial Edge Removal.
Comb. Probab. Comput.
Julia Böttcher, Yoshiharu Kohayakawa, Anusch Taraz
2012 — book
Diskrete Mathematik - Grundlagen und Methoden.
Anusch Taraz
2012 J jnl
Perfect Graphs of Fixed Density: Counting and Homogeneous Sets.
Comb. Probab. Comput.
Julia Böttcher, Anusch Taraz, Andreas Würfl
2011 J jnl
Induced C
Electron. Notes Discret. Math.
Julia Böttcher, Anusch Taraz, Andreas Würfl
2010 J jnl
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs.
Eur. J. Comb.
Julia Böttcher, Klaas Paul Pruessmann, Anusch Taraz, Andreas Würfl
2010 J jnl
Embedding into Bipartite Graphs.
SIAM J. Discret. Math.
Julia Böttcher, Peter Heinig, Anusch Taraz
2009 J jnl
Almost spanning subgraphs of random graphs after adversarial edge removal.
Electron. Notes Discret. Math.
Julia Böttcher, Yoshiharu Kohayakawa, Anusch Taraz
2009 J jnl
Coloring Random Intersection Graphs and Complex Networks.
SIAM J. Discret. Math.
Michael Behrisch, Anusch Taraz, Michael Ueckerdt
2008 J jnl
Bandwidth, treewidth, separators, expansion, and universality.
Electron. Notes Discret. Math.
Julia Böttcher, Klaas Paul Pruessmann, Anusch Taraz, Andreas Würfl
2008 J jnl
Spanning 3-colourable subgraphs of small bandwidth in dense graphs.
J. Comb. Theory B
Julia Böttcher, Mathias Schacht, Anusch Taraz
2008 J jnl
The random planar graph process.
Random Struct. Algorithms
Stefanie Gerke, Dirk Schlatter, Angelika Steger, Anusch Taraz
2007 J jnl
Embedding spanning subgraphs of small bandwidth.
Electron. Notes Discret. Math.
Julia Böttcher, Mathias Schacht, Anusch Taraz
2007 A* conf
On the bandwidth conjecture for 3-colourable graphs.
SODA
Julia Böttcher, Mathias Schacht, Anusch Taraz
2006 J jnl
Efficiently covering complex networks with cliques of similar vertices.
Theor. Comput. Sci.
Michael Behrisch, Anusch Taraz
2005 J jnl
Degree Sequences of F-Free Graphs.
Electron. J. Comb.
Oleg Pikhurko, Anusch Taraz
2005 J jnl
Globally bounded local edge colourings of hypergraphs.
Electron. Notes Discret. Math.
Mathias Schacht, Anusch Taraz
2005 J jnl
Large planar subgraphs in dense graphs.
J. Comb. Theory B
Daniela Kühn, Deryk Osthus, Anusch Taraz
2004 J jnl
Exact and approximative algorithms for coloring G(n, p).
Random Struct. Algorithms
Amin Coja-Oghlan, Anusch Taraz
2003 A conf
Colouring Random Graphs in Expected Polynomial Time.
STACS
Amin Coja-Oghlan, Anusch Taraz
2003 J jnl
For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite?
Comb.
Deryk Osthus, Hans Jürgen Prömel, Anusch Taraz
2003 J jnl
On random planar graphs, the number of planar graphs and their triangulations.
J. Comb. Theory B
Deryk Osthus, Hans Jürgen Prömel, Anusch Taraz
2001 J jnl
Almost all graphs with high girth and suitable density have high chromatic number.
J. Graph Theory
Deryk Osthus, Hans Jürgen Prömel, Anusch Taraz
2001 J jnl
Asymptotic enumeration, global structure, and constrained evolution.
Discret. Math.
Hans Jürgen Prömel, Angelika Steger, Anusch Taraz
2001 J jnl
Counting Partial Orders With A Fixed Number Of Comparable Pairs.
Comb. Probab. Comput.
Hans Jürgen Prömel, Angelika Steger, Anusch Taraz
2001 J jnl
Phase Transitions in the Evolution of Partial Orders.
J. Comb. Theory A
Hans Jürgen Prömel, Angelika Steger, Anusch Taraz
2001 — conf
Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders.
Computational Discrete Mathematics
Hans Jürgen Prömel, Anusch Taraz
2001 J jnl
Random maximal H-free graphs.
Random Struct. Algorithms
Deryk Osthus, Anusch Taraz
1999 J jnl
Hypergraph Packing And Graph Embedding.
Comb. Probab. Comput.
Vojtech Rödl, Andrzej Rucinski, Anusch Taraz
1999 — —
Phase transitions in the evolution of partially ordered sets
Anusch Taraz