Hasso-Plattner-Institut
Prof. Dr. Tobias Friedrich
 

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

Research Interests

  • Computational Counting
  • Randomness in Computation
  • Computational Complexity
  • Graph Theory
  • Stochastic Processes

Publications

[ 2021 ] [ 2020 ] [ 2019 ] [ 2018 ] [ 2017 ] [ 2016 ] [ 2015 ] [ 2014 ] [ 2009 ]

2021 [ nach oben ]

  • Adaptive Sampling for Fas... - Download
    Quinzan, Francesco; Doskoč, Vanja; Göbel, Andreas; Friedrich, Tobias Adaptive Sampling for Fast Constrained Maximization of Submodular FunctionsArtificial Intelligence and Statistics (AISTATS) 2021: 964–972
     
  • A spectral independence v... - Download
    Friedrich, Tobias; Göbel, Andreas; Krejca, Martin; Pappik, Marcus A spectral independence view on hard spheres via block dynamicsInternational Colloquium on Automata, Languages and Programming (ICALP) 2021: 66:1–66:15
     
  • On Counting (Quantum-)Gra... - Download
    Lagodzinski, J. A. Gregor; Göbel, Andreas; Casel, Katrin; Friedrich, Tobias On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime OrderInternational Colloquium on Automata, Languages and Programming (ICALP) 2021: 91:1–91:15
     
  • The Impact of Heterogenei... - Download
    Bläsius, Thomas; Friedrich, Tobias; Göbel, Andreas; Levy, Jordi; Rothenberger, Ralf The Impact of Heterogeneity and Geometry on the Proof Complexity of Random SatisfiabilitySymposium on Discrete Algorithms (SODA) 2021: 42–53
     

2020 [ nach oben ]

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

2019 [ nach oben ]

  • Greedy Maximization of Fu... - Download
    Friedrich, Tobias; Göbel, Andreas; Neumann, Frank; Quinzan, Francesco; Rothenberger, Ralf Greedy Maximization of Functions with Bounded Curvature Under Partition Matroid ConstraintsConference on Artificial Intelligence (AAAI) 2019: 2272–2279
     

2018 [ nach oben ]

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

2017 [ nach oben ]

  • On the connection between... - Download
    Bampas, Evangelos; Göbel, Andreas-Nikolas; Pagourtzis, Aris; Tentes, Aris On the connection between interval size functions and path countingComputational Complexity 2017: 421–467
     
  • Amplifiers for the Moran ... - Download
    Galanis, Andreas; Göbel, Andreas; Goldberg, Leslie Ann; Lapinskas, John; Richerby, David Amplifiers for the Moran ProcessJournal of the ACM 2017: 5:1–5:90
     
  • Counting, Modular Countin... - Download
    Göbel, Andreas Counting, Modular Counting and Graph HomomorphismsDoctoral Dissertation, University of Oxford 2017
     

2016 [ nach oben ]

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

2015 [ nach oben ]

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

2014 [ nach oben ]

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

2009 [ nach oben ]

  • On the Connection between... - Download
    Bampas, Evangelos; Göbel, Andreas-Nikolas; Pagourtzis, Aris; Tentes, Aris On the Connection between Interval Size Functions and Path CountingTheory 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 instancesWinter 2017

Uniform Sampling Hypergraph Colorings: Winter 2017

The Power of Randomness: Winter 2017