| Heavy-tailed mutation operators in single-objective combinatorial optimization T Friedrich, A Göbel, F Quinzan, M Wagner Parallel Problem Solving from Nature–PPSN XV: 15th International Conference …, 2018 | 37 | 2018 |
| Amplifiers for the Moran process A Galanis, A Göbel, LA Goldberg, J Lapinskas, D Richerby Journal of the ACM (JACM) 64 (1), 1-90, 2017 | 34 | 2017 |
| Greedy maximization of functions with bounded curvature under partition matroid constraints T Friedrich, A Göbel, F Neumann, F Quinzan, R Rothenberger Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 2272-2279, 2019 | 33 | 2019 |
| Counting homomorphisms to square-free graphs, modulo 2 A Göbel, LA Goldberg, D Richerby ACM Transactions on Computation Theory (TOCT) 8 (3), 1-29, 2016 | 19 | 2016 |
| The complexity of counting homomorphisms to cactus graphs modulo 2 A Göbel, LA Goldberg, D Richerby ACM Transactions on Computation Theory (TOCT) 6 (4), 1-29, 2014 | 19 | 2014 |
| On the connection between interval size functions and path counting E Bampas, AN Göbel, A Pagourtzis, A Tentes computational complexity 26, 421-467, 2017 | 12 | 2017 |
| A spectral independence view on hard spheres via block dynamics T Friedrich, A Göbel, MS Krejca, M Pappik SIAM Journal on Discrete Mathematics 36 (3), 2282-2322, 2022 | 10 | 2022 |
| Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations F Quinzan, A Göbel, M Wagner, T Friedrich Natural Computing, 1-15, 2021 | 9 | 2021 |
| Evolutionary algorithms and submodular functions: Benefits of heavy-tailed mutations T Friedrich, A Göbel, F Quinzan, M Wagner arXiv preprint arXiv:1805.10902, 2018 | 9 | 2018 |
| Zeros and approximations of Holant polynomials on the complex plane K Casel, P Fischbeck, T Friedrich, A Göbel, JAG Lagodzinski computational complexity 31 (2), 11, 2022 | 7 | 2022 |
| Counting homomorphisms to trees modulo a prime A Göbel, JA Lagodzinski, K Seidel arXiv preprint arXiv:1802.06103, 2018 | 6 | 2018 |
| Polymer dynamics via cliques: New conditions for approximations T Friedrich, A Göbel, MS Krejca, M Pappik Theoretical Computer Science 942, 230-252, 2023 | 5 | 2023 |
| Counting homomorphisms to cactus graphs modulo 2 A Göbel, LA Goldberg, D Richerby 31st International Symposium on Theoretical Aspects of Computer Science …, 2014 | 5 | 2014 |
| Algorithms for hard-constraint point processes via discretization T Friedrich, A Göbel, M Katzmann, MS Krejca, M Pappik Computing and Combinatorics: 28th International Conference, COCOON 2022 …, 2023 | 4 | 2023 |
| The impact of heterogeneity and geometry on the proof complexity of random satisfiability T Bläsius, T Friedrich, A Göbel, J Levy, R Rothenberger Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 42-53, 2021 | 4 | 2021 |
| Intuitive analyses via drift theory A Göbel, T Kötzing, MS Krejca arXiv preprint arXiv:1806.01919, 2018 | 3 | 2018 |
| On counting (quantum-) graph homomorphisms in finite fields JAG Lagodzinski, A Göbel, K Casel, T Friedrich 48th International Colloquium on Automata, Languages, and Programming, ICALP …, 2021 | 2 | 2021 |
| Guest column: A panorama of counting problems the decision version of which is in P3 E Bakali, A Chalki, A Göbel, A Pagourtzis, S Zachos ACM SIGACT News 53 (3), 46-68, 2022 | 1 | 2022 |
| Analysis of the survival time of the SIS and SIRS process on stars and cliques T Friedrich, A Göbel, N Klodt, MS Krejca, M Pappik arXiv preprint arXiv:2205.02653, 2022 | 1 | 2022 |
| Using random graphs to sample repulsive Gibbs point processes with arbitrary-range potentials T Friedrich, A Göbel, M Katzmann, M Krejca, M Pappik arXiv preprint arXiv:2204.01793, 2022 | 1 | 2022 |
