@incollection{UBHD-68942634,
  author={Bruhn, Henning and Heinlein, Matthias and Joos, Felix},
  title={The edge-Erdős-Pósa property},
  year={2018},
  pages={1-22},
  language={eng},
  note={Gesehen am 27.07.2022},
  booktitle={De.arxiv.org},
  doi={10.48550/arXiv.1809.11038},
}
@article{UBHD-68778481,
  author={Bruhn, Henning and Joos, Felix and Schaudt, Oliver},
  title={Erd{\"o}s-Pósa property for labeled minors},
  subtitle={2-connected minors},
  year={2021},
  pages={893-914},
  language={eng},
  issn={1095-7146},
  volume={35},
  number={2},
  note={Gesehen am 09.09.2021},
  journal={SIAM journal on discrete mathematics},
  doi={10.1137/19M1289340},
}
@incollection{UBHD-68942636,
  author={Bruhn, Henning and Joos, Felix and Schaudt, Oliver},
  title={Erdős-Pósa property for labelled minors},
  subtitle={2-connected minors},
  year={2018},
  pages={1-25},
  language={eng},
  note={Identifizierung der Ressource nach: 23 Sep 2019 ; Gesehen am 27.07.2022},
  booktitle={De.arxiv.org},
  doi={10.48550/arXiv.1805.00426},
}
@incollection{UBHD-68943297,
  author={Bruhn, Henning and Heinlein, Matthias and Joos, Felix},
  title={Long cycles have the edge-Erdős-Pósa property},
  year={2016},
  pages={1-29},
  language={eng},
  note={Identifizierung der Ressource nach: 30 May 2017 ; Gesehen am 27.07.2022},
  booktitle={De.arxiv.org},
  doi={10.48550/arXiv.1607.01903},
}
@incollection{UBHD-68941687,
  author={Ehard, Stefan and Joos, Felix},
  title={Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree},
  year={2020},
  pages={1-60},
  language={eng},
  note={Identifizierung der Ressource nach: 21 Jan 2021 ; Gesehen am 27.07.2022},
  booktitle={De.arxiv.org},
  doi={10.48550/arXiv.2011.05359},
}
@article{UBHD-68706635,
  author={Ehard, Stefan and Glock, Stefan and Joos, Felix},
  title={Pseudorandom hypergraph matchings},
  year={2020},
  pages={868-885},
  language={eng},
  issn={1469-2163},
  volume={29},
  number={6},
  note={Gesehen am 01.06.2022},
  journal={Combinatorics, probability & computing},
  doi={10.1017/S0963548320000280},
}
@incollection{UBHD-68942654,
  author={Ehard, Stefan and Glock, Stefan and Joos, Felix},
  title={A rainbow blow-up lemma for almost optimally bounded edge-colourings},
  year={2019},
  pages={1-28},
  language={eng},
  note={Gesehen am 27.07.2022},
  booktitle={De.arxiv.org},
  doi={10.48550/arXiv.1907.09950},
}
@article{UBHD-68664825,
  author={Ehard, Stefan and Glock, Stefan and Joos, Felix},
  title={A rainbow blow-up lemma for almost optimally bounded edge-colourings},
  year={2020},
  pages={1-32},
  language={eng},
  issn={2050-5094},
  volume={8},
  number={Artikel-ID e37},
  note={Gesehen am 24.11.2020},
  journal={Forum of mathematics},
  doi={10.1017/fms.2020.38},
}
@incollection{UBHD-68941703,
  author={Ehard, Stefan and Joos, Felix},
  title={A short proof of the blow-up lemma for approximate decompositions},
  year={2020},
  pages={1-26},
  language={eng},
  note={Gesehen am 27.07.2022},
  booktitle={De.arxiv.org},
  doi={10.48550/arXiv.2001.03506},
}
@article{UBHD-68941706,
  author={Fountoulakis, Nikolaos and Joos, Felix and Perarnau, Guillem},
  title={Percolation on random graphs with a fixed degree sequence},
  year={2022},
  pages={1-46},
  language={eng},
  issn={1095-7146},
  volume={36},
  number={1},
  note={Gesehen am 14.07.2022},
  journal={SIAM journal on discrete mathematics},
  doi={10.1137/20M1347607},
}
@incollection{UBHD-68941664,
  author={Glock, Stefan and Joos, Felix and Kim, Jaehoon and K{\"u}hn, Marcus and Lichev, Lyuben},
  title={Conflict-free hypergraph matchings},
  year={2022},
  pages={1-58},
  language={eng},
  note={Gesehen am 13.07.2022},
  booktitle={Arxiv},
  doi={10.48550/arXiv.2205.05564},
}
@incollection{UBHD-69358586,
  author={Glock, Stefan and Joos, Felix and Kim, Jaehoon and K{\"u}hn, Marcus and Lichev, Lyuben},
  title={Conflict-free hypergraph matchings},
  year={2023},
  pages={2991-},
  language={eng},
  journal={ACM-SIAM Symposium on Discrete Algorithms (34. : 2023 : Florenz; Online)Thirty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023) ; Volume 4 of 7},
}
@article{UBHD-68895817,
  author={Glock, Stefan and Gould, Stephen and Joos, Felix and K{\"u}hn, Daniela and Osthus, Deryk},
  title={Counting Hamilton cycles in Dirac hypergraphs},
  year={2021},
  pages={631-653},
  language={eng},
  issn={1469-2163},
  volume={30},
  number={4},
  note={First published online 17 December 2020 ; Gesehen am 17.03.2022},
  journal={Combinatorics, probability & computing},
  doi={10.1017/S0963548320000619},
}
@article{UBHD-68942659,
  author={Glock, Stefan and Joos, Felix and K{\"u}hn, Daniela and Osthus, Deryk},
  title={Euler tours in hypergraphs},
  year={2020},
  pages={679-690},
  language={eng},
  issn={1439-6912},
  volume={40},
  number={5},
  note={Gesehen am 27.07.2022},
  journal={Combinatorica},
  doi={10.1007/s00493-020-4046-8},
}
@incollection{UBHD-68942657,
  author={Glock, Stefan and Joos, Felix and K{\"u}hn, Daniela and Osthus, Deryk},
  title={Euler tours in hypergraphs},
  year={2018},
  pages={1-8},
  language={eng},
  note={Identifizierung der Ressource nach: 10 Mar 2020 ; Gesehen am 15.07.2022},
  booktitle={De.arxiv.org},
  doi={10.48550/arXiv.1808.07720},
}
@article{UBHD-68621034,
  author={Glock, Stefan and Joos, Felix},
  title={A rainbow blow-up lemma},
  year={2020},
  pages={1031-1069},
  language={eng},
  issn={1098-2418},
  volume={56},
  number={4},
  note={Gesehen am 27.07.2020},
  journal={Random structures & algorithms},
  doi={10.1002/rsa.20907},
}
@article{UBHD-68778659,
  author={Glock, Stefan and Joos, Felix and Kim, Jaehoon and K{\"u}hn, Daniela and Osthus, Deryk},
  title={Resolution of the Oberwolfach problem},
  year={2021},
  pages={2511-2547},
  language={eng},
  issn={1435-9863},
  volume={23},
  number={8},
  note={Published online: 2021-03-30 ; Gesehen am 10.09.2021},
  journal={Journal of the European Mathematical Society},
  doi={10.4171/JEMS/1060},
}
@incollection{UBHD-68941666,
  author={Hurley, Eoin and Joos, Felix and Lang, Richard},
  title={Sufficient conditions for perfect mixed tilings},
  year={2022},
  pages={1-34},
  language={eng},
  note={Gesehen am 14.07.2022},
  booktitle={Arxiv},
  doi={10.48550/arXiv.2201.03944},
}
@article{UBHD-69309747,
  author={Hurley, Eoin and Joos, Felix and Lang, Richard},
  title={Sufficient conditions for perfect mixed tilings},
  year={2025},
  pages={128-188},
  language={eng},
  volume={170},
  note={Online ver{\"o}ffentlicht: 24. September 2024 ; Gesehen am 26.02.2025},
  journal={Journal of combinatorial theory},
  doi={10.1016/j.jctb.2024.08.007},
}
@article{UBHD-68943295,
  author={Huynh, Tony and Joos, Felix and Wollan, Paul},
  title={A unified Erdős-Pósa theorem for constrained cycles},
  year={2019},
  pages={91-133},
  language={eng},
  issn={1439-6912},
  volume={39},
  number={1},
  note={Online first 14 August 2018 ; Gesehen am 27.07.2022},
  journal={Combinatorica},
  doi={10.1007/s00493-017-3683-z},
}
@article{UBHD-68943301,
  author={Jenssen, Matthew and Joos, Felix and Perkins, Will},
  title={On the hard sphere model and sphere packings in high dimensions},
  year={2019},
  pages={1-19},
  language={eng},
  issn={2050-5094},
  volume={7},
  number={Artikel-ID e1},
  note={Gesehen am 27.07.2022},
  journal={Forum of mathematics},
  doi={10.1017/fms.2018.25},
}
@incollection{UBHD-68941681,
  author={Joos, Felix and Kim, Jaehoon and K{\"u}hn, Daniela and Osthus, Deryk},
  title={A characterization of testable hypergraph properties},
  year={2017},
  pages={1-39},
  language={eng},
  note={Identifizierung der Ressource nach: 5 Oct 2021 ; Gesehen am 27.07.2022},
  booktitle={De.arxiv.org},
  doi={10.48550/arXiv.1707.03303},
}
@incollection{UBHD-68941677,
  author={Joos, Felix and K{\"u}hn, Marcus and Sch{\"u}lke, Bjarne},
  title={Decomposing hypergraphs into cycle factors},
  year={2021},
  pages={1-27},
  language={eng},
  note={Gesehen am 13.07.2022},
  booktitle={Arxiv},
  doi={10.48550/arXiv.2104.06333},
}
@incollection{UBHD-68941690,
  author={Joos, Felix and K{\"u}hn, Marcus},
  title={Fractional cycle decompositions in hypergraphs},
  year={2021},
  pages={1-14},
  language={eng},
  note={Gesehen am 27.07.2022},
  booktitle={Arxiv},
  doi={10.48550/arXiv.2101.05526},
}
@article{UBHD-68995943,
  author={Joos, Felix and K{\"u}hn, Marcus},
  title={Fractional cycle decompositions in hypergraphs},
  year={2022},
  pages={425-443},
  language={eng},
  issn={1098-2418},
  volume={61},
  number={3},
  note={Gesehen am 12.12.2022},
  journal={Random structures & algorithms},
  doi={10.1002/rsa.21070},
  url={https://doi.org/10.1002/rsa.21070},
  library={UB},
}
@incollection{UBHD-68941683,
  author={Joos, Felix and Kim, Jaehoon and K{\"u}hn, Daniela and Osthus, Deryk},
  title={Hypergraph regularity and random sampling},
  year={2021},
  pages={1-49},
  language={eng},
  note={Gesehen am 27.07.2022},
  booktitle={De.arxiv.org},
  doi={10.48550/arXiv.2110.01570},
}
@article{UBHD-68947320,
  author={Joos, Felix and Kim, Jaehoon},
  title={On a rainbow version of Dirac's theorem},
  year={2020},
  pages={498-504},
  language={eng},
  issn={1469-2120},
  volume={52},
  number={3},
  note={Gesehen am 27.07.2022},
  journal={Bulletin of the London Mathematical Society},
  doi={10.1112/blms.12343},
}
@incollection{UBHD-68942649,
  author={Joos, Felix and Kim, Jaehoon},
  title={On a rainbow version of Dirac's theorem},
  year={2019},
  pages={1-6},
  language={eng},
  note={Identifizierung der Ressource nach: 15 Apr 2020 ; Gesehen am 27.07.2022},
  booktitle={De.arxiv.org},
  doi={10.48550/arXiv.1910.01281},
}
@incollection{UBHD-68943292,
  author={Joos, Felix and Kim, Jaehoon and K{\"u}hn, Daniela and Osthus, Deryk},
  title={Optimal packings of bounded degree trees},
  year={2016},
  pages={1-56},
  language={eng},
  note={Identifizierung der Ressource nach: 13 Mar 2019 ; Gesehen am 27.07.2022},
  booktitle={De.arxiv.org},
  doi={10.48550/arXiv.1606.03953},
}
@article{UBHD-68942664,
  author={Joos, Felix and Kim, Jaehoon},
  title={Spanning trees in randomly perturbed graphs},
  year={2020},
  pages={169-219},
  language={eng},
  issn={1098-2418},
  volume={56},
  number={1},
  note={Published on: 17 October 2019 ; Gesehen am 15.07.2022},
  journal={Random structures & algorithms},
  doi={10.1002/rsa.20886},
}
@article{UBHD-69320458,
  author={Joos, Felix and Mubayi, Dhruv},
  title={Ramsey theory constructions from hypergraph matchings},
  year={2024},
  pages={4537-4550},
  language={eng},
  issn={1088-6826},
  volume={152},
  number={11},
  note={Gesehen am 20.03.2025},
  journal={Proceedings of the American Mathematical Society},
  doi={10.1090/proc/16413},
}
@article{UBHD-68882851,
  author={Joos, Felix},
  title={Schnelle Algorithmen und ihre Grenzen},
  subtitle={digitale Probleml{\"o}ser},
  year={2022},
  pages={88-95},
  language={ger},
  volume={19},
  note={Gesehen am 25.02.2022},
  journal={Ruperto Carola},
  editor={Pfeiffer, Thomas},
  doi={10.17885/heiup.ruca.2022.19.24511},
}
@article{UBHD-69273578,
  author={Joos, Felix and Schrodt, Jonathan},
  title={Counting oriented trees in digraphs with large minimum semidegree},
  year={2024},
  pages={236-270},
  language={eng},
  volume={168(2024) vom: Sept.},
  note={Online verf{\"u}gbar: 29. Mai 2024 ; Gesehen am 14.11.2024},
  journal={Journal of combinatorial theory},
  doi={10.1016/j.jctb.2024.05.004},
}