Andreas Göbel

Orcid: 0000-0002-5180-7205

Affiliations:
  • Hasso Plattner Institute, Potsdam, Germany
  • University of Oxford, Department of Computer Science
  • University of Liverpool, Department of Computer Science


According to our database1, Andreas Göbel authored at least 30 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The Irrelevance of Influencers: Information Diffusion with Re-Activation and Immunity Lasts Exponentially Long on Social Network Models.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
The impact of heterogeneity and geometry on the proof complexity of random satisfiability.
Random Struct. Algorithms, December, 2023

Polymer dynamics via cliques: New conditions for approximations.
Theor. Comput. Sci., 2023

The Weisfeiler-Leman Dimension of Existential Conjunctive Queries.
CoRR, 2023

A simple statistic for determining the dimensionality of complex networks.
CoRR, 2023

Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Perfect Sampling for Hard Spheres from Strong Spatial Mixing.
Proceedings of the Approximation, 2023

2022
A Spectral Independence View on Hard Spheres via Block Dynamics.
SIAM J. Discret. Math., September, 2022

Guest column: A panorama of counting problems the decision version of which is in P<sup>3</sup>.
SIGACT News, 2022

Using random graphs to sample repulsive Gibbs point processes with arbitrary-range potentials.
CoRR, 2022

Zeros and approximations of Holant polynomials on the complex plane.
Comput. Complex., 2022

Algorithms for Hard-Constraint Point Processes via Discretization.
Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

2021
Counting Homomorphisms to Trees Modulo a Prime.
ACM Trans. Comput. Theory, 2021

Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations.
Nat. Comput., 2021

Algorithms for general hard-constraint point processes via discretization.
CoRR, 2021

Adaptive Sampling for Fast Constrained Maximization of Submodular Function.
CoRR, 2021

On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Adaptive Sampling for Fast Constrained Maximization of Submodular Functions.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
On Counting (Quantum-)Graph Homomorphisms in Finite Fields.
CoRR, 2020

Polymer dynamics via cliques with applications to hard-sphere mixtures.
CoRR, 2020

Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

2019
Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Intuitive Analyses via Drift Theory.
CoRR, 2018

Heavy-Tailed Mutation Operators in Single-Objective Combinatorial Optimization.
Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

2017
Amplifiers for the Moran Process.
J. ACM, 2017

On the connection between interval size functions and path counting.
Comput. Complex., 2017

2016
Counting Homomorphisms to Square-Free Graphs, Modulo 2.
ACM Trans. Comput. Theory, 2016

2015
Counting List Matrix Partitions of Graphs.
SIAM J. Comput., 2015

2014
The complexity of counting homomorphisms to cactus graphs modulo 2.
ACM Trans. Comput. Theory, 2014

Counting Homomorphisms to Cactus Graphs Modulo 2.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014


  Loading...