Anusch Taraz
Anusch Taraz
Professor der Mathematik, TU Hamburg
E-mail confirmado em tuhh.de
Título
Citado por
Citado por
Ano
Proof of the bandwidth conjecture of Bollobás and Komlós
J Böttcher, M Schacht, A Taraz
Mathematische Annalen 343 (1), 175-205, 2009
742009
On random planar graphs, the number of planar graphs and their triangulations
D Osthus, HJ Prömel, A Taraz
Journal of Combinatorial Theory, Series B 88 (1), 119-134, 2003
602003
Random maximal H‐free graphs*
D Osthus, A Taraz
Random Structures & Algorithms 18 (1), 61-82, 2001
532001
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
J Böttcher, KP Pruessmann, A Taraz, A Würfl
European Journal of Combinatorics 31 (5), 1217-1227, 2010
492010
Large planar subgraphs in dense graphs
D Kühn, D Osthus, A Taraz
Journal of Combinatorial Theory, Series B 95 (2), 263-282, 2005
362005
For which densities are random triangle-free graphs almost surely bipartite?
D Osthus, HJ Prömel, A Taraz
Combinatorica 23 (1), 105-150, 2003
352003
Efficiently covering complex networks with cliques of similar vertices
M Behrisch, A Taraz
Theoretical Computer Science 355 (1), 37-47, 2006
302006
Primality of trees
P Haxell, O Pikhurko, A Taraz
Journal of Combinatorics 2 (4), 481-500, 2011
292011
Hypergraph packing and graph embedding
V Roedl, A Ruciński, A Taraz
Combinatorics, Probability and Computing 8 (4), 363-376, 1999
281999
An approximate version of the tree packing conjecture
J Böttcher, J Hladký, D Piguet, A Taraz
Israel journal of mathematics 211 (1), 391-446, 2016
272016
The random planar graph process
S Gerke, D Schlatter, A Steger, A Taraz
Random Structures & Algorithms 32 (2), 236-261, 2008
262008
Almost spanning subgraphs of random graphs after adversarial edge removal
J Böttcher, Y Kohayakawa, A Taraz
Combinatorics, Probability and Computing 22 (5), 639-683, 2013
242013
Exact and approximative algorithms for coloring G (n, p)
A Coja‐Oghlan, A Taraz
Random Structures & Algorithms 24 (3), 259-278, 2004
242004
Almost spanning subgraphs of random graphs after adversarial edge removal
J Böttcher, Y Kohayakawa, A Taraz
Electronic Notes in Discrete Mathematics 35, 335-340, 2009
232009
Coloring random intersection graphs and complex networks
M Behrisch, A Taraz, M Ueckerdt
SIAM Journal on Discrete Mathematics 23 (1), 288-299, 2009
232009
Asymptotic enumeration, global structure, and constrained evolution
HJ Prömel, A Steger, A Taraz
Discrete Mathematics 229 (1-3), 213-233, 2001
202001
The bandwidth theorem in sparse graphs
P Allen, J Böttcher, J Ehrenmüller, A Taraz
arXiv preprint arXiv:1612.00661, 2016
182016
Colouring random graphs in expected polynomial time
A Coja-Oghlan, A Taraz
Annual Symposium on Theoretical Aspects of Computer Science, 487-498, 2003
172003
An extension of the blow-up lemma to arrangeable graphs
J Böttcher, Y Kohayakawa, A Taraz, A Würfl
SIAM Journal on Discrete Mathematics 29 (2), 962-1001, 2015
162015
Spanning 3-colourable subgraphs of small bandwidth in dense graphs
J Böttcher, M Schacht, A Taraz
Journal of Combinatorial Theory, Series B 98 (4), 752-777, 2008
162008
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20