关注
Reto Spöhel
Reto Spöhel
在 bfh.ch 的电子邮件经过验证
标题
引用次数
引用次数
年份
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
582016
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
522011
Playing mastermind with many colors
B Doerr, C Doerr, R Spöhel, H Thomas
Journal of the ACM (JACM) 63 (5), 1-23, 2016
472016
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
442009
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
382016
Online Ramsey games in random graphs
M Marciniszyn, R Spöhel, A Steger
Combinatorics, Probability and Computing 18 (1-2), 271-300, 2009
372009
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
352018
Upper bounds on probability thresholds for asymmetric Ramsey properties
Y Kohayakawa, M Schacht, R Spöhel
Random Structures & Algorithms 44 (1), 1-28, 2014
312014
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
302009
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
252011
PAC learning and genetic programming
T Kötzing, F Neumann, R Spöhel
Proceedings of the 13th annual conference on Genetic and evolutionary …, 2011
202011
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
152007
Balanced online Ramsey games in random graphs
A Prakash, R Spöhel, H Thomas
the electronic journal of combinatorics 16 (1), R11, 2009
142009
Coloring random graphs online without creating monochromatic subgraphs
T Mütze, T Rast, R Spöhel
Random Structures & Algorithms 44 (4), 419-464, 2014
132014
Offline thresholds for Ramsey‐type games on random graphs
M Krivelevich, R Spöhel, A Steger
Random Structures & Algorithms 36 (1), 57-79, 2010
112010
The online clique avoidance game on random graphs
M Marciniszyn, R Spöhel, A Steger
International Workshop on Approximation Algorithms for Combinatorial …, 2005
112005
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
92010
On the path-avoidance vertex-coloring game
T Mütze, R Spöhel
Electronic Notes in Discrete Mathematics 38, 657-662, 2011
82011
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
72006
Creating small subgraphs in Achlioptas processes with growing parameter
M Krivelevich, R Spöhel
SIAM Journal on Discrete Mathematics 26 (2), 670-686, 2012
62012
系统目前无法执行此操作,请稍后再试。
文章 1–20