19 Einträge gefunden

1. Perfectly packing graphs with bounded degeneracy and many leaves

   1. Allen, Peter
   2. Böttcher, Julia
   3. Clemens, Dennis
   4. Taraz, Anusch

   2022 - TUHH Open Research
2. On the size-Ramsey number of grid graphs

   1. Clemens, Dennis
   2. Miralaei, Meysam
   3. Reding, Damian
   4. Schacht, Mathias
   5. Taraz, Anusch

   2021 - TUHH Open Research
3. A spanning bandwidth theorem in random graphs

   1. Allen, Peter
   2. Böttcher, Julia
   3. Ehrenmüller, Julia
   4. Schnitzer, Jakob
   5. Taraz, Anusch

   2021 - TUHH Open Research
4. The bandwidth theorem in sparse graphs

   1. Allen, Peter
   2. Böttcher, Julia
   3. Ehrenmüller, Julia
   4. Taraz, Anusch

   2020 - TUHH Open Research - frei zugänglich
5. Artificial intelligence and operations research in maritime logistics

   1. Dornemann, Jorin
   2. Rückert, Nicolas
   3. Fischer, Kathrin
   4. Taraz, Anusch

   2020 - TUHH Open Research - frei zugänglich
6. Logical limit laws for minor-closed classes of graphs

   1. Heinig, Peter
   2. Müller, Tobias
   3. Noy, Marc
   4. Taraz, Anusch

   2018 - TUHH Open Research
7. On minimum bisection and related cut problems in trees and tree-like graphs

   1. Fernandes, Cristina G.
   2. Schmidt, Tina Janne
   3. Taraz, Anusch

   2018 - TUHH Open Research
8. Counting results for sparse pseudorandom hypergraphs I

   1. Kohayakawa, Yoshiharu
   2. Mota, Guilherme Oliveira
   3. Schacht, Mathias
   4. Taraz, Anusch

   2017 - TUHH Open Research
9. Counting results for sparse pseudorandom hypergraphs II

   1. Kohayakawa, Yoshiharu
   2. Mota, Guilherme Oliveira
   3. Schacht, Mathias
   4. Taraz, Anusch

   2017 - TUHH Open Research
10. How to calculate the main aortic graft-diameter for a chimney-graft

    1. Kölbel, Tilo
    2. Carpenter, Sebastian W
    3. Taraz, Anusch
    4. Taraz, Martin
    5. Larena-Avellaneda, Axel
    6. Debus, Eike S

    2016 - Forschungsinformationssystem des UKE
11. An approximate version of the tree packing conjecture

    1. Böttcher, Julia
    2. Hladký, Jan
    3. Piguet, Diana
    4. Taraz, Anusch

    2016 - TUHH Open Research
12. Spanning embeddings of arrangeable graphs with sublinear bandwidth

    1. Böttcher, Julia
    2. Taraz, Anusch
    3. Würfl, Andreas

    2016 - TUHH Open Research
13. An extension of the blow-up lemma to arrangeable graphs

    1. Böttcher, Julia
    2. Kohayakawa, Yoshiharu
    3. Taraz, Anusch
    4. Würfl, Andreas

    2015 - TUHH Open Research
14. A counting lemma for sparse pseudorandom hypergraphs

    1. Kohayakawa, Yoshiharu
    2. Mota, Guilherme Oliveira
    3. Schacht, Mathias
    4. Taraz, Anusch

    2015 - TUHH Open Research
15. Approximating Minimum k-Section in Trees with Linear Diameter

    1. Fernandes, Cristina G.
    2. Schmidt, Tina Janne
    3. Taraz, Anusch

    2015 - TUHH Open Research
16. Ramsey numbers for bipartite graphs with small bandwidth

    1. Mota, Guilherme Oliveira
    2. Sárközy, G. N.
    3. Schacht, Mathias
    4. Taraz, Anusch

    2015 - TUHH Open Research
17. Local resilience of spanning subgraphs in sparse random graphs

    1. Allen, Peter
    2. Böttcher, Julia
    3. Ehrenmüller, Julia
    4. Taraz, Anusch

    2015 - TUHH Open Research
18. On minimum bisection and related partition problems in graphs with bounded tree width

    1. Fernandes, Cristina G.
    2. Schmidt, Tina Janne
    3. Taraz, Anusch

    2015 - TUHH Open Research
19. Coloring d-embeddable k-uniform hypergraphs

    1. Heise, Carl Georg
    2. Panagiotou, Konstantinos
    3. Pikhurko, Oleg
    4. Taraz, Anusch

    2014 - TUHH Open Research