Sparse general matrix-matrix multiplication on GPUs is challenging due to the varying sparsity patterns of sparse matrices. Existing solutions achieve good performance for certain types of matrices, but fail to accelerate all kinds of matrices in the same manner. Our approach combines multiple strategies with dynamic parameter selection to dynamically choose and tune the best fitting algorithm for each row of the matrix. This choice is supported by a lightweight, multi-level matrix analysis, which carefully balances between analysis cost and expected performance gains. Our evaluation on thousands of matrices with various characteristics shows that we outperform all existing solutions in 85% of the cases and that we achieve the second best performance in 12%. Over the entire data set, our solution is on average twice as fast as the second best approach and up to 25$\times$ faster than other state-of-the-art GPU implementations. Using our approach, applications can expect the best performance independent of the matrices they work on.