Andreas Göbel
Andreas Göbel
Hasso Plattner Institute, University of Potsdam
Verified email at hpi.de
Title
Cited by
Cited by
Year
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
292017
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
282018
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
172019
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
172016
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
152014
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
102017
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
72018
Zeros and approximations of Holant polynomials on the complex plane
K Casel, P Fischbeck, T Friedrich, A Göbel, JA Lagodzinski
arXiv preprint arXiv:1905.03194, 2019
62019
Counting homomorphisms to trees modulo a prime
A Göbel, JA Lagodzinski, K Seidel
arXiv preprint arXiv:1802.06103, 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
Polymer Dynamics via Cliques: New Conditions for Approximations
T Friedrich, A Göbel, MS Krejca, M Pappik
arXiv preprint arXiv:2007.08293, 2020
32020
A spectral independence view on hardspheres via block dynamics
T Friedrich, A Göbel, MS Krejca, M Pappik
arXiv preprint arXiv:2102.07443, 2021
22021
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
22021
Intuitive analyses via drift theory
A Göbel, T Kötzing, MS Krejca
arXiv preprint arXiv:1806.01919, 2018
22018
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
12021
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
12020
On Counting (Quantum-) Graph Homomorphisms in Finite Fields.
JAG Lagodzinski, A Göbel, K Casel, T Friedrich
CoRR, 2020
12020
Non-monotone submodular maximization with multiple knapsacks in static and dynamic settings
V Doskoč, T Friedrich, A Göbel, F Neumann, A Neumann, F Quinzan
arXiv preprint arXiv:1911.06791, 2019
12019
On the connection between interval size functions and path counting
E Bampas, AN Göbel, A Pagourtzis, A Tentes
International Conference on Theory and Applications of Models of Computation …, 2009
12009
Algorithms for general hard-constraint point processes via discretization
T Friedrich, A Göbel, M Katzmann, MS Krejca, M Pappik
arXiv preprint arXiv:2107.08848, 2021
2021
The system can't perform the operation now. Try again later.
Articles 1–20