Anusch Taraz
https://zbmath.org/authors/?q=ai:taraz.anusch
Peter Allen 0001
Julia Böttcher
Julia Ehrenmüller
Jakob Schnitzer
Anusch Taraz
A spanning bandwidth theorem in random graphs.
598-628
2022
31
Comb. Probab. Comput.
4
https://doi.org/10.1017/S0963548321000481
db/journals/cpc/cpc31.html#AllenBEST22
Dennis Clemens
Meysam Miralaei
Damian Reding
Mathias Schacht
Anusch Taraz
On the size-Ramsey number of grid graphs.
670-685
2021
30
Comb. Probab. Comput.
5
https://doi.org/10.1017/S0963548320000322
db/journals/cpc/cpc30.html#ClemensMRST21
Peter Heinig
Tobias Müller 0001
Marc Noy
Anusch Taraz
Logical limit laws for minor-closed classes of graphs.
158-206
2018
130
J. Comb. Theory, Ser. B
https://doi.org/10.1016/j.jctb.2017.12.002
db/journals/jct/jctb130.html#HeinigMNT18
Cristina G. Fernandes
Tina Janne Schmidt
Anusch Taraz
On minimum bisection and related cut problems in trees and tree-like graphs.
214-245
2018
89
J. Graph Theory
2
https://doi.org/10.1002/jgt.22248
https://www.wikidata.org/entity/Q111288267
db/journals/jgt/jgt89.html#FernandesST18
Yoshiharu Kohayakawa
Guilherme Oliveira Mota
Mathias Schacht
Anusch Taraz
Counting results for sparse pseudorandom hypergraphs I.
276-287
2017
65
Eur. J. Comb.
https://doi.org/10.1016/j.ejc.2017.04.008
https://www.wikidata.org/entity/Q102054515
db/journals/ejc/ejc65.html#KohayakawaMST17
Yoshiharu Kohayakawa
Guilherme Oliveira Mota
Mathias Schacht
Anusch Taraz
Counting results for sparse pseudorandom hypergraphs II.
288-301
2017
65
Eur. J. Comb.
https://doi.org/10.1016/j.ejc.2017.04.007
https://www.wikidata.org/entity/Q101496300
db/journals/ejc/ejc65.html#KohayakawaMST17a
Cristina G. Fernandes
Tina Janne Schmidt
Anusch Taraz
On Minimum Bisection and Related Cut Problems in Trees and Tree-Like Graphs.
2017
abs/1708.06411
CoRR
http://arxiv.org/abs/1708.06411
db/journals/corr/corr1708.html#abs-1708-06411
Cristina G. Fernandes
Tina Janne Schmidt
Anusch Taraz
Approximating the Minimum k-Section Width in Bounded-Degree Trees with Linear Diameter.
2017
abs/1708.06431
CoRR
http://arxiv.org/abs/1708.06431
db/journals/corr/corr1708.html#abs-1708-06431
Julia Böttcher
Anusch Taraz
Andreas Würfl
Spanning embeddings of arrangeable graphs with sublinear bandwidth.
270-289
2016
48
Random Struct. Algorithms
2
https://doi.org/10.1002/rsa.20593
db/journals/rsa/rsa48.html#BottcherTW16
Guilherme Oliveira Mota
Gábor N. Sárközy
Mathias Schacht
Anusch Taraz
Ramsey numbers for bipartite graphs with small bandwidth.
165-176
2015
48
Eur. J. Comb.
https://doi.org/10.1016/j.ejc.2015.02.018
db/journals/ejc/ejc48.html#MotaSST15
Cristina G. Fernandes
Tina Janne Schmidt
Anusch Taraz
On Minimum Bisection and Related Partition Problems in Graphs with Bounded Tree Width.
481-488
2015
49
Electron. Notes Discret. Math.
https://doi.org/10.1016/j.endm.2015.06.067
db/journals/endm/endm49.html#FernandesST15
Peter Allen 0001
Julia Böttcher
Julia Ehrenmüller
Anusch Taraz
Local resilience of spanning subgraphs in sparse random graphs.
513-521
2015
49
Electron. Notes Discret. Math.
https://doi.org/10.1016/j.endm.2015.06.071
db/journals/endm/endm49.html#AllenBET15
Cristina G. Fernandes
Tina Janne Schmidt
Anusch Taraz
Approximating Minimum k-Section in Trees with Linear Diameter.
71-76
2015
50
Electron. Notes Discret. Math.
https://doi.org/10.1016/j.endm.2015.07.013
db/journals/endm/endm50.html#FernandesST15a
Yoshiharu Kohayakawa
Guilherme Oliveira Mota
Mathias Schacht
Anusch Taraz
A counting lemma for sparse pseudorandom hypergraphs.
421-426
2015
50
Electron. Notes Discret. Math.
https://doi.org/10.1016/j.endm.2015.07.070
https://www.wikidata.org/entity/Q101496303
db/journals/endm/endm50.html#KohayakawaMST15
Julia Böttcher
Yoshiharu Kohayakawa
Anusch Taraz
Andreas Würfl
An Extension of the Blow-up Lemma to Arrangeable Graphs.
962-1001
2015
29
SIAM J. Discret. Math.
2
https://doi.org/10.1137/13093827X
https://www.wikidata.org/entity/Q105584178
db/journals/siamdm/siamdm29.html#BottcherKTW15
Carl Georg Heise
Konstantinos Panagiotou
Oleg Pikhurko
Anusch Taraz
Coloring d-Embeddable k-Uniform Hypergraphs.
663-679
2014
52
Discret. Comput. Geom.
4
https://doi.org/10.1007/s00454-014-9641-2
https://www.wikidata.org/entity/Q41889455
db/journals/dcg/dcg52.html#HeisePPT14
Julia Böttcher
Jan Hladký
Diana Piguet
Anusch Taraz
An Approximate Version of the Tree Packing Conjecture via Random Embeddings.
490-499
2014
APPROX-RANDOM
https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.490
conf/approx/2014
db/conf/approx/approx2014.html#BottcherHPT14
Julia Böttcher
Yoshiharu Kohayakawa
Anusch Taraz
Almost Spanning Subgraphs of Random Graphs After Adversarial Edge Removal.
639-683
2013
22
Comb. Probab. Comput.
5
https://doi.org/10.1017/S0963548313000199
https://www.wikidata.org/entity/Q105585014
db/journals/cpc/cpc22.html#BottcherKT13
Anusch Taraz
Diskrete Mathematik - Grundlagen und Methoden.
I-IX, 1-137
Birkhäuser
2012
Mathematik Kompakt
978-3-7643-8898-0
https://doi.org/10.1007/978-3-7643-8901-7
Julia Böttcher
Anusch Taraz
Andreas Würfl
Perfect Graphs of Fixed Density: Counting and Homogeneous Sets.
661-682
2012
21
Comb. Probab. Comput.
5
https://doi.org/10.1017/S0963548312000181
db/journals/cpc/cpc21.html#BottcherTW12
Julia Böttcher
Anusch Taraz
Andreas Würfl
Induced C5-free graphs of fixed density: counting and homogeneous sets.
181-186
2011
38
Electron. Notes Discret. Math.
https://doi.org/10.1016/j.endm.2011.09.031
db/journals/endm/endm38.html#BottcherTW11
Julia Böttcher
Klaas Paul Pruessmann
Anusch Taraz
Andreas Würfl
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs.
1217-1227
2010
31
Eur. J. Comb.
5
https://doi.org/10.1016/j.ejc.2009.10.010
https://www.wikidata.org/entity/Q56766816
db/journals/ejc/ejc31.html#BottcherPTW10
Julia Böttcher
Peter Heinig
Anusch Taraz
Embedding into Bipartite Graphs.
1215-1233
2010
24
SIAM J. Discret. Math.
4
https://doi.org/10.1137/090765481
db/journals/siamdm/siamdm24.html#BottcherHT10
Julia Böttcher
Yoshiharu Kohayakawa
Anusch Taraz
Almost spanning subgraphs of random graphs after adversarial edge removal.
335-340
2009
35
Electron. Notes Discret. Math.
https://doi.org/10.1016/j.endm.2009.11.055
db/journals/endm/endm35.html#BottcherKT09
Michael Behrisch 0002
Anusch Taraz
Michael Ueckerdt
Coloring Random Intersection Graphs and Complex Networks.
288-299
2009
23
SIAM J. Discret. Math.
1
https://doi.org/10.1137/050647153
db/journals/siamdm/siamdm23.html#BehrischTU09
Julia Böttcher
Klaas Paul Pruessmann
Anusch Taraz
Andreas Würfl
Bandwidth, treewidth, separators, expansion, and universality.
91-96
2008
31
Electron. Notes Discret. Math.
https://doi.org/10.1016/j.endm.2008.06.018
db/journals/endm/endm31.html#BottcherPTW08
Julia Böttcher
Mathias Schacht
Anusch Taraz
Spanning 3-colourable subgraphs of small bandwidth in dense graphs.
752-777
2008
98
J. Comb. Theory, Ser. B
4
https://doi.org/10.1016/j.jctb.2007.11.005
db/journals/jct/jctb98.html#BottcherST08
Stefanie Gerke
Dirk Schlatter
Angelika Steger
Anusch Taraz
The random planar graph process.
236-261
2008
32
Random Struct. Algorithms
2
https://doi.org/10.1002/rsa.20186
db/journals/rsa/rsa32.html#GerkeSST08
Stefanie Gerke
Hans Jürgen Prömel
Thomas Schickinger
Angelika Steger
Anusch Taraz
K 4-free subgraphs of random graphs revisited.
329-365
2007
27
Comb.
3
https://doi.org/10.1007/s00493-007-2010-5
db/journals/combinatorica/combinatorica27.html#GerkePSST07
Julia Böttcher
Mathias Schacht
Anusch Taraz
Embedding spanning subgraphs of small bandwidth.
485-489
2007
29
Electron. Notes Discret. Math.
https://doi.org/10.1016/j.endm.2007.07.075
db/journals/endm/endm29.html#BottcherST07
Julia Böttcher
Mathias Schacht
Anusch Taraz
On the bandwidth conjecture for 3-colourable graphs.
618-626
2007
conf/soda/2007
SODA
http://dl.acm.org/citation.cfm?id=1283383.1283450
db/conf/soda/soda2007.html#BottcherST07
Michael Behrisch 0002
Anusch Taraz
Efficiently covering complex networks with cliques of similar vertices.
37-47
2006
355
Theor. Comput. Sci.
1
https://doi.org/10.1016/j.tcs.2005.12.005
db/journals/tcs/tcs355.html#BehrischT06
Oleg Pikhurko
Anusch Taraz
Degree Sequences of F-Free Graphs.
2005
12
Electron. J. Comb.
https://doi.org/10.37236/1966
db/journals/combinatorics/combinatorics12.html#PikhurkoT05
Mathias Schacht
Anusch Taraz
Globally bounded local edge colourings of hypergraphs.
179-185
2005
19
Electron. Notes Discret. Math.
https://doi.org/10.1016/j.endm.2005.05.025
db/journals/endm/endm19.html#SchachtT05
Daniela Kühn
Deryk Osthus
Anusch Taraz
Large planar subgraphs in dense graphs.
263-282
2005
95
J. Comb. Theory, Ser. B
2
https://doi.org/10.1016/j.jctb.2005.04.004
db/journals/jct/jctb95.html#KuhnOT05
Amin Coja-Oghlan
Anusch Taraz
Exact and approximative algorithms for coloring G(n, p).
259-278
2004
24
Random Struct. Algorithms
3
https://doi.org/10.1002/rsa.20007
db/journals/rsa/rsa24.html#Coja-OghlanT04
Deryk Osthus
Hans Jürgen Prömel
Anusch Taraz
For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite?
105-150
2003
23
Comb.
1
https://doi.org/10.1007/s00493-003-0016-1
db/journals/combinatorica/combinatorica23.html#OsthusPT03
Deryk Osthus
Hans Jürgen Prömel
Anusch Taraz
On random planar graphs, the number of planar graphs and their triangulations.
119-134
2003
88
J. Comb. Theory, Ser. B
1
https://doi.org/10.1016/S0095-8956(02)00040-0
db/journals/jct/jctb88.html#OsthusPT03
Amin Coja-Oghlan
Anusch Taraz
Colouring Random Graphs in Expected Polynomial Time.
487-498
2003
conf/stacs/2003
STACS
https://doi.org/10.1007/3-540-36494-3_43
db/conf/stacs/stacs2003.html#Coja-OghlanT03
Hans Jürgen Prömel
Angelika Steger
Anusch Taraz
Counting Partial Orders With A Fixed Number Of Comparable Pairs.
2001
10
Comb. Probab. Comput.
2
db/journals/cpc/cpc10.html#PromelST01
https://doi.org/10.1017/S0963548301004503
159-177
Hans Jürgen Prömel
Angelika Steger
Anusch Taraz
Asymptotic enumeration, global structure, and constrained evolution.
213-233
2001
229
Discret. Math.
1-3
https://doi.org/10.1016/S0012-365X(00)00211-9
https://www.wikidata.org/entity/Q105583790
db/journals/dm/dm229.html#PromelST01
Hans Jürgen Prömel
Angelika Steger
Anusch Taraz
Phase Transitions in the Evolution of Partial Orders.
230-275
2001
94
J. Comb. Theory, Ser. A
2
https://doi.org/10.1006/jcta.2000.3135
db/journals/jct/jcta94.html#PromelST01
Deryk Osthus
Hans Jürgen Prömel
Anusch Taraz
Almost all graphs with high girth and suitable density have high chromatic number.
220-226
2001
37
J. Graph Theory
4
https://doi.org/10.1002/jgt.1017
db/journals/jgt/jgt37.html#OsthusPT01
Deryk Osthus
Anusch Taraz
Random maximal H-free graphs.
61-82
2001
18
Random Struct. Algorithms
1
db/journals/rsa/rsa18.html#OsthusT01
https://doi.org/10.1002/1098-2418(200101)18:1<61::AID-RSA5>3.0.CO;2-T
Hans Jürgen Prömel
Anusch Taraz
Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders.
98-118
2001
conf/ac/2001cdm
Computational Discrete Mathematics
https://doi.org/10.1007/3-540-45506-X_8
db/conf/ac/cdm2001.html#PromelT01
Vojtech Rödl
Andrzej Rucinski 0001
Anusch Taraz
Hypergraph Packing And Graph Embedding.
1999
8
Comb. Probab. Comput.
4
db/journals/cpc/cpc8.html#RodlRT99
http://journals.cambridge.org/action/displayAbstract?aid=46713
363-376
Peter Allen 0001
Michael Behrisch 0002
Julia Böttcher
Dennis Clemens
Amin Coja-Oghlan
Julia Ehrenmüller
Cristina G. Fernandes
Stefanie Gerke
Peter Heinig
Carl Georg Heise
Jan Hladký
Yoshiharu Kohayakawa
Daniela Kühn
Meysam Miralaei
Guilherme Oliveira Mota
Tobias Müller 0001
Marc Noy
Deryk Osthus
Konstantinos Panagiotou
Diana Piguet
Oleg Pikhurko
Hans Jürgen Prömel
Klaas P. PruessmannKlaas Paul Pruessmann
Damian Reding
Vojtech Rödl
Andrzej Rucinski 0001
Gábor N. Sárközy
Mathias Schacht
Thomas Schickinger
Dirk Schlatter
Tina Janne Schmidt
Jakob Schnitzer
Angelika Steger
Michael Ueckerdt
Andreas Würfl