# Andreas Göbel

**Chair for**** Algorithm Engineering**

Hasso Plattner Institute

Office: A-1.6

Tel.: +49 331 5509-424

E-Mail: Andreas.Goebel(at)hpi.de

2021 [ nach oben ]

- Adaptive Sampling for Fast Constrained Maximization of Submodular Functions. Artificial Intelligence and Statistics (AISTATS) 2021
- The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability. Symposium on Discrete Algorithms (SODA) 2021: 42-53

2020 [ nach oben ]

- Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings. European Conference on Artificial Intelligence (ECAI) 2020: 435-442

2019 [ nach oben ]

- Greedy Maximization of Functions with Bounded Curvature Under Partition Matroid Constraints. Conference on Artificial Intelligence (AAAI) 2019: 2272-2279

2018 [ nach oben ]

- Counting Homomorphisms to Trees Modulo a Prime. Mathematical Foundations of Computer Science (MFCS) 2018: 49:1-49:13
- Heavy-tailed Mutation Operators in Single-Objective Combinatorial Optimization. Parallel Problem Solving From Nature (PPSN) 2018: 134-145

2017 [ nach oben ]

- On the connection between interval size functions and path counting. Computational Complexity 2017: 421-467
- Amplifiers for the Moran Process. Journal of the ACM 2017: 5:1-5:90
- Counting, Modular Counting and Graph Homomorphisms. Doctoral Dissertation, University of Oxford 2017

2016 [ nach oben ]

- Counting Homomorphisms to Square-Free Graphs, Modulo 2. Transactions on Computation Theory 2016: 12:1-12:29
- Amplifiers for the Moran Process. International Colloquium on Automata, Languages and Programming (ICALP) 2016: 62:1-62:13

2015 [ nach oben ]

- Counting List Matrix Partitions of Graphs. SIAM Journal on Computing 2015: 1089-1118
- Counting Homomorphisms to Square-Free Graphs, Modulo 2. International Colloquium on Automata, Languages, and Programming (ICALP) 2015: 642-653

2014 [ nach oben ]

- The complexity of counting homomorphisms to cactus graphs modulo 2. Transactions on Computation Theory 2014: 17:1-17:29
- Counting List Matrix Partitions of Graphs. Conference on Computational Complexity (CCC) 2014: 56-65
- Counting Homomorphisms to Cactus Graphs Modulo 2. Symposium on Theoretical Aspects of Computer Science (STACS) 2014: 350-361

2009 [ nach oben ]

- On the Connection between Interval Size Functions and Path Counting. Theory and Applications of Models of Computation (TAMC) 2009: 108-117

# Teaching

Algorithmix: Winter 2020, Winter 2019

Probability and Computing: Summer 2021, Summer 2020, Summer 2019

Probability Theory: Winter 2018

Randomized Algorithms: Summer 2017

Rigorous Analysis of SI Epidemic Processes on Structured, Finite Populations: Summer 2019

Analysis of random geometric SAT instances**: **Winter 2017

Uniform Sampling Hypergraph Colorings: Winter 2017

The Power of Randomness: Winter 2017