From

Institution

Field

Type

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

Reset

Papers matching “polynomial complexity” 69

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Complexity and Algorithms in Graphs Open access

0

citations
Complexity framework for forbidden subgraphs IV: The Steiner Forest problem
2025 Journal of Computer and System Sciences article Computer Science Advanced Graph Theory Research Open access

Hans L. Bodlaender, Matthew Johnson, Barnaby D. Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, +2 more

0

citations
The complexity of blocking all solutions
2026 Theoretical Computer Science article Computer Science Complexity and Algorithms in Graphs Open access

Christoph Grüne, Lasse Wulf

1

citations
The complexity of blocking all solutions
2026 Theoretical Computer Science article Computer Science Complexity and Algorithms in Graphs Open access

Christoph Grüne, Lasse Wulf

0

citations
The Complexity of Homomorphism Reconstruction Revisited
2026 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Timo Gervens, Martin Grohe, Louis Härtel, Philipp Silva da Fonseca

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
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

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
Quantum Computational Complexity of Matrix Functions
2026 PRX Quantum article Computer Science Quantum Computing Algorithms and Architecture Open access

Santiago Cifuentes, Samson Wang, Thais de Lima Silva, Mario Berta, Leandro Aolita

1

citations
Quantum Computational Complexity of Matrix Functions
2026 PRX Quantum article Computer Science Quantum Computing Algorithms and Architecture Open access

Santiago Cifuentes, Samson Wang, Thais de Lima Silva, Mario Berta, Leandro Aolita

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
Complexity of the Directed Robust b‐Matching Problem and Its Variants on Different Graph Classes
2025 Networks article Computer Science Complexity and Algorithms in Graphs Open access

Jenny Segschneider, Arie M. C. A. Koster

0

citations
Reoptimization of parameterized problems
2022 Acta Informatica article Computer Science Advanced Graph Theory Research Open access

Hans-Joachim Böckenhauer, Elisabet Burjons, Martin Raszyk, Peter Rossmanith

9

citations
Recoverable robust optimization with commitment
2026 Mathematical Programming article Computer Science Complexity and Algorithms in Graphs Open access

Komal Muluk, Britta Peis

3

citations
Perfect Matching Under Precedence Constraints
2025 Networks article Computer Science Complexity and Algorithms in Graphs Open access

Christina Büsing, Corinna Mathwieser

0

citations
Efficient and robust estimation of many-qubit Hamiltonians
2024 Nature Communications article Computer Science Quantum Computing Algorithms and Architecture Open access

Daniel Stilck França, Liubov A. Markovich, V. V. Dobrovitski, Albert H. Werner, Johannes Borregaard

31

citations
Expressing and Exploiting Subgoal Structure in Classical Planning Using Sketches
2024 Journal of Artificial Intelligence Research article Computer Science AI-based Problem Solving and Planning Open access

Dominik Drexler, Jendrik Seipp, Héctor Geffner

0

citations
Robust transshipment problem under consistent flow constraints
2023 Networks article Computer Science Complexity and Algorithms in Graphs Open access

Christina Büsing, Arie M. C. A. Koster, Sabrina Schmitz

1

citations
Precedence‐Constrained Shortest Path
2025 Networks article Computer Science Complexity and Algorithms in Graphs Open access

Christina Büsing, Dennis John, Corinna Mathwieser

0

citations
Travelling salesman paths on Demidenko matrices
2021 Discrete Applied Mathematics article Computer Science Complexity and Algorithms in Graphs Open access

Eranda Çela, Vladimir G. Deı̌neko, Gerhard J. Woeginger

1

citations
Showcasing straight-line programs with memory via matrix Bruhat decomposition
2024 International Journal of Algebra and Computation article Computer Science Polynomial and algebraic computation Open access

Alice C. Niemeyer, Tomasz Popiel, Cheryl E. Praeger, Daniel Rademacher

0

citations
Dispersing Obnoxious Facilities on a Graph
2021 Algorithmica article Computer Science Complexity and Algorithms in Graphs Open access

Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger

0

citations
Hermitian and Unitary Almost-Companion Matrices of Polynomials on Demand
2023 Entropy article Computer Science Matrix Theory and Algorithms Open access

Liubov A. Markovich, Agostino Migliore, ANTONINO MESSINA

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
Matroid bases with cardinality constraints on the intersection
2021 Mathematical Programming article Computer Science Complexity and Algorithms in Graphs Open access

Stefan Lendl, Britta Peis, Veerle Timmermans

9

citations