Evolution of high-order connected components in random hypergraphs. - Oliver Cooley; Mihyun Kang; Christoph Koch 006 (Electron. Notes Discret. Math., 2015)

Bootstrap percolation in random k-uniform hypergraphs. - Mihyun Kang; Christoph Koch 006; Tamás Makai (Electron. Notes Discret. Math., 2015)

The Phase Transition in Multitype Binomial Random Graphs. - Mihyun Kang; Christoph Koch 006; Angélica Pachón (SIAM J. Discret. Math., 2015)

Bootstrap Percolation on Geometric Inhomogeneous Random Graphs. - Christoph Koch 006; Johannes Lengler (ICALP, 2016)

Threshold and Hitting Time for High-Order Connectedness in Random Hypergraphs. - Oliver Cooley; Mihyun Kang; Christoph Koch 006 (Electron. J. Comb., 2016)

Jigsaw percolation on random hypergraphs. - Béla Bollobás; Oliver Cooley; Mihyun Kang; Christoph Koch 006 (J. Appl. Probab., 2017)

The size of the giant high-order component in random hypergraphs. - Oliver Cooley; Mihyun Kang; Christoph Koch 006 (Random Struct. Algorithms, 2018)

The Size of the Giant Component in Random Hypergraphs: a Short Proof. - Oliver Cooley; Mihyun Kang; Christoph Koch 006 (Electron. J. Comb., 2019)

Actionable Explainable AI (AxAI): A Practical Example with Aggregation Functions for Adaptive Classification and Textual Explanations for Interpretable Machine Learning. - Anna Saranti; Miroslav Hudec; Erika Mináriková; Zdenko Takác; Udo Großschedl; Christoph Koch 006; Bastian Pfeifer; Alessa Angerschmid; Andreas Holzinger (Mach. Learn. Knowl. Extr., 2022)