|
1 |
The Random Greedy Hypergraph Matching Process Kühn, Marcus. - Heidelberg : Universitätsbibliothek Heidelberg, 2025
|
|
|
2 |
Engineering Weighted Connectivity Augmentation Algorithms Fonseca Faraj, Marcelo. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
3 |
A Short Proof of the Blow-Up Lemma for Approximate Decompositions Enthalten in Combinatorica 19.5.2022: 1-49
|
|
|
4 |
The Edge-Erdős-Pósa Property Enthalten in Combinatorica 30.11.2020: 1-27
|
|
|
5 |
Euler Tours in Hypergraphs Enthalten in Combinatorica 22.5.2020: 1-12
|
|
|
6 |
A Unified Erdős–Pósa Theorem for Constrained Cycles Enthalten in Combinatorica 14.8.2018: 1-43
|
|
|
7 |
Long Cycles have the Edge-Erdős-Pósa Property Enthalten in Combinatorica 17.5.2018: 1-36
|
|
|
8 |
Regular subgraphs and other stories Joos, Felix. - Ulm : Universität Ulm. Fakultät für Mathematik und Wirtschaftswissenschaften, 2015
|
|
|
9 |
The large N factorization does not hold for arbitrary multi-trace observables in random tensors Enthalten in Letters in mathematical physics Bd. 115, 26.8.2025, Nr. 4, date:8.2025: 1-17
|
|
|
10 |
Joos, Felix 1989- / Ulm, Univ., Tag der Promotion: 30.06.2015
|
|