From

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Reset

Papers matching “complexity bounds” 47

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

A generalization bound for a family of implicit networks
2026 Neurocomputing article Computer Science Neural Networks and Applications Open access

Samy Wu Fung, Benjamin Berkels

0

citations
A Finite-Model-Theoretic View on Propositional Proof Complexity
2022 Logical Methods in Computer Science article Computer Science Complexity and Algorithms in Graphs Open access

Erich Grädel, Martin Grohe, Benedikt Pago, Wied Pakusa

5

citations
On the advice complexity of the online dominating set problem
2021 Theoretical Computer Science article Computer Science Optimization and Search Problems Open access

Hans-Joachim Böckenhauer, Juraj Hromkovic̆, Sacha Krug

3

citations
Targeting Completeness: Automated Complexity Analysis of Integer Programs
2026 Journal of Automated Reasoning article Computer Science Logic, programming, and type systems Open access

Nils Lommen, Éléanore Meyer, Jürgen Giesl

4

citations
Lower Bounds on Learning Pauli Channels With Individual Measurements
2025 IEEE Transactions on Information Theory article Computer Science Quantum Computing Algorithms and Architecture Open access

Omar Fawzi, Aadil Oufkir, Daniel Stilck França

5

citations
Inferring Lower Runtime Bounds for Integer Programs
2020 ACM Transactions on Programming Languages and Systems article Computer Science Logic, programming, and type systems Open access

Florian Frohn, Matthias Naaf, Marc Brockschmidt, Jürgen Giesl

12

citations
Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements
2025 Journal of the ACM article Computer Science Complexity and Algorithms in Graphs Open access

Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer

0

citations
The complexity of reachability in parametric Markov decision processes
2021 Journal of Computer and System Sciences article Computer Science Formal Methods in Verification Open access

Sebastian Junges, Joost-Pieter Katoen, Guillermo A. Pérez, Tobias Winkler

23

citations
Analysis of complex excitation patterns using Feynman-like diagrams
2024 Scientific Reports article Computer Science Nonlinear Dynamics and Pattern Formation Open access

Louise Arno, Desmond Kabus, Hans Dierckx

9

citations
Computational Complexity of the Weisfeiler-Leman Dimension
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Simon Raßmann, Pascal Schweitzer

1

citations
The Descriptive Complexity of Graph Neural Networks
2024 TheoretiCS article Computer Science Complexity and Algorithms in Graphs Open access

Martin Grohe

3

citations
The Complexity of Homomorphism Reconstructibility
2025 ACM Transactions on Computation Theory article Computer Science Advanced Graph Theory Research Open access

Jan Böker, Louis Härtel, Nina Runde, Tim Seppelt, Christoph Standke

0

citations
Computational Complexity of the Weisfeiler-Leman Dimension
2026 ACM Transactions on Computational Logic article Computer Science Advanced Graph Theory Research

Moritz Lichter, Simon Raßmann, Pascal Schweitzer

0

citations
The Parameterized Complexity of Learning Monadic Second-Order Logic
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Steffen van Bergerem

0

citations
First-Order Model-Checking in Random Graphs and Complex Networks
2020 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Jan Dreier, Philipp Kuinke, Peter Rossmanith

1

citations
Supercritical Size-Width Tree-Like Resolution Trade-Offs for Graph Isomorphism
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Complexity and Algorithms in Graphs Open access

0

citations
Stochastic Games with Disjunctions of Multiple Objectives
2021 Electronic Proceedings in Theoretical Computer Science article Computer Science Formal Methods in Verification Open access

Tobias Winkler, Maximilian Weininger

2

citations
Online Node- and Edge-Deletion Problems with Advice
2021 Algorithmica article Computer Science Optimization and Search Problems Open access

Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, Peter Rossmanith

7

citations
Revenue maximization in Stackelberg Pricing Games: beyond the combinatorial setting
2020 Mathematical Programming article Computer Science Complexity and Algorithms in Graphs Open access

Toni Böhnlein, Stefan Kratsch, Oliver Schaudt

11

citations
Online Unbounded Knapsack
2025 Theory of Computing Systems article Computer Science Optimization and Search Problems Open access

Hans-Joachim Böckenhauer, Matthias Gehnen, Juraj Hromkovic̆, Ralf Klasing, Dennis Komm, Henri Lotze, +3 more

2

citations
Total Roman {3}-domination in Graphs
2020 Symmetry article Computer Science Advanced Graph Theory Research Open access

Zehui Shao, Doost Ali Mojdeh, Lutz Volkmann

11

citations
The norm of the saturation of a binomial ideal, with applications to Markov bases
2020 Algebraic Statistics article Computer Science Polynomial and algebraic computation Open access

David Holmes

0

citations
The Iteration Number of the Weisfeiler-Leman Algorithm
2024 ACM Transactions on Computational Logic article Computer Science Advanced Graph Theory Research Open access

Martin Grohe, Moritz Lichter, Daniel Neuen

3

citations
Nearly Optimal Measurement Scheduling for Partial Tomography of Quantum States
2020 Physical Review X article Computer Science Quantum Computing Algorithms and Architecture Open access

96

citations
The smoothed number of Pareto-optimal solutions in bicriteria integer optimization
2022 Mathematical Programming article Computer Science Complexity and Algorithms in Graphs Open access

René Beier, Heiko Röglin, Clemens Rösner, Berthold Vöcking

2

citations