Approximation Algorithms for 3D Orthogonal Knapsack. - Florian Diedrich; Rolf Harren; Klaus Jansen; Ralf Thöle; Henning Thomas (J. Comput. Sci. Technol., 2008)

Balanced Online Ramsey Games in Random Graphs. - Anupam Prakash; Reto Spöhel; Henning Thomas (Electron. J. Comb., 2009)

Coloring the edges of a random graph without a monochromatic giant component. - Reto Spöhel; Angelika Steger; Henning Thomas (Electron. Notes Discret. Math., 2009)

A Randomized Version of Ramsey's Theorem. - Luca Gugelmann; Yury Person; Angelika Steger; Henning Thomas (Electron. Notes Discret. Math., 2011)

Explosive Percolation in Erdős-Rényi-Like Random Graph Processes. - Konstantinos Panagiotou; Reto Spöhel; Angelika Steger; Henning Thomas (Electron. Notes Discret. Math., 2011)

Small subgraphs in random graphs and the power of multiple choices. - Torsten Mütze; Reto Spöhel; Henning Thomas (J. Comb. Theory B, 2011)

Aspects of games on random graphs. - Henning Thomas (2013)

Internal DLA: Efficient Simulation of a Physical Growth Model - (Extended Abstract). - Karl Bringmann; Fabian Kuhn; Konstantinos Panagiotou; Ueli Peter; Henning Thomas (ICALP (1), 2014)

Playing Mastermind With Many Colors. - Benjamin Doerr; Carola Doerr; Reto Spöhel; Henning Thomas (J. ACM, 2016)