default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnusch Taraz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j39]Peter Allen
, Julia Böttcher, Julia Ehrenmüller, Jakob Schnitzer, Anusch Taraz:
A spanning bandwidth theorem in random graphs. Comb. Probab. Comput. 31(4): 598-628 (2022)- 2021
- [j38]Dennis Clemens, Meysam Miralaei, Damian Reding, Mathias Schacht, Anusch Taraz:
On the size-Ramsey number of grid graphs. Comb. Probab. Comput. 30(5): 670-685 (2021)
2010 – 2019
- 2018
- [j37]Peter Heinig, Tobias Müller, Marc Noy, Anusch Taraz:
Logical limit laws for minor-closed classes of graphs. J. Comb. Theory B 130: 158-206 (2018) - [j36]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): 214-245 (2018) - 2017
- [j35]Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz:
Counting results for sparse pseudorandom hypergraphs I. Eur. J. Comb. 65: 276-287 (2017) - [j34]Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz:
Counting results for sparse pseudorandom hypergraphs II. Eur. J. Comb. 65: 288-301 (2017) - [i2]Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz:
On Minimum Bisection and Related Cut Problems in Trees and Tree-Like Graphs. CoRR abs/1708.06411 (2017) - [i1]Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz:
Approximating the Minimum k-Section Width in Bounded-Degree Trees with Linear Diameter. CoRR abs/1708.06431 (2017) - 2016
- [j33]Julia Böttcher, Anusch Taraz, Andreas Würfl:
Spanning embeddings of arrangeable graphs with sublinear bandwidth. Random Struct. Algorithms 48(2): 270-289 (2016) - 2015
- [j32]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: 165-176 (2015) - [j31]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: 481-488 (2015) - [j30]Peter Allen, Julia Böttcher, Julia Ehrenmüller, Anusch Taraz:
Local resilience of spanning subgraphs in sparse random graphs. Electron. Notes Discret. Math. 49: 513-521 (2015) - [j29]Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz:
Approximating Minimum k-Section in Trees with Linear Diameter. Electron. Notes Discret. Math. 50: 71-76 (2015) - [j28]Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz:
A counting lemma for sparse pseudorandom hypergraphs. Electron. Notes Discret. Math. 50: 421-426 (2015) - [j27]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): 962-1001 (2015) - 2014
- [j26]Carl Georg Heise, Konstantinos Panagiotou, Oleg Pikhurko, Anusch Taraz:
Coloring d-Embeddable k-Uniform Hypergraphs. Discret. Comput. Geom. 52(4): 663-679 (2014) - [c4]Julia Böttcher, Jan Hladký, Diana Piguet, Anusch Taraz:
An Approximate Version of the Tree Packing Conjecture via Random Embeddings. APPROX-RANDOM 2014: 490-499 - 2013
- [j25]Julia Böttcher, Yoshiharu Kohayakawa, Anusch Taraz:
Almost Spanning Subgraphs of Random Graphs After Adversarial Edge Removal. Comb. Probab. Comput. 22(5): 639-683 (2013) - 2012
- [b2]Anusch Taraz:
Diskrete Mathematik - Grundlagen und Methoden. Mathematik Kompakt, Birkhäuser 2012, ISBN 978-3-7643-8898-0, pp. I-IX, 1-137 - [j24]Julia Böttcher, Anusch Taraz, Andreas Würfl:
Perfect Graphs of Fixed Density: Counting and Homogeneous Sets. Comb. Probab. Comput. 21(5): 661-682 (2012) - 2011
- [j23]Julia Böttcher, Anusch Taraz, Andreas Würfl:
Induced C5-free graphs of fixed density: counting and homogeneous sets. Electron. Notes Discret. Math. 38: 181-186 (2011) - 2010
- [j22]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): 1217-1227 (2010) - [j21]Julia Böttcher, Peter Heinig, Anusch Taraz:
Embedding into Bipartite Graphs. SIAM J. Discret. Math. 24(4): 1215-1233 (2010)
2000 – 2009
- 2009
- [j20]Julia Böttcher, Yoshiharu Kohayakawa, Anusch Taraz:
Almost spanning subgraphs of random graphs after adversarial edge removal. Electron. Notes Discret. Math. 35: 335-340 (2009) - [j19]Michael Behrisch, Anusch Taraz, Michael Ueckerdt:
Coloring Random Intersection Graphs and Complex Networks. SIAM J. Discret. Math. 23(1): 288-299 (2009) - 2008
- [j18]Julia Böttcher, Klaas Paul Pruessmann, Anusch Taraz, Andreas Würfl:
Bandwidth, treewidth, separators, expansion, and universality. Electron. Notes Discret. Math. 31: 91-96 (2008) - [j17]Julia Böttcher, Mathias Schacht, Anusch Taraz:
Spanning 3-colourable subgraphs of small bandwidth in dense graphs. J. Comb. Theory B 98(4): 752-777 (2008) - [j16]Stefanie Gerke, Dirk Schlatter, Angelika Steger, Anusch Taraz:
The random planar graph process. Random Struct. Algorithms 32(2): 236-261 (2008) - 2007
- [j15]Stefanie Gerke, Hans Jürgen Prömel, Thomas Schickinger, Angelika Steger, Anusch Taraz:
K 4-free subgraphs of random graphs revisited. Comb. 27(3): 329-365 (2007) - [j14]Julia Böttcher, Mathias Schacht, Anusch Taraz:
Embedding spanning subgraphs of small bandwidth. Electron. Notes Discret. Math. 29: 485-489 (2007) - [c3]Julia Böttcher, Mathias Schacht, Anusch Taraz:
On the bandwidth conjecture for 3-colourable graphs. SODA 2007: 618-626 - 2006
- [j13]Michael Behrisch, Anusch Taraz:
Efficiently covering complex networks with cliques of similar vertices. Theor. Comput. Sci. 355(1): 37-47 (2006) - 2005
- [j12]Oleg Pikhurko, Anusch Taraz:
Degree Sequences of F-Free Graphs. Electron. J. Comb. 12 (2005) - [j11]Mathias Schacht, Anusch Taraz:
Globally bounded local edge colourings of hypergraphs. Electron. Notes Discret. Math. 19: 179-185 (2005) - [j10]Daniela Kühn, Deryk Osthus, Anusch Taraz:
Large planar subgraphs in dense graphs. J. Comb. Theory B 95(2): 263-282 (2005) - 2004
- [j9]Amin Coja-Oghlan, Anusch Taraz:
Exact and approximative algorithms for coloring G(n, p). Random Struct. Algorithms 24(3): 259-278 (2004) - 2003
- [j8]Deryk Osthus, Hans Jürgen Prömel, Anusch Taraz:
For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite? Comb. 23(1): 105-150 (2003) - [j7]Deryk Osthus, Hans Jürgen Prömel, Anusch Taraz:
On random planar graphs, the number of planar graphs and their triangulations. J. Comb. Theory B 88(1): 119-134 (2003) - [c2]Amin Coja-Oghlan, Anusch Taraz:
Colouring Random Graphs in Expected Polynomial Time. STACS 2003: 487-498 - 2001
- [j6]Hans Jürgen Prömel, Angelika Steger, Anusch Taraz:
Counting Partial Orders With A Fixed Number Of Comparable Pairs. Comb. Probab. Comput. 10(2): 159-177 (2001) - [j5]Hans Jürgen Prömel, Angelika Steger, Anusch Taraz:
Asymptotic enumeration, global structure, and constrained evolution. Discret. Math. 229(1-3): 213-233 (2001) - [j4]Hans Jürgen Prömel, Angelika Steger, Anusch Taraz:
Phase Transitions in the Evolution of Partial Orders. J. Comb. Theory A 94(2): 230-275 (2001) - [j3]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): 220-226 (2001) - [j2]Deryk Osthus, Anusch Taraz:
Random maximal H-free graphs. Random Struct. Algorithms 18(1): 61-82 (2001) - [c1]Hans Jürgen Prömel, Anusch Taraz:
Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders. Computational Discrete Mathematics 2001: 98-118
1990 – 1999
- 1999
- [b1]Anusch Taraz:
Phase transitions in the evolution of partially ordered sets. HU Berlin, Germany, 1999 - [j1]Vojtech Rödl, Andrzej Rucinski, Anusch Taraz:
Hypergraph Packing And Graph Embedding. Comb. Probab. Comput. 8(4): 363-376 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 22:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
