Felix Joos
School of Mathematics, University of Birmingham. Office 110, Watson Building (R15) Email: f.joos at bham.ac.uk (Last updated: Aug, 2018)

I studied Mathematics at the University of Ulm (Germany) from 2009 to 2013. Afterwards I was a PhDstudent of Dieter Rautenbach in Ulm until 2015. From 2015 to 2017 I was a Research Fellow at the University of Birmingham. Since August 2017, I have been supported by a DFG Research Fellowship.
My research focuses mainly on Algorithmic and Structural Graph Theory and Probabilistic Combinatorics.
RESEARCH
Journal Publications
Preprints submitted:
 The edgeErdősPósa property (with H. Bruhn and M. Heinlein).
 Euler tours in hypergraphs (with S. Glock, D. Kühn, and D. Osthus).
 Resolution of the Oberwolfach problem (with S. Glock, J. Kim, D. Kühn, and D. Osthus).
 ErdosPosa property for labelled minors: 2connected minors (with H. Bruhn and O. Schaudt).
 Edge correlations in random regular hypergraphs and applications to subgraph testing (with A. Espuny Diaz, D. Kühn, and D. Osthus).
 Spanning trees in randomly perturbed graphs (with J. Kim).
 A rainbow blowup lemma (with S. Glock).
 A characterization of testable hypergraph properties (with J. Kim, D. Kühn, and D. Osthus, extended abstract: FOCS 2017, 859867).
 On the hard sphere model and sphere packings in high dimensions (with M. Jenssen and W. Perkins).
 Percolation on random graphs with a fixed degree sequence (with N. Fountoulakis and G. Perarnau).
Preprints accepted:
 Optimal packings of bounded degree trees (with J. Kim, D. Kühn, and D. Osthus, to appear in J. Eur. Math. Soc.).
 Long cycles have the edgeErdősPósa property (with H. Bruhn and M. Heinlein, to appear in Combinatorica).
 A unified theorem for packing disjoint cycles under constraints via doubly grouplabeled graphs (with T. Huynh and P. Wollan, to appear in Combinatorica).
Published articles:
2018
 On kissing numbers and spherical codes in high dimesions (with M. Jenssen and W. Perkins, Adv. Math. 335 (2018), 307321).
 Critical percolation on random regular graphs (with G. Perarnau, Proc. Amer. Math. Soc. 146 (2018), 33213332.).
 Frames, Apaths and the ErdősPósa property (with H. Bruhn and M. Heinlein, SIAM J. Discrete Math. 32 (2018), 12461260).
 Long paths and cycles in random subgraphs of graphs with large minimum degree (with S. Ehard, Electron. J. Combin. 25 (2018), no. 2, Paper 31, 15 pp).
 Long cycles through prescribed vertices have the ErdosPosa property (with H. Bruhn and O. Schaudt, J. Graph Theory 87 (2018), 275284).
 How to determine if a random graph with a fixed degree sequence has a giant component (with G. Perarnau, D. Rautenbach and B. Reed, Probab. Theory Related Fields 170 (2018), 263310, extended abstract: FOCS 2016, 695703).
 A stronger bound for the strong chromatic index (with H. Bruhn, Combin. Probab. Comput. 27 (2018), 2143).
2017
 Parity linkage and the ErdosPosa property of odd cycles through prescribed vertices in highly connected graphs (J. Graph Theory 85 (2017), 747758).
2016
 Induced Matchings in Graphs of Bounded Maximum Degree (SIAM J. Discrete Math. 30 (2016), 18761882).
 Induced Cycles in Graphs (with M. A. Henning, C. Löwenstein and T. Sasse, Graphs Combin. 32 (2016), 24252441).
 Structural Parameterizations for Boxicity (with H. Bruhn, M. Chopin and O. Schaudt, Algorithmica 74 (2016), 14531472).
 Induced 2Regular Subgraphs in kChordal Cubic Graphs (with M. A. Henning, C. Löwenstein and D. Rautenbach, Discrete Appl. Math. 205 (2016), 7379).
 Induced Matchings in Graphs of Maximum Degree 4 (with V. H. Nguyen, SIAM J. Discrete Math. 30 (2016), 154165).
 The Cycle Spectrum of Clawfree Hamiltonian Graphs (with J. Eckert and D. Rautenbach, Graphs Combin. 32 (2016), 93–101).
2015
 Random Subgraphs in Sparse Graphs (SIAM J. Discrete Math. 29 (2015), 23502360).
 Maximum Induced Matchings close to Maximum Matchings (with M. A. Duarte, L. D. Penso, D. Rautenbach and U. Souza, Theoret. Comput. Sci. 588 (2015), 131–137).
 Equality of Distance Packing Numbers (with D. Rautenbach, Discrete Math. 338 (2015), 2374–2377).
 Longest Paths in Circular Arc Graphs (Discuss. Math. Graph Theory 35 (2015), 419–426).
 A Characterization of Mixed Unit Interval Graphs (J. Graph Theory 79 (2015), 267–281).
 BadlyCovered Graphs (with M.R. Cappelle, J. Müttel and D. Rautenbach, Discrete Appl. Math. 182 (2015), 99–103).
 Forests and Trees among Gallai Graphs (with V. B. Le and D. Rautenbach, Discrete Math. 338 (2015), 190–195).
2014
 Relating Ordinary and Total Domination in Cubic Graphs of Large Girth (with S. Dantas, C. Löwenstein, D. Rautenbach and D. Sousa, Discrete Appl. Math. 174 (2014) 128132).
 A Characterization of Substar Graphs (Discrete Appl. Math. 175 (2014) 115118).
 Graphs of Interval Count Two with a Given Partition (with C. Lowenstein, F. S. Oliveira, D. Rautenbach and J. L. Szwarcfiter, Inform. Process. Lett. 114 (2014), 542–546).
 Induced Matchings in Subcubic Graphs (with T. Sasse and D. Rautenbach, SIAM J. Discrete Math. 28 (2014), 468–473).
 Independence and Matching Number in Graphs with Maximum Degree 4 (Discrete Math. 323 (2014), 16).
20122013
 Ramsey Results for Cycle Spectra (with S. Brandt, J. Müttel and D. Rautenbach, J. Graph Theory 74 (2013), 210215).
 Random Subgraphs in Cartesian Powers of Regular Graphs (Electron. J. Combin. 19 (2012), Paper 47, 12 pp.).
Refereed Conference Publications
 A characterization of testable hypergraph properties (with J. Kim, D. Kühn, and D. Osthus, FOCS 2017, 859867).
 How to determine if a random graph with a fixed degree sequence has a giant component (with G. Perarnau, D. Rautenbach and B. Reed, FOCS 2016, 695703).
 Parity linkage and the ErdosPosa property of odd cycles through prescribed vertices in highly connected graphs (WG 2015, LNCS 9224, 339350).
 Structural Parameterizations for Boxicity (with H. Bruhn, M. Chopin and O. Schaudt, WG 2014, LNCS 8747, 117128).
 A Characterization of Mixed Unit Interval Graphs (WG 2014, LNCS 8747, 324335). Awarded with the "Best Student Paper Award".