# Publications of Dr. Andreas Goebel

The following listing contains all publications of Dr. Andreas Göbel. Further publications of the research group can be found on the current list of publications and the complete list of publications. Individual listings are available externally on DBLP or locally as PDF.

You can view all publications of the current members of the Algorithm Engineering group. To view all dissertations, please click here. For other listings, please see:

- years: 2023, 2022, 2021, 2020, 2019, 2018, 2017, 2016, 2015, 2014, 2013, 2012, 2011, 2010
- researchers: Prof. Dr. Tobias Friedrich, Dr. Samuel Baguley, Dr. Katrin Casel, Dr. Sarel Cohen, Dr. Andreas Göbel, Dr. Davis Issac, Dr. Timo Kötzing, Dr. Nikhil Kumar, Dr. Pascal Lenzner, Dr. Ralf Rothenberger, Dr. George Skretas
- PhD students: Vanja Doskoč, Philipp Fischbeck, Hans Gawendowicz, Maximilian Katzmann, Nicolas Klodt, Simon Krogmann, Gregor Lagodzinski, Xiaoyue Sherry Li, Louise Molitor, Stefan Neubert, Aikaterini Niklanovits, Marcus Pappik, Leila Parsaei-Majd, Francesco Quinzan, Aishwarya Radhakrishnan, Ziena Zeif
- theory conferences: ICALP, MFCS, SAGT, STACS, STOC, WINE

algorithm conferences: ALENEX, ESA, GD, ISAAC, SODA, SPAA, SWAT, WAW - artificial intelligence conferences: AAAI, AAMAS, ALT, COLT, ECAI, ICAPS, IJCAI, SAT

evolutionary computation conferences: CEC, EMO, EvoCOP, FOGA, GECCO, PPSN

2022 [ nach oben ]

- Casel, Katrin; Fischbeck, Philipp; Friedrich, Tobias; Göbel, Andreas; Lagodzinski, J. A. Gregor
**Zeros and approximations of Holant polynomials on the complex plane**Computational Complexity 2022: 11 - Friedrich, Tobias; Göbel, Andreas; Krejca, Martin S.; Pappik, Marcus
**A Spectral Independence View on Hard Spheres via Block Dynamics**SIAM Journal on Discrete Mathematics 2022: 2282–2322 - Friedrich, Tobias; Göbel, Andreas; Katzmann, Maximilian; Krejca, Martin S.; Pappik, Marcus
**Algorithms for hard-constraint point processes via discretization**International Computing and Combinatorics Conference (COCOON) 2022

2021 [ nach oben ]

- Göbel, Andreas; Lagodzinski, J. A. Gregor; Seidel, Karen
**Counting Homomorphisms to Trees Modulo a Prime**ACM Transactions on Computation Theory 2021 - Quinzan, Francesco; Doskoč, Vanja; Göbel, Andreas; Friedrich, Tobias
**Adaptive Sampling for Fast Constrained Maximization of Submodular Functions**Artificial Intelligence and Statistics (AISTATS) 2021: 964–972 - Friedrich, Tobias; Göbel, Andreas; Krejca, Martin S.; Pappik, Marcus
**A spectral independence view on hard spheres via block dynamics**International Colloquium on Automata, Languages and Programming (ICALP) 2021: 66:1–66:15 - Lagodzinski, J. A. Gregor; Göbel, Andreas; Casel, Katrin; Friedrich, Tobias
**On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order**International Colloquium on Automata, Languages and Programming (ICALP) 2021: 91:1–91:15 - Bläsius, Thomas; Friedrich, Tobias; Göbel, Andreas; Levy, Jordi; Rothenberger, Ralf
**The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability**Symposium on Discrete Algorithms (SODA) 2021: 42–53

2020 [ nach oben ]

- Doskoč, Vanja; Friedrich, Tobias; Göbel, Andreas; Neumann, Aneta; Neumann, Frank; Quinzan, Francesco
**Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings**European Conference on Artificial Intelligence (ECAI) 2020: 435–442

2019 [ nach oben ]

2018 [ nach oben ]

- Göbel, Andreas; Lagodzinski, J. A. Gregor; Seidel, Karen
**Counting Homomorphisms to Trees Modulo a Prime**Mathematical Foundations of Computer Science (MFCS) 2018: 49:1–49:13 - Friedrich, Tobias; Göbel, Andreas; Quinzan, Francesco; Wagner, Markus
**Heavy-tailed Mutation Operators in Single-Objective Combinatorial Optimization**Parallel Problem Solving From Nature (PPSN) 2018: 134–145

2017 [ nach oben ]

- Bampas, Evangelos; Göbel, Andreas-Nikolas; Pagourtzis, Aris; Tentes, Aris
**On the connection between interval size functions and path counting**Computational Complexity 2017: 421–467 - Galanis, Andreas; Göbel, Andreas; Goldberg, Leslie Ann; Lapinskas, John; Richerby, David
**Amplifiers for the Moran Process**Journal of the ACM 2017: 5:1–5:90 - Göbel, Andreas
**Counting, Modular Counting and Graph Homomorphisms**Doctoral Dissertation, University of Oxford 2017

2016 [ nach oben ]

- Göbel, Andreas; Goldberg, Leslie Ann; Richerby, David
**Counting Homomorphisms to Square-Free Graphs, Modulo 2**ACM Transactions on Computation Theory 2016: 12:1–12:29 - Galanis, Andreas; Göbel, Andreas; Goldberg, Leslie-Ann; Lapinskas, John; Richerby, David
**Amplifiers for the Moran Process**International Colloquium on Automata, Languages and Programming (ICALP) 2016: 62:1–62:13

2015 [ nach oben ]

- Göbel, Andreas; Goldberg, Leslie Ann; McQuillan, Colin; Richerby, David; Yamakami, Tomoyuki
**Counting List Matrix Partitions of Graphs**SIAM Journal on Computing 2015: 1089–1118 - Göbel, Andreas; Goldberg, Leslie Ann; Richerby, David
**Counting Homomorphisms to Square-Free Graphs, Modulo 2**International Colloquium on Automata, Languages, and Programming (ICALP) 2015: 642–653

2014 [ nach oben ]

- Göbel, Andreas; Goldberg, Leslie Ann; Richerby, David
**The complexity of counting homomorphisms to cactus graphs modulo 2**ACM Transactions on Computation Theory 2014: 17:1–17:29 - Göbel, Andreas; Goldberg, Leslie Ann; McQuillan, Colin; Richerby, David; Yamakami, Tomoyuki
**Counting List Matrix Partitions of Graphs**Conference on Computational Complexity (CCC) 2014: 56–65 - Göbel, Andreas; Goldberg, Leslie Ann; Richerby, David
**Counting Homomorphisms to Cactus Graphs Modulo 2**Symposium on Theoretical Aspects of Computer Science (STACS) 2014: 350–361

2009 [ nach oben ]