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.

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
Continuous facility location on graphs
2021 Mathematical Programming article Computer Science Complexity and Algorithms in Graphs Open access

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

6

citations
Learning properties of quantum states without the IID assumption
2024 Nature Communications article Computer Science Quantum Computing Algorithms and Architecture Open access

Omar Fawzi, Richard Kueng, Damian Markham, Aadil Oufkir

5

citations
Minimum‐Peak‐Cost Flows Over Time
2025 Networks article Computer Science Complexity and Algorithms in Graphs Open access

Mariia Anapolska, Emma Ahrens, Christina Büsing, Timo Gersing, Corinna Mathwieser, Sabrina Schmitz, +1 more

0

citations
A comparison between physics-based Li-ion battery models
2024 Electrochimica Acta article Engineering Advanced Battery Technologies Research Open access

Haider Adel Ali Ali, Luc H.J. Raijmakers, Kudakwashe Chayambuka, Dmitri L. Danilov, Peter H. L. Notten, Rüdiger‐A. Eichel

59

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
Improved Separation Between Quantum and Classical Computers for Sampling and Functional Tasks
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Quantum Computing Algorithms and Architecture Open access

Scott Aaronson

0

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

4

citations
A Direct Reduction from Stochastic Parity Games to Simple Stochastic Games
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Formal Methods in Verification Open access

0

citations
Isomorphism, canonization, and definability for graphs of bounded rank width
2021 Communications of the ACM article Computer Science Advanced Graph Theory Research

Martin Grohe, Daniel Neuen

6

citations
Sample-efficient estimation of nonlinear quantum state functions
2026 Communications Physics article Computer Science Quantum Computing Algorithms and Architecture Open access

Hongshun Yao, Yingjian Liu, Tengxiang Lin, Xin Wang

2

citations
Sensitivity analysis and uncertainty quantification in predictive modeling of proton-exchange membrane electrolytic cells
2024 Journal of Power Sources article Engineering Fuel Cells and Related Materials Open access cited by 1 patent

Violeta Karyofylli, Yannik Danner, K. Ashoke Raman, Hans Kungl, André Karl, Eva Jodat, +1 more

28

citations
A streamlined quantum algorithm for topological data analysis with exponentially fewer qubits
2026 Quantum article Computer Science Quantum Computing Algorithms and Architecture Open access

Sam McArdle, András Gilyén, Mario Berta

16

citations
A Faster Isomorphism Test for Graphs of Small Degree
2020 SIAM Journal on Computing article Computer Science Complexity and Algorithms in Graphs Open access

Martin Grohe, Daniel Neuen, Pascal Schweitzer

11

citations
A linear time algorithm for the robust recoverable selection problem
2020 Discrete Applied Mathematics article Computer Science Complexity and Algorithms in Graphs Open access

Thomas Lachmann, Stefan Lendl, Gerhard J. Woeginger

9

citations
Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints
2024 Discrete Applied Mathematics article Computer Science Complexity and Algorithms in Graphs

Christina Büsing, Sabrina Schmitz

5

citations
Probabilistic constrained Bayesian inversion for transpiration cooling
2022 International Journal for Numerical Methods in Fluids article Decision Sciences Probabilistic and Robust Engineering Design Open access

Ella Steins, Tan Bui–Thanh, Michaël Herty, Siegfried Müller

3

citations
The bipartite travelling salesman problem: A pyramidally solvable case
2024 Operations Research Letters article Computer Science Complexity and Algorithms in Graphs Open access

Vladimir G. Deı̌neko, Bettina Klinz, Gerhard J. Woeginger

2

citations
Travelling salesman paths on Demidenko matrices
2024 Warwick Research Archive Portal (University of Warwick) article Computer Science Complexity and Algorithms in Graphs Open access

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

1

citations
Randomization in Non-Uniform Finite Automata
2020 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science semigroups and automata theory Open access

Pavol Ďuriš, Rastislav Kráľovič, Richard Královič, Dana Pardubská, Martin Pašen, Peter Rossmanith

1

citations
Lossless compression of simulated radio interferometric visibilities
2026 Springer Link (Chiba Institute of Technology) article Physics and Astronomy Radio Astronomy Observations and Technology Open access

Andre R. Offringa, Reinout J. van Weeren

0

citations
Lossless compression of simulated radio interferometric visibilities
2026 Astronomy and Astrophysics article Physics and Astronomy Radio Astronomy Observations and Technology Open access

Andre R. Offringa, Reinout J. van Weeren

0

citations
Natural parameter conditions for singular perturbations of chemical and biochemical reaction networks
2022 RWTH Publications (RWTH Aachen) article Mathematics Differential Equations and Numerical Methods Open access

Justin Eilertsen, Santiago D. Schnell, Sebastian Walcher

0

citations
A bound on the primes of bad reduction for CM curves of genus 3
2020 Proceedings of the American Mathematical Society article Mathematics Algebraic Geometry and Number Theory Open access

Pınar Kılıçer, Kristin Lauter, Elisa Lorenzo García, Rachel Newton, Ekin Özman, Marco Streng

1

citations