Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Anusch Taraz

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Mathias Schacht

> Home > Persons > Anusch Taraz

Publications

2021
[j38]
- view
  authority control:
- export record
  dblp key:
  - journals/cpc/ClemensMRST21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cpc/ClemensMRST21
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)
2017
[j35]
- view
  authority control:
- export record
  dblp key:
  - journals/ejc/KohayakawaMST17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ejc/KohayakawaMST17
Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz:
Counting results for sparse pseudorandom hypergraphs I. Eur. J. Comb. 65: 276-287 (2017)
[j34]
- view
  authority control:
- export record
  dblp key:
  - journals/ejc/KohayakawaMST17a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ejc/KohayakawaMST17a
Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz:
Counting results for sparse pseudorandom hypergraphs II. Eur. J. Comb. 65: 288-301 (2017)
2015
[j32]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/ejc/MotaSST15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ejc/MotaSST15
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)
[j28]
- view
  authority control:
- export record
  dblp key:
  - journals/endm/KohayakawaMST15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/KohayakawaMST15
Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz:
A counting lemma for sparse pseudorandom hypergraphs. Electron. Notes Discret. Math. 50: 421-426 (2015)
2008
[j17]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jct/BottcherST08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/BottcherST08
Julia Böttcher, Mathias Schacht, Anusch Taraz:
Spanning 3-colourable subgraphs of small bandwidth in dense graphs. J. Comb. Theory, Ser. B 98(4): 752-777 (2008)
2007
[j14]
- view
  authority control:
- export record
  dblp key:
  - journals/endm/BottcherST07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/BottcherST07
Julia Böttcher, Mathias Schacht, Anusch Taraz:
Embedding spanning subgraphs of small bandwidth. Electron. Notes Discret. Math. 29: 485-489 (2007)
[c3]
- view
  - electronic edition @ acm.org
  - no references & citations available
- export record
  dblp key:
  - conf/soda/BottcherST07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/BottcherST07
Julia Böttcher, Mathias Schacht, Anusch Taraz:
On the bandwidth conjecture for 3-colourable graphs. SODA 2007: 618-626
2005
[j11]
- view
  authority control:
- export record
  dblp key:
  - journals/endm/SchachtT05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/SchachtT05
Mathias Schacht, Anusch Taraz:
Globally bounded local edge colourings of hypergraphs. Electron. Notes Discret. Math. 19: 179-185 (2005)

a service of

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.