From

Institution

Field

Type

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

Reset

Papers matching “polynomial complexity” 195

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

Polynomial pathwidth for graphs vertex-coverable by few shortest paths and algorithms for quasi-shortest path covers
2026 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Li-Hsuan Chen, Florent Foucaud, Ling-Ju Hung, Ralf Klasing, Lucas Lorieau, Peter Rossmanith

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
Waiting for Trains: Complexity Results
2020 Lecture notes in computer science conference-paper Engineering Railway Systems and Energy Efficiency

Bjoern Tauer, Dennis Fischer, Janosch Fuchs, Laura Vargas Koch, Stephan Zieger

3

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
Computational Complexity of the Weisfeiler-Leman Dimension
2024 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Moritz Lichter, Simon Raßmann, Pascal Schweitzer

0

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 Descriptive Complexity of Graph Neural Networks
2023 Proceedings - Symposium on Logic in Computer Science conference-paper Computer Science Complexity and Algorithms in Graphs

Martin Grohe

7

citations
The Descriptive Complexity of Graph Neural Networks
2023 RWTH Publications (RWTH Aachen) conference-paper Computer Science Advanced Graph Theory Research Open access

Martin Grohe

4

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 Alignments
2026 arXiv (Cornell University) preprint Business, Management and Accounting Business Process Modeling and Analysis Open access

Christopher T. Schwanen, Wied Pakusa, Wil M. P. van der Aalst

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
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
Comparing intrusive and non-intrusive polynomial chaos for a class of exponential time differencing schemes
2023 arXiv (Cornell University) preprint Mathematics Numerical methods for differential equations Open access

Julian Clausnitzer, Andreas Kleefeld

0

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
The Complexity of Reachability in Parametric Markov Decision Processes
2020 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

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

10

citations
Parameterized Complexity of Scheduling Unit-TimeJobs with Generalized Precedence Constraints
2025 arXiv (Cornell University) preprint Engineering Scheduling and Optimization Algorithms Open access

Christina Büsing, Maurice Draeger, Corinna Mathwieser

0

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
Completeness in the Polynomial Hierarchy for Many Natural Problems in Bilevel and Robust Optimization
2025 Lecture notes in computer science conference-paper Computer Science Complexity and Algorithms in Graphs Open access

Christoph Grüne, Lasse Wulf

4

citations
Polynomial Time Quantum Approximation Schemes for Constrained Optimisation
2026 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Chinonso Onah, Kristel F. L. Michielsen

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
Deciding Reachability and the Covering Problem with Diagnostics for Sound Acyclic Free-Choice Workflow Nets
2026 arXiv (Cornell University) preprint Computer Science Petri Nets in System Modeling Open access

Thomas M. Prinz, Christopher T. Schwanen, Wil M. P. van der Aalst

0

citations
An Approximate Inductive Miner
2023 International Conference on Process Mining (ICPM) conference-paper Business, Management and Accounting Business Process Modeling and Analysis

Jan Niklas van Detten, Sander J. J. Leemans

16

citations