default search action
Andreas Göbel 0001
Person information
- affiliation: Hasso Plattner Institute, Potsdam, Germany
- affiliation: University of Oxford, Department of Computer Science
- affiliation: University of Liverpool, Department of Computer Science
Other persons with the same name
- Andreas Göbel 0002 — Friedrich Schiller University of Jena, Institute of Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j14]Andreas Göbel, Leslie Ann Goldberg, Marc Roth:
The Weisfeiler-Leman Dimension of Conjunctive Queries. Proc. ACM Manag. Data 2(2): 86 (2024) - [j13]Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Leon Schiller:
Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs. SIAM J. Discret. Math. 38(2): 1943-2000 (2024) - [c19]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: 17389-17397 - [c18]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: 614-622 - [c17]Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Leon Schiller:
Real-World Networks Are Low-Dimensional: Theoretical and Practical Assessment. IJCAI 2024: 2036-2044 - [i22]Panagiotis Aivasiliotis, Andreas Göbel, Marc Roth, Johannes Schmitt:
Parameterised Holant Problems. CoRR abs/2409.13579 (2024) - [i21]Andreas Göbel, Marcus Pappik:
Lazy brute-force sampling: A universal perfect sampling scheme from Markov chains. CoRR abs/2410.00882 (2024) - 2023
- [j12]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): 885-941 (2023) - [j11]Tobias Friedrich, Andreas Göbel, Martin S. Krejca, Marcus Pappik:
Polymer dynamics via cliques: New conditions for approximations. Theor. Comput. Sci. 942: 230-252 (2023) - [c16]Konrad Anand, Andreas Göbel, Marcus Pappik, Will Perkins:
Perfect Sampling for Hard Spheres from Strong Spatial Mixing. APPROX/RANDOM 2023: 38:1-38:18 - [c15]Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Leon Schiller:
Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs. ICALP 2023: 62:1-62:13 - [i20]Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Leon Schiller:
Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs. CoRR abs/2302.04113 (2023) - [i19]Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Leon Schiller:
A simple statistic for determining the dimensionality of complex networks. CoRR abs/2302.06357 (2023) - [i18]Konrad Anand, Andreas Göbel, Marcus Pappik, Will Perkins:
Perfect Sampling for Hard Spheres from Strong Spatial Mixing. CoRR abs/2305.02450 (2023) - [i17]Andreas Göbel, Leslie Ann Goldberg, Marc Roth:
The Weisfeiler-Leman Dimension of Existential Conjunctive Queries. CoRR abs/2310.19006 (2023) - 2022
- [j10]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): 11 (2022) - [j9]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): 2282-2322 (2022) - [j8]Eleni Bakali, Aggeliki Chalki, Andreas Göbel, Aris Pagourtzis, Stathis Zachos:
Guest column: A panorama of counting problems the decision version of which is in P3. SIGACT News 53(3): 46-68 (2022) - [c14]Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Martin S. Krejca, Marcus Pappik:
Algorithms for Hard-Constraint Point Processes via Discretization. COCOON 2022: 242-254 - [i16]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 abs/2204.01793 (2022) - 2021
- [j7]Francesco Quinzan, Andreas Göbel, Markus Wagner, Tobias Friedrich:
Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations. Nat. Comput. 20(3): 561-575 (2021) - [j6]Andreas Göbel, J. A. Gregor Lagodzinski, Karen Seidel:
Counting Homomorphisms to Trees Modulo a Prime. ACM Trans. Comput. Theory 13(3): 19:1-19:33 (2021) - [c13]Francesco Quinzan, Vanja Doskoc, Andreas Göbel, Tobias Friedrich:
Adaptive Sampling for Fast Constrained Maximization of Submodular Functions. AISTATS 2021: 964-972 - [c12]Tobias Friedrich, Andreas Göbel, Martin S. Krejca, Marcus Pappik:
A Spectral Independence View on Hard Spheres via Block Dynamics. ICALP 2021: 66:1-66:15 - [c11]J. A. Gregor Lagodzinski, Andreas Göbel, Katrin Casel, Tobias Friedrich:
On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order. ICALP 2021: 91:1-91:15 - [c10]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: 42-53 - [i15]Francesco Quinzan, Vanja Doskoc, Andreas Göbel, Tobias Friedrich:
Adaptive Sampling for Fast Constrained Maximization of Submodular Function. CoRR abs/2102.06486 (2021) - [i14]Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Martin S. Krejca, Marcus Pappik:
Algorithms for general hard-constraint point processes via discretization. CoRR abs/2107.08848 (2021) - 2020
- [c9]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: 435-442 - [i13]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 abs/2004.07319 (2020) - [i12]Tobias Friedrich, Andreas Göbel, Martin S. Krejca, Marcus Pappik:
Polymer dynamics via cliques with applications to hard-sphere mixtures. CoRR abs/2007.08293 (2020) - [i11]J. A. Gregor Lagodzinski, Andreas Göbel, Katrin Casel, Tobias Friedrich:
On Counting (Quantum-)Graph Homomorphisms in Finite Fields. CoRR abs/2011.04827 (2020)
2010 – 2019
- 2019
- [c8]Tobias Friedrich, Andreas Göbel, Frank Neumann, Francesco Quinzan, Ralf Rothenberger:
Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints. AAAI 2019: 2272-2279 - [i10]Katrin Casel, Philipp Fischbeck, Tobias Friedrich, Andreas Göbel, J. A. Gregor Lagodzinski:
Zeros and approximations of Holant polynomials on the complex plane. CoRR abs/1905.03194 (2019) - [i9]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 abs/1911.06791 (2019) - 2018
- [c7]Andreas Göbel, J. A. Gregor Lagodzinski, Karen Seidel:
Counting Homomorphisms to Trees Modulo a Prime. MFCS 2018: 49:1-49:13 - [c6]Tobias Friedrich, Andreas Göbel, Francesco Quinzan, Markus Wagner:
Heavy-Tailed Mutation Operators in Single-Objective Combinatorial Optimization. PPSN (1) 2018: 134-145 - [i8]Andreas Göbel, J. A. Gregor Lagodzinski, Karen Seidel:
Counting Homomorphisms to Trees Modulo a Prime. CoRR abs/1802.06103 (2018) - [i7]Tobias Friedrich, Andreas Göbel, Francesco Quinzan, Markus Wagner:
Evolutionary Algorithms and Submodular Functions: Benefits of Heavy-Tailed Mutations. CoRR abs/1805.10902 (2018) - [i6]Andreas Göbel, Timo Kötzing, Martin S. Krejca:
Intuitive Analyses via Drift Theory. CoRR abs/1806.01919 (2018) - [i5]Tobias Friedrich, Andreas Göbel, Frank Neumann, Francesco Quinzan, Ralf Rothenberger:
Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints. CoRR abs/1811.05351 (2018) - 2017
- [j5]Evangelos Bampas, Andreas-Nikolas Göbel, Aris Pagourtzis, Aris Tentes:
On the connection between interval size functions and path counting. Comput. Complex. 26(2): 421-467 (2017) - [j4]Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, David Richerby:
Amplifiers for the Moran Process. J. ACM 64(1): 5:1-5:90 (2017) - 2016
- [j3]Andreas Göbel, Leslie Ann Goldberg, David Richerby:
Counting Homomorphisms to Square-Free Graphs, Modulo 2. ACM Trans. Comput. Theory 8(3): 12:1-12:29 (2016) - [c5]Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, David Richerby:
Amplifiers for the Moran Process. ICALP 2016: 62:1-62:13 - 2015
- [j2]Andreas Göbel, Leslie Ann Goldberg, Colin McQuillan, David Richerby, Tomoyuki Yamakami:
Counting List Matrix Partitions of Graphs. SIAM J. Comput. 44(4): 1089-1118 (2015) - [c4]Andreas Göbel, Leslie Ann Goldberg, David Richerby:
Counting Homomorphisms to Square-Free Graphs, Modulo 2. ICALP (1) 2015: 642-653 - [i4]Andreas Göbel, Leslie Ann Goldberg, David Richerby:
Counting Homomorphisms to Square-Free Graphs, Modulo 2. CoRR abs/1501.07539 (2015) - [i3]Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, David Richerby:
Amplifiers for the Moran Process. CoRR abs/1512.05632 (2015) - 2014
- [j1]Andreas Göbel, Leslie Ann Goldberg, David Richerby:
The complexity of counting homomorphisms to cactus graphs modulo 2. ACM Trans. Comput. Theory 6(4): 17:1-17:29 (2014) - [c3]Andreas Göbel, Leslie Ann Goldberg, Colin McQuillan, David Richerby, Tomoyuki Yamakami:
Counting List Matrix Partitions of Graphs. CCC 2014: 56-65 - [c2]Andreas Göbel, Leslie Ann Goldberg, David Richerby:
Counting Homomorphisms to Cactus Graphs Modulo 2. STACS 2014: 350-361 - 2013
- [i2]Andreas Göbel, Leslie Ann Goldberg, Colin McQuillan, David Richerby, Tomoyuki Yamakami:
Counting list matrix partitions of graphs. CoRR abs/1306.5176 (2013) - [i1]Andreas Göbel, Leslie Ann Goldberg, David Richerby:
The Complexity of Counting Homomorphisms to Cactus Graphs Modulo 2. CoRR abs/1307.0556 (2013)
2000 – 2009
- 2009
- [c1]Evangelos Bampas, Andreas-Nikolas Göbel, Aris Pagourtzis, Aris Tentes:
On the Connection between Interval Size Functions and Path Counting. TAMC 2009: 108-117
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-06 20:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint