The Online Clique Avoidance Game on Random Graphs. - Martin Marciniszyn; Reto Spöhel; Angelika Steger (APPROX-RANDOM, 2005)

Threshold Functions for Asymmetric Ramsey Properties Involving Cliques. - Martin Marciniszyn; Jozef Skokan; Reto Spöhel; Angelika Steger (APPROX-RANDOM, 2006)

Online vertex colorings of random graphs without monochromatic subgraphs. - Martin Marciniszyn; Reto Spöhel (SODA, 2007)

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

Upper Bounds for Online Ramsey Games in Random Graphs. - Martin Marciniszyn; Reto Spöhel; Angelika Steger (Comb. Probab. Comput., 2009)

Online Ramsey Games in Random Graphs. - Martin Marciniszyn; Reto Spöhel; Angelika Steger (Comb. Probab. Comput., 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)

Asymmetric Ramsey properties of random graphs involving cliques. - Martin Marciniszyn; Jozef Skokan; Reto Spöhel; Angelika Steger (Random Struct. Algorithms, 2009)

Online vertex-coloring games in random graphs. - Martin Marciniszyn; Reto Spöhel (Comb., 2010)

On Euclidean vehicle routing with allocation. - Jan Remy; Reto Spöhel; Andreas Weißl (Comput. Geom., 2010)

Offline thresholds for Ramsey-type games on random graphs. - Michael Krivelevich; Reto Spöhel; Angelika Steger (Random Struct. Algorithms, 2010)

PAC learning and genetic programming. - Timo Kötzing; Frank Neumann 001; Reto Spöhel (GECCO, 2011)

Von Neumann and Newman poker with a flip of hand values. - Nicla Bernasconi; Julian Lorenz; Reto Spöhel (Discret. Math., 2011)

On Balanced Coloring Games in Random Graphs. - Luca Gugelmann; Reto Spöhel (Electron. Notes Discret. Math., 2011)

On the path-avoidance vertex-coloring game. - Torsten Mütze; Reto Spöhel (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)

Probabilistic One-Player Ramsey Games via Deterministic Two-Player Games. - Michael Belfrage; Torsten Mütze; Reto Spöhel (SIAM J. Discret. Math., 2012)

Creating Small Subgraphs in Achlioptas Processes With Growing Parameter. - Michael Krivelevich; Reto Spöhel (SIAM J. Discret. Math., 2012)

Upper bounds on probability thresholds for asymmetric Ramsey properties. - Yoshiharu Kohayakawa; Mathias Schacht; Reto Spöhel (Random Struct. Algorithms, 2014)

Coloring random graphs online without creating monochromatic subgraphs. - Torsten Mütze; Thomas Rast; Reto Spöhel (Random Struct. Algorithms, 2014)

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