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 Yoshiharu Kohayakawa

> Home > Persons > Anusch Taraz

Publications

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
[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)
[j27]
- view
  authority control:
- export record
  dblp key:
  - journals/siamdm/BottcherKTW15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/BottcherKTW15
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)
2013
[j25]
- view
  authority control:
- export record
  dblp key:
  - journals/cpc/BottcherKT13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cpc/BottcherKT13
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)
2009
[j20]
- view
  authority control:
- export record
  dblp key:
  - journals/endm/BottcherKT09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/BottcherKT09
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)

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.