Follow
Andreas Göbel
Andreas Göbel
Hasso Plattner Institute, University of Potsdam
Verified email at hpi.de
Title
Cited by
Cited by
Year
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
382018
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
372017
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
362019
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
182016
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
182014
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
152022
Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations
F Quinzan, A Göbel, M Wagner, T Friedrich
Natural Computing, 1-15, 2021
132021
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
122017
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
92018
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
72022
Polymer dynamics via cliques: New conditions for approximations
T Friedrich, A Göbel, MS Krejca, M Pappik
Theoretical Computer Science 942, 230-252, 2023
62023
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
62021
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
62021
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
52022
Intuitive analyses via drift theory
A Göbel, T Kötzing, MS Krejca
arXiv preprint arXiv:1806.01919, 2018
52018
Counting homomorphisms to cactus graphs modulo 2
A Göbel, LA Goldberg, D Richerby
31st International Symposium on Theoretical Aspects of Computer Science …, 2014
52014
Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs
T Friedrich, A Göbel, M Katzmann, L Schiller
arXiv preprint arXiv:2302.04113, 2023
22023
Adaptive Sampling for Fast Constrained Maximization of Submodular Functions
F Quinzan, V Doskoc, A Göbel, T Friedrich
International Conference on Artificial Intelligence and Statistics, 964-972, 2021
22021
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
22021
On counting (quantum-) graph homomorphisms in finite fields of prime order
JA Lagodzinski, A Göbel, K Casel, T Friedrich
arXiv preprint arXiv:2011.04827, 2020
22020
The system can't perform the operation now. Try again later.
Articles 1–20