Enhancing sensitivity diagnostics for qualitative comparative analysis: A combinatorial approach A Thiem, R Spöhel, A Duşa Political Analysis 24 (1), 104-120, 2016 | 58 | 2016 |
Explosive percolation in Erdős-Rényi-like random graph processes K Panagiotou, R Spöhel, A Steger, H Thomas Electronic Notes in Discrete Mathematics 38, 699-704, 2011 | 52 | 2011 |
Playing mastermind with many colors B Doerr, C Doerr, R Spöhel, H Thomas Journal of the ACM (JACM) 63 (5), 1-23, 2016 | 47 | 2016 |
Asymmetric Ramsey properties of random graphs involving cliques M Marciniszyn, J Skokan, R Spöhel, A Steger Random Structures & Algorithms 34 (4), 419-453, 2009 | 44 | 2009 |
QCApro: professional functionality for performing and evaluating qualitative comparative analysis A Thiem, M Baumgartner, A Duşa, R Spoehel R package version, 1.1-1, 2016 | 38 | 2016 |
Online Ramsey games in random graphs M Marciniszyn, R Spöhel, A Steger Combinatorics, Probability and Computing 18 (1-2), 271-300, 2009 | 37 | 2009 |
Qcapro: Advanced functionality for performing and evaluating qualitative comparative analysis A Thiem, M Baumgartner, A Dusa, R Spoehel R package version, 1.1-2, 2018 | 35 | 2018 |
Upper bounds on probability thresholds for asymmetric Ramsey properties Y Kohayakawa, M Schacht, R Spöhel Random Structures & Algorithms 44 (1), 1-28, 2014 | 31 | 2014 |
Upper bounds for online Ramsey games in random graphs M Marciniszyn, R Spöhel, A Steger Combinatorics, Probability and Computing 18 (1-2), 259-270, 2009 | 30 | 2009 |
Small subgraphs in random graphs and the power of multiple choices T Mütze, R Spöhel, H Thomas Journal of Combinatorial Theory, Series B 101 (4), 237-268, 2011 | 25 | 2011 |
PAC learning and genetic programming T Kötzing, F Neumann, R Spöhel Proceedings of the 13th annual conference on Genetic and evolutionary …, 2011 | 20 | 2011 |
Online vertex colorings of random graphs without monochromatic subgraphs M Marciniszyn, R Spöhel Symposium on Discrete Algorithms: Proceedings of the eighteenth annual ACM …, 2007 | 15 | 2007 |
Balanced online Ramsey games in random graphs A Prakash, R Spöhel, H Thomas the electronic journal of combinatorics 16 (1), R11, 2009 | 14 | 2009 |
Coloring random graphs online without creating monochromatic subgraphs T Mütze, T Rast, R Spöhel Random Structures & Algorithms 44 (4), 419-464, 2014 | 13 | 2014 |
Offline thresholds for Ramsey‐type games on random graphs M Krivelevich, R Spöhel, A Steger Random Structures & Algorithms 36 (1), 57-79, 2010 | 11 | 2010 |
The online clique avoidance game on random graphs M Marciniszyn, R Spöhel, A Steger International Workshop on Approximation Algorithms for Combinatorial …, 2005 | 11 | 2005 |
Coloring the edges of a random graph without a monochromatic giant component R Spöhel, A Steger, H Thomas the electronic journal of combinatorics, R133-R133, 2010 | 9 | 2010 |
On the path-avoidance vertex-coloring game T Mütze, R Spöhel Electronic Notes in Discrete Mathematics 38, 657-662, 2011 | 8 | 2011 |
Threshold functions for asymmetric Ramsey properties involving cliques M Marciniszyn, J Skokan, R Spöhel, A Steger Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2006 | 7 | 2006 |
Creating small subgraphs in Achlioptas processes with growing parameter M Krivelevich, R Spöhel SIAM Journal on Discrete Mathematics 26 (2), 670-686, 2012 | 6 | 2012 |