| 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 | 49 | 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 | 43 | 2019 |
| Heavy-tailed mutation operators in single-objective combinatorial optimization T Friedrich, A Göbel, F Quinzan, M Wagner International Conference on Parallel Problem Solving from Nature, 134-145, 2018 | 40 | 2018 |
| 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 |
| Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations F Quinzan, A Göbel, M Wagner, T Friedrich Natural Computing, 1-15, 2021 | 17 | 2021 |
| 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 | 16 | 2022 |
| On the connection between interval size functions and path counting E Bampas, AN Göbel, A Pagourtzis, A Tentes computational complexity 26 (2), 421-467, 2017 | 12 | 2017 |
| Cliques in high-dimensional geometric inhomogeneous random graphs T Friedrich, A Göbel, M Katzmann, L Schiller SIAM Journal on Discrete Mathematics 38 (2), 1943-2000, 2024 | 9 | 2024 |
| 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 Random Structures & Algorithms 63 (4), 885-941, 2023 | 9 | 2023 |
| Polymer dynamics via cliques: New conditions for approximations T Friedrich, A Göbel, MS Krejca, M Pappik Theoretical Computer Science 942, 230-252, 2023 | 9 | 2023 |
| 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 | 9 | 2022 |
| 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 |
| Counting homomorphisms to trees modulo a prime A Göbel, JAG Lagodzinski, K Seidel ACM Transactions on Computation Theory (TOCT) 13 (3), 1-33, 2021 | 7 | 2021 |
| Counting list matrix partitions of graphs A Gobel, LA Goldberg, C McQuillan, D Richerby, T Yamakami SIAM Journal on Computing 44 (4), 1089-1118, 2015 | 7 | 2015 |
| A simple statistic for determining the dimensionality of complex networks T Friedrich, A Göbel, M Katzmann, L Schiller arXiv e-prints, arXiv: 2302.06357, 2023 | 6 | 2023 |
| Perfect sampling for hard spheres from strong spatial mixing K Anand, A Göbel, M Pappik, W Perkins arXiv preprint arXiv:2305.02450, 2023 | 5 | 2023 |
| Intuitive analyses via drift theory A Göbel, T Kötzing, MS Krejca arXiv preprint arXiv:1806.01919, 2018 | 5 | 2018 |
| 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 International Computing and Combinatorics Conference, 242-254, 2022 | 4 | 2022 |
Tobias FriedrichChair for Algorithm Engineering, Hasso Plattner Institute, Potsdam, GermanyПодтвержден адрес электронной почты в домене hpi.de
