Andreas Göbel

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 40

Top Topics

Conjunctive Queries

Diffusion Models

Evolutionary Algorithm

Top Venues

ACM Trans. Comput. Theory

Publications

Tobias Friedrich, Andreas Göbel, Nicolas Klodt, Martin S. Krejca, Marcus Pappik
The Irrelevance of Influencers: Information Diffusion with Re-Activation and Immunity Lasts Exponentially Long on Social Network Models. AAAI (2024)
Tobias Friedrich, Andreas Göbel, Nicolas Klodt, Martin S. Krejca, Marcus Pappik
From Market Saturation to Social Reinforcement: Understanding the Impact of Non-Linearity in Information Diffusion Models. AAMAS (2024)
Andreas Göbel, Leslie Ann Goldberg, Marc Roth
The Weisfeiler-Leman Dimension of Conjunctive Queries. Proc. ACM Manag. Data 2 (2) (2024)
Konrad Anand, Andreas Göbel, Marcus Pappik, Will Perkins
Perfect Sampling for Hard Spheres from Strong Spatial Mixing. CoRR (2023)
Andreas Göbel, Leslie Ann Goldberg, Marc Roth
The Weisfeiler-Leman Dimension of Existential Conjunctive Queries. CoRR (2023)
Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Leon Schiller
Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs. CoRR (2023)
Thomas Bläsius, Tobias Friedrich, Andreas Göbel, Jordi Levy, Ralf Rothenberger
The impact of heterogeneity and geometry on the proof complexity of random satisfiability. Random Struct. Algorithms 63 (4) (2023)
Konrad Anand, Andreas Göbel, Marcus Pappik, Will Perkins
Perfect Sampling for Hard Spheres from Strong Spatial Mixing. APPROX/RANDOM (2023)
Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Leon Schiller
A simple statistic for determining the dimensionality of complex networks. CoRR (2023)
Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Leon Schiller
Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs. ICALP (2023)
Tobias Friedrich, Andreas Göbel, Martin S. Krejca, Marcus Pappik
Polymer dynamics via cliques: New conditions for approximations. Theor. Comput. Sci. 942 (2023)
Tobias Friedrich, Andreas Göbel, Martin S. Krejca, Marcus Pappik
A Spectral Independence View on Hard Spheres via Block Dynamics. SIAM J. Discret. Math. 36 (3) (2022)
Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Martin S. Krejca, Marcus Pappik
Using random graphs to sample repulsive Gibbs point processes with arbitrary-range potentials. CoRR (2022)
Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Martin S. Krejca, Marcus Pappik
Algorithms for Hard-Constraint Point Processes via Discretization. COCOON (2022)
Eleni Bakali, Aggeliki Chalki, Andreas Göbel, Aris Pagourtzis, Stathis Zachos
. SIGACT News 53 (3) (2022)
Katrin Casel, Philipp Fischbeck, Tobias Friedrich, Andreas Göbel, J. A. Gregor Lagodzinski
Zeros and approximations of Holant polynomials on the complex plane. Comput. Complex. 31 (2) (2022)
Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Martin S. Krejca, Marcus Pappik
Algorithms for general hard-constraint point processes via discretization. CoRR (2021)
Andreas Göbel, J. A. Gregor Lagodzinski, Karen Seidel
Counting Homomorphisms to Trees Modulo a Prime. ACM Trans. Comput. Theory 13 (3) (2021)
Francesco Quinzan, Andreas Göbel, Markus Wagner, Tobias Friedrich
Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations. Nat. Comput. 20 (3) (2021)
Francesco Quinzan, Vanja Doskoc, Andreas Göbel, Tobias Friedrich
Adaptive Sampling for Fast Constrained Maximization of Submodular Functions. AISTATS (2021)
Francesco Quinzan, Vanja Doskoc, Andreas Göbel, Tobias Friedrich
Adaptive Sampling for Fast Constrained Maximization of Submodular Function. CoRR (2021)
Tobias Friedrich, Andreas Göbel, Martin S. Krejca, Marcus Pappik
A Spectral Independence View on Hard Spheres via Block Dynamics. ICALP (2021)
Thomas Bläsius, Tobias Friedrich, Andreas Göbel, Jordi Levy, Ralf Rothenberger
The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability. SODA (2021)
J. A. Gregor Lagodzinski, Andreas Göbel, Katrin Casel, Tobias Friedrich
On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order. ICALP (2021)
J. A. Gregor Lagodzinski, Andreas Göbel, Katrin Casel, Tobias Friedrich
On Counting (Quantum-)Graph Homomorphisms in Finite Fields. CoRR (2020)
Vanja Doskoc, Tobias Friedrich, Andreas Göbel, Aneta Neumann, Frank Neumann, Francesco Quinzan
Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings. ECAI (2020)
Tobias Friedrich, Andreas Göbel, Martin S. Krejca, Marcus Pappik
Polymer dynamics via cliques with applications to hard-sphere mixtures. CoRR (2020)
Thomas Bläsius, Tobias Friedrich, Andreas Göbel, Jordi Levy, Ralf Rothenberger
The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability. CoRR (2020)
Vanja Doskoc, Tobias Friedrich, Andreas Göbel, Frank Neumann, Aneta Neumann, Francesco Quinzan
Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings. CoRR (2019)
Tobias Friedrich, Andreas Göbel, Frank Neumann, Francesco Quinzan, Ralf Rothenberger
Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints. AAAI (2019)
Katrin Casel, Philipp Fischbeck, Tobias Friedrich, Andreas Göbel, J. A. Gregor Lagodzinski
Zeros and approximations of Holant polynomials on the complex plane. CoRR (2019)
Andreas Göbel, Timo Kötzing, Martin S. Krejca
Intuitive Analyses via Drift Theory. CoRR (2018)
Andreas Göbel, J. A. Gregor Lagodzinski, Karen Seidel
Counting Homomorphisms to Trees Modulo a Prime. MFCS (2018)
Tobias Friedrich, Andreas Göbel, Francesco Quinzan, Markus Wagner
Evolutionary Algorithms and Submodular Functions: Benefits of Heavy-Tailed Mutations CoRR (2018)
Andreas Göbel, J. A. Gregor Lagodzinski, Karen Seidel
Counting Homomorphisms to Trees Modulo a Prime. CoRR (2018)
Tobias Friedrich, Andreas Göbel, Frank Neumann, Francesco Quinzan, Ralf Rothenberger
Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints. CoRR (2018)
Tobias Friedrich, Andreas Göbel, Francesco Quinzan, Markus Wagner
Heavy-Tailed Mutation Operators in Single-Objective Combinatorial Optimization. PPSN (1) (2018)
Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, David Richerby
Amplifiers for the Moran Process. J. ACM 64 (1) (2017)
Andreas Göbel, Leslie Ann Goldberg, David Richerby
Counting Homomorphisms to Square-Free Graphs, Modulo 2. ACM Trans. Comput. Theory 8 (3) (2016)
Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, David Richerby
Amplifiers for the Moran Process. ICALP (2016)
Andreas Göbel, Leslie Ann Goldberg, David Richerby
Counting Homomorphisms to Square-Free Graphs, Modulo 2. CoRR (2015)
Andreas Göbel, Leslie Ann Goldberg, David Richerby
Counting Homomorphisms to Square-Free Graphs, Modulo 2. ICALP (1) (2015)
Andreas Göbel, Leslie Ann Goldberg, Colin McQuillan, David Richerby, Tomoyuki Yamakami
Counting List Matrix Partitions of Graphs. SIAM J. Comput. 44 (4) (2015)
Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, David Richerby
Amplifiers for the Moran Process. CoRR (2015)
Andreas Göbel, Leslie Ann Goldberg, David Richerby
Counting Homomorphisms to Cactus Graphs Modulo 2. STACS (2014)
Andreas Göbel, Leslie Ann Goldberg, Colin McQuillan, David Richerby, Tomoyuki Yamakami
Counting List Matrix Partitions of Graphs. Computational Complexity Conference (2014)
Andreas Göbel, Leslie Ann Goldberg, David Richerby
The complexity of counting homomorphisms to cactus graphs modulo 2. ACM Trans. Comput. Theory 6 (4) (2014)
Andreas Göbel, Leslie Ann Goldberg, David Richerby
The Complexity of Counting Homomorphisms to Cactus Graphs Modulo 2. CoRR (2013)
Andreas Göbel, Leslie Ann Goldberg, Colin McQuillan, David Richerby, Tomoyuki Yamakami
Counting list matrix partitions of graphs. CoRR (2013)