From

Institution

Field

Type

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

Reset

Papers matching “computational complexity bounds” 28

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

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
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 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
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
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
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
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
The Descriptive Complexity of Graph Neural Networks
2024 TheoretiCS article Computer Science Complexity and Algorithms in Graphs Open access

Martin Grohe

3

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
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
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
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
The Importance of Parameters in Ranking Functions
2026 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Database Systems and Queries Open access

Christoph Standke, Nikolaos Tziavelis, Wolfgang Gatterbauer, Benny Kimelfeld

0

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
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
Symmetric Proofs in the Ideal Proof System
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Complexity and Algorithms in Graphs Open access

Benedikt Pago

0

citations
Efficiently and Effectively Recognizing Toricity of Steady State Varieties
2020 Mathematics in Computer Science article Computer Science Polynomial and algebraic computation Open access

10

citations
Optimal Fidelity Estimation from Binary Measurements for Discrete and Continuous Variable Systems
2025 PRX Quantum article Computer Science Quantum Information and Cryptography Open access

1

citations
Sparse Random Hamiltonians Are Quantumly Easy
2024 Physical Review X article Computer Science Quantum Computing Algorithms and Architecture Open access cited by 1 patent

Chi-Fang Chen, Alexander M. Dalzell, Mario Berta, Fernando G. S. L. Brandão, Joel A. Tropp

7

citations
Exploring sparse graphs with advice
2022 Information and Computation article Computer Science Optimization and Search Problems Open access

Hans-Joachim Böckenhauer, Janosch Fuchs

7

citations
Calculating response functions of coupled oscillators using quantum phase estimation
2025 Physical Review Research article Computer Science Quantum Computing Algorithms and Architecture Open access

Sven Danz, Mario Berta, Stefan Schröder, Pascal Kienast, Frank K. Wilhelm, Alessandro Ciani

3

citations
Computing subset vertex covers in H-free graphs
2025 Theoretical Computer Science article Computer Science Advanced Graph Theory Research Open access

Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen

2

citations
Multiple Poses and Thermodynamics of Ligands Targeting Protein Surfaces: The Case of Furosemide Binding to mitoNEET in Aqueous Solution
2022 Frontiers in Cell and Developmental Biology article Computer Science Computational Drug Discovery Methods Open access

Gia Linh Hoang, Jonas Goßen, Riccardo Capelli, Toan T. Nguyen, Zhaoxi Sun, Ke Zuo, +3 more

6

citations
Accelerated bounded model checking with LoAT
2026 Science of Computer Programming article Computer Science Formal Methods in Verification Open access

Florian Frohn, Jürgen Giesl

0

citations