From

Institution

Field

Type

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

Reset

Papers matching “polynomial complexity” 104

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
Insights into the computational complexity of the single-source capacitated facility location problem with customer preferences
2026 Annals of Operations Research article Business, Management and Accounting Facility Location and Emergency Management Open access

Christina Büsing, Timo Gersing, Sophia Wrede

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
Multilevel weighted least squares polynomial approximation
2020 ESAIM Mathematical Modelling and Numerical Analysis article Mathematics Mathematical Approximation and Integration Open access

Abdul-Lateef Haji-Ali, Fabio Nobile, Raul F. Tempone

11

citations
Multithread interval scheduling with flexible machine availabilities: Complexity and efficient algorithms
2024 Discrete Applied Mathematics article Engineering Scheduling and Optimization Algorithms Open access

Mariia Anapolska, Tabea Brandt, Christina Büsing, Tobias Mömke

0

citations
Choiceless Polynomial Time with Witnessed Symmetric Choice
2024 Journal of the ACM article Mathematics Advanced Topology and Set Theory

Moritz Lichter, Pascal Schweitzer

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

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
Uncertainty quantification in energy and thermal management of immersion-cooled battery safety systems in electric vehicles using polynomial chaos expansion
2026 Journal of Power Sources article Engineering Advanced Battery Technologies Research Open access

Abdul Wahab, Tim Wieder, Nima Amjady, Hossein Senobar, Hans Kemper, Hamid Khayyam

7

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
Invariant Algebraic Surfaces of Polynomial Vector Fields in Dimension Three
2021 Journal of Dynamics and Differential Equations article Mathematics Advanced Differential Equations and Dynamical Systems Open access

Niclas Kruff, Jaume Llibre, Chara Pantazi, Sebastian Walcher

2

citations
Attracting and Natural Invariant Varieties for Polynomial Vector Fields and Control Systems
2020 Qualitative Theory of Dynamical Systems article Mathematics Advanced Differential Equations and Dynamical Systems Open access

Niclas Kruff, Christian Schilli, Sebastian Walcher, Eva Zerz

2

citations
Parameterized Complexity of Scheduling Unit-Time Jobs with Generalized Precedence Constraints
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Engineering Scheduling and Optimization Algorithms Open access

Christina Büsing, Corinna Mathwieser

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
Computing high-degree polynomial gradients in memory
2024 Nature Communications article Engineering Advanced Memory and Neural Computing Open access cited by 1 patent

Tinish Bhattacharya, George Higgins Hutchinson, Giacomo Pedretti, Xia Sheng, Jim Ignowski, Thomas Van Vaerenbergh, +3 more

22

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
The subset sum game revisited
2021 Theory of Computing Systems article Engineering Optimization and Packing Problems Open access

Astrid Pieterse, Gerhard J. Woeginger

1

citations