Your search returned the following 8 documents:

8. Explosive percolation in Erdös-Rényi-like random graph processes
   Konstantinos Panagiotou, Reto Spöhel, Angelika Steger, and Henning Thomas
   Combinatorics, Probability and Computing 22 (1): 133-145, 2013
   
7. Playing Mastermind with many colors
   Benjamin Doerr, Reto Spöhel, Henning Thomas, and Carola Winzen
   In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), New Orleans, USA, 2013, 695-704
   
6. Playing Mastermind with Many Colors
   Benjamin Doerr, Carola Doerr, Reto Spöhel, and Henning Thomas
   arXiv abs/1207.0773: 1-22, 2013
   
5. Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning
   Henning Meyerhenke and Thomas Sauerwald
   Algorithmica 64 (3): 329-361, 2012
   
4. Playing Mastermind with Many Colors
   Benjamin Doerr, Reto Spöhel, Henning Thomas, and Carola Winzen
   In: Proc. of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2012), Munich. Germany, 2012
   
3. Explosive percolation in Erdős-Rényi-like random graph processes
   Konstantinos Panagiotou, Reto Spöhel, Angelika Steger, and Henning Thomas
   In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, Budapest, 2011, 699-704
   
2. Approximation Algorithms for 3D Orthogonal Knapsack
   Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, and Henning Thomas
   In: Theory and Applications of Models of Computation, Shanghai, China, 2007, 34-45
   [PDF: Download: Approximation Algorithms for 3D Orthogonal Knapsack (TAMC07).pdf]
   
1. Approximation Algorithms for 3D Orthogonal Knapsack
   Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, and Henning Thomas
   Journal of Science and Technology 23 (5): 749-762, 2008
   [PDF: Download: Diedrich,Harren,Jansen,Thoele,Thomas-JCST2008.pdf]